# US 12,015,762 B2 · DMVR using decimated prediction block > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,015,762 B2 - Document ID: US12015762B2 - Status: Granted - Kind: B2 - Application number: 17/466,129 - Filed: 2021-09-03 - Published: 2021-12-23 - Granted: 2024-06-18 - Earliest claimed: 2019-03-05 - Assignees: Huawei Technologies Co., Ltd. - Applicants: Huawei Technologies Co., Ltd. - Inventors: Sriram Sethuraman; Semih Esenlik; Jeeva Raj A; Sagar Kotecha - Web page: https://patentgrep.com/patent/US12015762B2 ## CPC - 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/577: Motion compensation with bidirectional frame interpolation, i.e. using B-pictures - H04N 19/132: Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking - H04N 19/137: Motion inside a coding unit, e.g. average field, frame or block difference - H04N 19/154: Measured or subjectively estimated visual quality after decoding, e.g. measurement of distortion (use of rate-distortion criteria H04N19/147) - H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction - H04N 19/176: the region being a block, e.g. a macroblock - H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence) - H04N 19/52: by predictive encoding - H04N 19/56: Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search - H04N 19/57: Motion estimation characterised by a search window with variable size or shape - H04N 19/61: in combination with predictive coding - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract The present disclosure provides an inter prediction method, comprising the steps of obtaining an initial motion vector and a reference picture for bi-prediction; obtaining sets of candidate sample positions in the reference picture according to the initial motion vector and candidate motion vectors, wherein each candidate motion vector is derived by the initial motion vector and a respective motion vector offset, and wherein each set of candidate sample positions corresponds to each candidate motion vector; obtaining a respective set of sample positions from each set of candidate sample positions; computing a matching cost for each candidate motion vector within each set of sample positions; obtaining a refined motion vector based on the computed matching cost of each candidate motion vector; and obtaining prediction values for a current block based on the refined motion vector. ## Claims ### Claim 1 An inter prediction method, comprising: obtaining an initial motion vector and a reference picture for bi-prediction; obtaining one or more sets of candidate sample positions in the reference picture according to a plurality of candidate motion vectors, wherein each candidate motion vector is derived based on the initial motion vector and each preset motion vector offset, and wherein each set of candidate sample positions corresponds to each candidate motion vector; obtaining each set of sample positions from each set of candidate sample positions; computing a matching cost for each candidate motion vector within each set of sample positions; obtaining a refined motion vector based on the computed matching cost of each candidate motion vector; and obtaining prediction values for a current block based on the refined motion vector wherein a zipper pattern of positions of interpolated samples in a set of the candidate sample positions are chosen as the set of sample positions, wherein even parity rows produce first predicted samples at a predetermined number of contiguous sample positions that are left (or right) justified, and odd parity rows produce predicted samples at the pre-determined number of contiguous sample positions that are right (or left) justified, respectively. ### Claim 2 (depends on 1) The method of claim 1, wherein the initial motion vector or the reference picture are obtained based on indication information signaled in a bitstream. ### Claim 3 (depends on 1) The method of claim 1, wherein the initial motion vector is obtained according to a motion vector predictor and a motion vector difference value signaled in a bitstream. ### Claim 4 (depends on 3) The method of claim 3, wherein the motion vector predictor is indicated by an index signaled in the bitstream, and wherein the index is used to indicate a position in a list of candidate vector. ### Claim 5 (depends on 1) The method of claim 1, wherein the matching cost is computed using one or more of a similarity metric, a dis-similarity metric, a sum of absolute differences (SAD), a mean removed sum of absolute differences (MRSAD), or a sum of squared errors (SSE). ### Claim 6 (depends on 1) The method of claim 1, wherein a set of the candidate sample positions is within a bounding rectangular region, and wherein the bounding rectangular region is computed by using the initial motion vector, a top-left position of the current block, and a motion vector refinement range in a horizontal direction and a vertical direction. ### Claim 7 (depends on 1) The method of claim 1, wherein a set of sample positions is obtained through a regular decimation of a set of the candidate sample positions. ### Claim 8 (depends on 1) The method of claim 1, wherein sample positions on alternate rows in a set of the candidate sample positions are chosen as the set of sample positions. ### Claim 9 (depends on 1) The method of claim 1, wherein the initial motion vector is a first motion vector or a second motion vector, and wherein the first motion vector and the second motion vector correspond to a different reference picture list. ### Claim 10 A non-transitory machine-readable storage medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations, the operations comprising: obtaining an initial motion vector and a reference picture for bi-prediction; obtaining one or more sets of candidate sample positions in the reference picture according to candidate motion vectors, wherein each candidate motion vector is derived by the initial motion vector and each preset motion vector offset, and wherein each set of candidate sample positions corresponds to each candidate motion vector; obtaining each set of sample positions from each set of candidate sample positions; computing a matching cost for each candidate motion vector within each set of sample positions; obtaining a refined motion vector based on the computed matching cost of each candidate motion vector; and obtaining prediction values for a current block based on the refined motion vector wherein a zipper pattern of positions of interpolated samples in a set of the candidate sample positions are chosen as the set of sample positions, wherein even parity rows produce first predicted samples at a predetermined number of contiguous sample positions that are left (or right) justified, and odd parity rows produce predicted samples at the pre-determined number of contiguous sample positions that are right (or left) justified, respectively. ### Claim 11 A decoder, comprising: a processor; and a memory coupled to the processor to store instructions, executed by the processor, cause the processor to perform operations, the operations comprising: obtaining an initial motion vector and a reference picture for bi-prediction; obtaining one or more sets of candidate sample positions in the reference picture according to candidate motion vectors, wherein each candidate motion vector is derived by the initial motion vector and each preset motion vector offset, and wherein each set of candidate sample positions corresponds to each candidate motion vector; obtaining each set of sample positions from each set of candidate sample positions; computing a matching cost for each candidate motion vector within each set of sample positions; obtaining a refined motion vector based on the computed matching cost of each candidate motion vector; and obtaining prediction values for a current block based on the refined motion vector, wherein a zipper pattern of positions of interpolated samples in a set of the candidate sample positions are chosen as the set of sample positions, wherein even parity rows produce first predicted samples at a predetermined number of contiguous sample positions that are left (or right) justified, and odd parity rows produce predicted samples at the pre-determined number of contiguous sample positions that are right (or left) justified, respectively. ### Claim 12 (depends on 11) The decoder of claim 11, wherein the initial motion vector or the reference picture are obtained based on indication information signaled in a bitstream. ### Claim 13 (depends on 11) The decoder of claim 11, wherein the initial motion vector is obtained according to a motion vector predictor and a motion vector difference value signaled in a bitstream. ### Claim 14 (depends on 13) The decoder of claim 13, wherein the motion vector predictor is indicated by an index signaled in the bitstream, and wherein the index is used to indicate a position in a list of candidate vector. ### Claim 15 (depends on 11) The decoder of claim 11, wherein the matching cost is computed by using one or more of a similarity metric, a dis-similarity metric, a sum of absolute differences (SAD), a mean removed sum of absolute differences (MRSAD), or a sum of squared errors (SSE). ### Claim 16 (depends on 11) The decoder of claim 11, wherein a set of the candidate sample positions is within a bounding rectangular region, and wherein the bounding rectangular region is computed using the initial motion vector, a top-left position of the current block, and a motion vector refinement range in a horizontal direction and a vertical direction. ### Claim 17 (depends on 11) The decoder of claim 11, wherein a set of sample positions is obtained through a regular decimation of a set of the candidate sample positions. ### Claim 18 (depends on 11) The decoder of claim 11, wherein sample positions on alternate rows in a set of the candidate sample positions are chosen as the set of sample positions.