Affine Merge Motion Vector Derivation for Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding technologies face challenges in efficiently encoding and decoding video data, particularly in managing bandwidth demand and optimizing motion compensation prediction.
Innovation Solution
The proposed techniques involve partitioning a current block into sub-blocks, deriving motion vectors for each sub-block based on a position rule, and processing the bitstream representation using these motion vectors. Specifically, the methods include affine motion coding mode, affine merge mode, and interweaved prediction to improve sub-block based prediction.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If non-adjacent neighboring blocks are used for deriving motion vectors in affine mode, then the prediction accuracy may be improved, but the computational complexity and processing time increase
Solution Approach 1:
The patent segments the derivation process by categorizing neighboring blocks into adjacent and non-adjacent groups. It processes adjacent blocks first to establish a baseline, then selectively applies non-adjacent block data only when needed, dividing the computational workload into manageable stages rather than processing all blocks uniformly
Solution Approach 2:
The patent performs preliminary derivation using only adjacent neighboring blocks before considering non-adjacent blocks. This preliminary action establishes a foundation that can be refined later if necessary, avoiding the need to process all blocks from the beginning and reducing overall processing time
2Measurement precision
If more neighboring blocks are considered for affine merge candidates, then the prediction accuracy improves, but the device complexity increases
Solution Approach 1:
The patent segments the candidate list construction by separating adjacent and non-adjacent block processing. It builds the candidate list in stages, first incorporating adjacent blocks and then selectively adding non-adjacent blocks, making the complex task of managing multiple neighboring blocks more systematic and manageable
Solution Approach 2:
The patent applies different processing qualities to different parts of the candidate list. Adjacent blocks receive standard processing while non-adjacent blocks undergo additional validity checks and position-based filtering, ensuring that each part of the system receives appropriate attention based on its specific requirements
3Loss of energy
If sub-block based coding is implemented, then the compression ratio improves, but the computational complexity increases
Solution Approach 1:
The patent divides the current block into multiple sub-blocks and applies affine motion modeling to each sub-block independently. This segmentation allows for more precise local motion compensation, improving compression efficiency by better matching the actual motion patterns in different regions of the block
Solution Approach 2:
The patent applies sub-block based coding selectively rather than universally. It uses affine merge mode with derived motion vectors for sub-blocks only when beneficial, allowing the system to gain compression improvements in complex regions while avoiding unnecessary computational overhead in simpler regions
Data Source
AI summary
A video processing method for efficient affine merge motion vector derivation is disclosed. In one aspect, a video processing method is provided to include partitioning a current video block into sub-blocks; deriving, for each sub-block, a motion vector, wherein the motion vector for each sub-block is associated with a position for that sub-block according to a position rule; and processing a bitstream representation of the current video block using motion vectors for the sub-blocks.