Template-Matched Motion Refinement in Geometric Partition Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards, such as VVC/H.266, face challenges in achieving optimal compression efficiency and accuracy in motion vector estimation, particularly in geometric partition modes, which affect the overall quality and bandwidth requirements of video processing.
Innovation Solution
Implementing template matching to refine motion information for coding units in geometric partition mode (GPM), where a first parameter indicates whether template matching is applied, enhancing the precision of motion vector estimation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If template matching is applied to refine motion information in geometric partition mode, then motion vector estimation precision is improved, but computational complexity increases
Solution Approach 1:
The patent applies template matching as a preliminary refinement step after initial motion vector estimation. By pre-defining template regions and matching them against reference frames before final motion compensation, the system achieves higher precision motion vectors without completely redesigning the entire motion estimation pipeline, thus managing computational complexity while improving accuracy
2Productivity
If geometric partition mode is used to improve coding efficiency, then compression performance is improved, but bandwidth requirements increase
Solution Approach 1:
The patent divides the coding unit into geometric partitions (triangular or polygonal regions) rather than using traditional rectangular blocks. This segmentation allows for more accurate motion representation in regions with different motion characteristics, improving coding efficiency. By capturing motion more accurately through geometric segmentation, fewer bits are needed to represent the same visual quality, thereby reducing bandwidth requirements
3Reliability
If motion information is refined using template matching, then video processing quality is improved, but processing time increases
Solution Approach 1:
The patent applies template matching selectively rather than to all coding units. By determining which coding units benefit most from template matching refinement and applying the process only to those cases, the system improves video processing quality where needed while minimizing the overall processing time increase. This partial application strategy balances quality improvement with computational efficiency
Data Source
AI summary
A method, an apparatus and non-transitory computer-readable storage medium for video data process are provided. The method includes receiving a bitstream comprising a coding unit coded in a geometric partition mode (GPM); decoding a first parameter associated with the coding unit, the first parameter indicating whether template matching being applied to the coding unit; and determining, according to the first parameter, motion information for the coding unit, wherein when the first parameter indicates the template matching is applied to the coding unit, the motion information is refined using the template matching.