Inter-frame Prediction Motion Vector Candidate List Construction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video encoding systems face challenges in determining motion vector candidate lists for inter-frame prediction, which affects the accuracy and efficiency of video compression.
Innovation Solution
A system and method that obtain a current coding unit and determine a second motion vector candidate list based on a first candidate list, including bidirectional and unidirectional motion vectors, to divide the unit into image blocks and calculate prediction values using interpolation and weighting algorithms to improve prediction accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a motion vector candidate list is determined to improve prediction accuracy, then the accuracy of inter-frame prediction is improved, but the complexity of the encoding process increases
Solution Approach 1:
The candidate list is segmented into two types: first MV candidates (from spatial and temporal neighbors) and second MV candidates (constructed from first candidates). This segmentation allows the system to manage complexity by organizing candidates in stages rather than processing all candidates simultaneously.
Solution Approach 2:
The system performs preliminary construction of second MV candidates from first MV candidates before final selection. This preliminary action prepares the data structure in advance, reducing the computational burden during the final prediction stage and improving overall encoding efficiency.
2Productivity
If more motion vector candidates are considered to improve prediction accuracy, then the compression efficiency is improved, but the computational time increases
Solution Approach 1:
The system constructs a second MV candidate list that may include duplicate or redundant candidates from the first list. This partial action approach ensures that sufficient candidates are available for accurate prediction without requiring an excessively large candidate pool, thus balancing computational time with compression efficiency.
Solution Approach 2:
The system changes the parameter of candidate availability by constructing second MV candidates from first MV candidates using different derivation methods (e.g., scaling, flipping, or direct copying). This parameter transformation allows the system to generate diverse candidates from a limited initial set, improving compression efficiency without proportionally increasing computational time.
Data Source
AI summary
The present disclosure provides a method for inter-frame prediction of a coding unit in an image. The method may include obtaining a first MV candidate list corresponding to the coding unit and the first MV candidate list may be constructed based on a non-triangle prediction mode, such as a merge mode. The method may also include determining, based on the first MV candidate list, a second MV candidate list corresponding to the coding unit. The second MV candidate list may be a triangle candidate list used for inter-prediction using a triangle prediction mode. MVs in the second MV candidate list may be determined based on MVs in the first MV candidate list. The method may also include determining, based on the second MV candidate list, a target prediction unit of the current coding unit according to a triangle prediction mode.