H04N19/533

Limited memory access window for motion vector refinement

The present disclosure relates to motion vector refinement. As a first step, an initial motion vector and a template for the block are obtained. Then, the refinement of the initial motion vector is determined by template matching with said template in a search space. The search space is located on a position given by the initial motion vector and includes one or more fractional sample positions, wherein each of the fractional sample positions belonging to the search space is obtained by interpolation filtering with a filter of a predefined tap-size assessing integer samples only within a window, said window being formed by integer samples accessible for the template matching in said search space.

Video processing methods and apparatuses for sub-block motion compensation in video coding systems

Video processing methods and apparatuses for coding a current block comprise receiving input data of a current block, partitioning the current block into multiple sub-blocks, deriving sub-block MVs for the current block according to a sub-block motion compensation coding tool, constraining the sub-block MVs to form constrained sub-block MVs, and encoding or decoding the current block using the constrained sub-block MVs. The sub-block MVs may be constrained according to a size, width, or height of the current block or a sub-block, an inter prediction direction of one of control point MVs of the current block, the current block, or current sub-block, the control point MVs, or a combination of the above.

Video processing methods and apparatuses for sub-block motion compensation in video coding systems

Video processing methods and apparatuses for coding a current block comprise receiving input data of a current block, partitioning the current block into multiple sub-blocks, deriving sub-block MVs for the current block according to a sub-block motion compensation coding tool, constraining the sub-block MVs to form constrained sub-block MVs, and encoding or decoding the current block using the constrained sub-block MVs. The sub-block MVs may be constrained according to a size, width, or height of the current block or a sub-block, an inter prediction direction of one of control point MVs of the current block, the current block, or current sub-block, the control point MVs, or a combination of the above.

MOTION CANDIDATE DERIVATION
20220295090 · 2022-09-15 ·

Embodiments of the present disclosure provide methods, apparatuses and computer storage media for video processing. One example method comprises determining, during a conversion between a current video block of a video and a bitstream of the video, a motion candidate for the current video block; refining the motion candidate by performing a local search around the motion candidate based on a template matching cost rule; and performing the conversion based on the refined motion candidate, wherein a search order of the local search is related to a coding mode of the current video block.

Video Processing Methods and Apparatuses for Sub-block Motion Compensation in Video Coding Systems
20220094966 · 2022-03-24 ·

Video processing methods and apparatuses for coding a current block comprise receiving input data of a current block, partitioning the current block into multiple sub-blocks, deriving sub-block MVs for the current block according to a sub-block motion compensation coding tool, constraining the sub-block MVs to form constrained sub-block MVs, and encoding or decoding the current block using the constrained sub-block MVs, and applying motion compensation to the current block using the constrained sub-block MVs to encode or decode the current block. The sub-block MVs may be constrained according to a size, width, or height of the current block or a sub-block, an inter prediction direction of one of control point MVs of the current block, the current block, or current sub-block, the control point MVs, or a combination of the above.

Video Processing Methods and Apparatuses for Sub-block Motion Compensation in Video Coding Systems
20220094966 · 2022-03-24 ·

Video processing methods and apparatuses for coding a current block comprise receiving input data of a current block, partitioning the current block into multiple sub-blocks, deriving sub-block MVs for the current block according to a sub-block motion compensation coding tool, constraining the sub-block MVs to form constrained sub-block MVs, and encoding or decoding the current block using the constrained sub-block MVs, and applying motion compensation to the current block using the constrained sub-block MVs to encode or decode the current block. The sub-block MVs may be constrained according to a size, width, or height of the current block or a sub-block, an inter prediction direction of one of control point MVs of the current block, the current block, or current sub-block, the control point MVs, or a combination of the above.

ERROR SURFACE BASED SUB-PIXEL ACCURATE REFINEMENT METHOD FOR DECODER SIDE MOTION VECTOR REFINEMENT

Given that decoder side motion vector refinement/derivation is a normative aspect of a coding system, the encoder will also have to perform the same error surface technique in order to not have any drift between the encoder's reconstruction and the decoder's reconstruction. Hence, all aspects of all embodiments are applicable to both encoding and decoding systems. In template matching, the refinement movement occurs only in the reference starting from the sub-pixel accurate center that is derived based on the explicitly signaled merge index or implicitly through cost evaluations. In bilateral matching (with or without averaged template), the refinements start in the reference lists L0 and L1 starting from the respective sub-pixel accurate centers that are derived based on the explicitly signaled merge index or implicitly through cost evaluations.

Error surface based sub-pixel accurate refinement method for decoder side motion vector refinement

Given that decoder side motion vector refinement/derivation is a normative aspect of a coding system, the encoder will also have to perform the same error surface technique in order to not have any drift between the encoder's reconstruction and the decoder's reconstruction. Hence, all aspects of all embodiments are applicable to both encoding and decoding systems. In template matching, the refinement movement occurs only in the reference starting from the sub-pixel accurate center that is derived based on the explicitly signaled merge index or implicitly through cost evaluations. In bilateral matching (with or without averaged template), the refinements start in the reference lists L0 and L1 starting from the respective sub-pixel accurate centers that are derived based on the explicitly signaled merge index or implicitly through cost evaluations.

PROCESSING METHOD FOR MOTION COMPENSATION, ENCODER, AND DECODER
20220103857 · 2022-03-31 ·

Processing methods for motion compensation, an encoder, and a decoder are provided. The method includes the following. Determine a search position constellation with a point pointed by an initial motion vector as a center point, where the search position constellation includes N directions, search for at least one search point by using at least one type of step lengths in the directions, where the at least one search point at least includes at least one search point in diagonal directions. Search for at least one search position from the search position constellation based on a preset range coverage rule, where the preset range coverage rule is to arrange search points in the directions for search. Obtain a new motion vector according to the at least one search position, and perform motion compensation based on the new motion vector to obtain a prediction value of a coding unit (CU).

Motion vector refinement of a motion vector pointing to a fractional sample position

A motion vector determination employs template matching. At first, an initial motion vector is obtained. If the initial motion vector points to a position that is fractional, and thus, requires interpolation from the integer sample positions, the initial motion vector is rounded to a closest integer sample position. The rounded position is then used to define the search space for the template matching to define a refinement of the initial motion vector.