Implicit Geometric Partitioning With Refined Motion Pair Blending
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards face challenges in achieving high compression efficiency, particularly with the development of advanced standards like VVC/H.266, where implicit geometric partitioning modes and motion vector handling are not optimized for efficient video encoding and decoding processes.
Innovation Solution
The application of template matching and merge motion vector differences in implicit geometric partitioning mode (GPM) to generate blending matrices for geometric partition parts of coding blocks, enhancing the encoding and decoding processes by deriving motion pair candidates from refined motion vectors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If implicit geometric partitioning mode is used without template matching and merge motion vector differences, then device complexity is reduced, but coding efficiency deteriorates
Solution Approach 1:
The patent applies template matching to refine motion vectors before generating motion pair candidates for implicit geometric partitioning. This preliminary refinement action improves the accuracy of motion vectors, enabling better coding efficiency while maintaining the simplicity of implicit GPM mode.
Solution Approach 2:
The patent introduces merge motion vector differences as an intermediary mechanism to refine motion vectors. This intermediary approach allows the system to achieve higher coding efficiency by adjusting motion vectors based on merged candidates without fundamentally changing the implicit geometric partitioning structure.
2Productivity
If template matching is applied to refine motion vectors in implicit GPM, then coding efficiency is improved, but loss of time increases
Solution Approach 1:
The patent applies template matching selectively to refine motion vectors rather than applying it universally to all blocks. This partial application approach balances coding efficiency improvement with computational time constraints, applying the refinement only where it provides the most benefit.
3Productivity
If merge motion vector differences are used to generate motion pair candidates, then coding efficiency is improved, but device complexity increases
Solution Approach 1:
The patent uses merge motion vector differences in a multi-functional manner, serving both to refine individual motion vectors and to generate motion pair candidates for implicit geometric partitioning. This universal application reduces the need for separate processing mechanisms, thereby limiting the increase in device complexity.
Data Source
AI summary
A method for decoding a bitstream includes: receiving a bitstream; and decoding the bitstream to output a video sequence. The decoding including: generating a set of motion pair candidates from refined motion vectors or merge motion vectors under an implicit geometric partitioning mode, in which the refined motion vectors are obtained by template matching; deriving, based on the set of motion pair candidates, at least two blending matrices associated with a coding block; and applying the at least two blending matrices to at least two geometric partition parts of the coding block, respectively.