# US 2021/0243438 A1 · Extensions of inter prediction with geometric partitioning > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2021/0243438 A1 - Document ID: US20210243438A1 - Status: Published application - Kind: A1 - Application number: 17/228,903 - Filed: 2021-04-13 - Published: 2021-08-05 - Earliest claimed: 2018-11-06 - Assignees: Beijing Bytedance Network Technology Co., Ltd.; Bytedance Inc. - Applicants: Beijing Bytedance Network Technology Co., Ltd.; Bytedance Inc. - Inventors: Li ZHANG; Kai ZHANG; Hongbin LIU; Yue WANG - Web page: https://patentgrep.com/patent/US20210243438A1 ## CPC - H04N 19/109: among a plurality of temporal predictive coding modes - H04N 19/176: the region being a block, e.g. a macroblock - H04N 19/105: Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction - H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks - H04N 19/137: Motion inside a coding unit, e.g. average field, frame or block difference - H04N 19/139: Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability - H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction - H04N 19/18: the unit being a set of transform coefficients - H04N 19/184: the unit being bits, e.g. of the compressed video stream - H04N 19/186: the unit being a colour or a chrominance component - H04N 19/1883: {the unit relating to sub-band structure, e.g. hierarchical level, directional tree, e.g. low-high [LH], high-low [HL], high-high [HH]} - H04N 19/196: being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters (processing of motion vectors H04N19/513) - H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence) - H04N 19/50: using predictive coding (H04N19/61 takes precedence) - H04N 19/51: Motion estimation or motion compensation - H04N 19/52: by predictive encoding - H04N 19/521: {for estimating the reliability of the determined motion vectors or motion vector field, e.g. for smoothing the motion vector field or for correcting motion vectors} - H04N 19/583: Motion compensation with overlapping blocks - H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards - G06T 7/223: using block-matching - G06T 9/40: Tree coding, e.g. quadtree, octree - H04N 19/42: characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation (H04N19/635 takes precedence) - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION - G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL ## Abstract A method for processing a video includes performing a determination, by a processor, that a first video block is partitioned to include a first prediction portion that is non-rectangular and non-square; adding a first motion vector (MV) prediction candidate associated with the first prediction portion to a motion candidate list associated with the first video block, wherein the first MV prediction candidate is derived from a sub-block MV prediction candidate; and performing further processing of the first video block using the motion candidate list. ## Claims ### Claim 1 A method of video processing, comprising: making a determination that a conversion between a video block of a video region of a video and a bitstream of the video uses a geometry partition mode in which the video block is partitioned into multiple prediction partitions including at least a first prediction partition; deriving N motion information candidates using one or more sub-block merge candidates associated with the video block and adding the N motion information candidates to a motion candidate list for the video block, where N is a positive integer; deriving, from the motion candidate list, motion candidates for the multiple prediction partitions; and performing the conversion based on the motion candidates for the multiple prediction partitions. ### Claim 2 (depends on 1) The method of claim 1, wherein a sub-block temporal motion vector predictor candidate or an affine motion candidate is used for deriving the N motion information candidates. ### Claim 3 (depends on 1) The method of claim 1, wherein M representative motion information candidates from one or more sub-block motion candidates of one or more sub-blocks are used for deriving the M motion information candidates, where M is a positive integer. ### Claim 4 (depends on 3) The method of claim 3, wherein the M representative motion information candidates are selected based positions of the one or more sub-blocks or selected from motion information associated with a center sub-block of the first prediction partition, wherein M is equal to a number of partitions in which the video block is partitioned for the conversion, or M=1. ### Claim 5 (depends on 1) The method of claim 1, further comprising: adding a first motion information candidate to a first candidate list associated with the first prediction partition and a second motion information candidate associated to a second candidate list associated with a second prediction partition, wherein the first motion information candidate and the second motion information candidate are inherited from a single motion candidate; and performing the conversion using the first motion information candidate and/or the second motion information candidate. ### Claim 6 (depends on 5) The method of claim 5, wherein a range of indication of splitting patterns and MV candidate indices for the first prediction partition and the second prediction partition is M*N*N, wherein M is a number of prediction portions that the first video block is partitioned into, and wherein N is a number of allowed merge candidates to be added to a motion candidate list including the first motion information candidate and the second motion information candidate. ### Claim 7 (depends on 6) The method of claim 6, wherein a specific weighting factor group is used for samples located in a weighted area of the video block according to the splitting pattern, wherein the specific weighting factor group is different from another weighting factor group used for another video block in which different motion candidates are used for determining candidate motion vectors for prediction portions of the another video block. ### Claim 8 (depends on 7) The method of claim 7, wherein the specific weighting factor group corresponds to averaging for the samples located in the weighted area. ### Claim 9 (depends on 1) The method of claim 1, wherein the performing the conversion includes deriving a refined final motion vector for a prediction block for the video block, and wherein the deriving the refined final motion vector includes using a decoder-side motion vector refinement (DMVR) tool to a motion information of the first prediction partition and a motion information of the second prediction partition of the first video block to derive motion information for the video block. ### Claim 10 (depends on 9) The method of claim 9, wherein the first prediction partition is uni-predicted from a first reference list and the second prediction partition is bi- or uni-predicted using a second reference list, then the DMVR tool or a bi-directional optical flow (BIO) tool are applied using motion information of the second prediction portion in the second reference list. ### Claim 11 (depends on 9) The method of claim 9, wherein the conversion uses a final prediction that is a weighted sum of a prediction result based on the geometry partition mode and a prediction result based on an intra-prediction mode. ### Claim 12 (depends on 1) The method of claim 1, wherein a sub-block of the prediction partition is assigned a sub-block motion information thereof, and wherein the sub-block motion information is used as a candidate in a candidate list used for the conversion of the video block. ### Claim 13 (depends on 1) The method of claim 1, wherein the conversion comprises deriving one or more motion vector prediction candidates in a motion candidate list are derived from a sub-block temporal motion vector predictor (SbTMVP) candidate associated with the sub-block. ### Claim 14 (depends on 1) The method of claim 1, wherein an indication in the bitstream representation signals, at a sequence parameter set level or a picture parameter set level or a video parameter set level or a picture header or a slice header or a tile group header or a coding tree unit level, use of the geometry partition mode for the video block. ### Claim 15 (depends on 1) The method of claim 1, wherein the size condition specifies to use the geometry partition mode due to the video block having a size greater than a threshold or having a size less than a threshold, or having a pre-defined width to height ratio. ### Claim 16 (depends on 1) The method of claim 1, wherein the geometry partition mode includes multiple splitting patterns and each splitting pattern divides the video block into two or more partitions. ### Claim 17 (depends on 1) The method of claim 1, wherein the conversion comprises encoding the video into the bitstream. ### Claim 18 (depends on 1) The method of claim 1, wherein the conversion comprises decoding the bitstream to generate pixel values of the video. ### Claim 19 A video processing apparatus comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: make a determination that a conversion between a video block of a video region of a video and a bitstream of the video uses a geometry partition mode in which the video block is partitioned into multiple prediction partitions including at least a first prediction partition; derive N motion information candidates using one or more sub-block merge candidates associated with the video block and adding the N motion information candidates to a motion candidate list for the video block , where N is a positive integer; derive, from the motion candidate list, motion candidates for the multiple prediction partitions; and perform the conversion based on the motion candidates for the multiple prediction partitions. ### Claim 20 A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: making a determination that a conversion between a video block of a video region of a video and a bitstream of the video uses a geometry partition mode in which the video block is partitioned into multiple prediction partitions including at least a first prediction partition; deriving N motion information candidates using one or more sub-block merge candidates associated with the video block and adding the N motion information candidates to a motion candidate list for the video block , where N is a positive integer; deriving, from the motion candidate list, motion candidates for the multiple prediction partitions generating the bitstream based on the motion candidates for the multiple prediction partitions.