Motion Vector Refinement Search Region Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video codecs face challenges in efficiently determining motion vectors for inter-prediction, which affects coding efficiency and complexity.
Innovation Solution
A scheme is introduced to construct a search space for motion vector refinement, involving a first search space and a second search space. The second search space is determined based on two positions in the first search space derived using a cost function, allowing for a reduced number of candidate motion vectors to be tested while maintaining high coding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a large number of candidate motion vectors are tested in the search space, then motion vector accuracy is improved, but computational complexity and processing time increase
Solution Approach 1:
The patent divides the search space into multiple regions and processes candidate motion vectors in stages. First, a coarse search is performed to identify promising regions, then refined searches are conducted in those specific regions. This segmentation allows the system to achieve high accuracy without exhaustively searching all possible candidates, thereby reducing computational complexity while maintaining motion vector precision.
Solution Approach 2:
The patent performs preliminary actions by conducting an initial coarse search to identify regions of interest before performing detailed refined searches. This preliminary identification of promising areas allows the system to focus computational resources on the most likely candidates, achieving high accuracy without the need to evaluate all possible motion vectors, thus reducing overall computational complexity.
2Manufacturing precision
If motion vector refinement is performed with high precision, then picture quality is improved, but encoding time and processing resources increase
Solution Approach 1:
The patent implements a dynamic, multi-stage search strategy where the search precision and scope are adaptively adjusted based on the characteristics of the current block and preliminary search results. The system performs coarse searches first, then dynamically refines the search in specific regions with higher precision only where necessary. This dynamic approach maintains high picture quality through precise motion vectors while significantly reducing encoding time compared to uniform high-precision searching.
Solution Approach 2:
The patent performs preliminary coarse searches to identify promising regions before conducting detailed refined searches. This preliminary action allows the system to achieve high picture quality through accurate motion vectors while avoiding the need to perform exhaustive high-precision searches across the entire search space, thereby reducing encoding time and processing resources.
3Productivity
If the search space is reduced to decrease computational load, then processing speed is improved, but motion vector accuracy may deteriorate
Solution Approach 1:
The patent segments the search process into multiple stages with different scopes and precision levels. The coarse search stage covers a broader area to identify promising regions, while the refined search stage focuses on specific regions with higher precision. This segmentation allows the system to maintain high motion vector accuracy while achieving fast processing speeds by avoiding exhaustive searches, thus resolving the contradiction between processing speed and accuracy.
Solution Approach 2:
The patent performs preliminary coarse searches to quickly identify regions of interest before conducting detailed refined searches in those specific areas. This preliminary action enables the system to achieve high processing speeds by avoiding unnecessary exhaustive searches, while still maintaining motion vector accuracy through subsequent refined searches in the identified promising regions.
Data Source
AI summary
A method for determining a motion vector to be used in inter-prediction of a current block of a video picture, the method comprising: obtaining an initial motion vector; obtaining at least two groups of points according to the initial motion vector, wherein a first group of the at least two groups of points only includes a first point corresponding to the initial motion vector and additional N points with N≥0 and wherein each point of the first group is closer to the first point than any point of the points of a second group of the at least two groups; and obtaining the motion vector for the current block according to the at least two groups of points and a cost function.