Video Processing Motion Candidate Reordering for Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding technologies, such as HEVC and VVC, face limitations in coding efficiency due to conventional motion candidate list construction methods, which do not effectively reorder motion candidates to optimize compression performance.
Innovation Solution
The proposed method involves reordering or refining the motion candidate list based on specific criteria during the conversion between a target block and its bitstream, using techniques like template matching and adaptive merge candidate reordering to improve the selection of motion vectors, thereby enhancing coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional motion candidate list construction methods are used, then the process is simple, but coding efficiency is limited
Solution Approach 1:
The patent applies dynamics by making the motion candidate list construction process adaptive and flexible. Different reordering methods are selected based on block characteristics, and the candidate list is dynamically adjusted during the encoding process to optimize coding efficiency while managing complexity through intelligent selection rather than fixed rigid rules.
Solution Approach 2:
The patent changes parameters related to motion candidate list construction by introducing multiple reordering methods (e.g., based on motion vector magnitude, temporal distance, or spatial position) and selecting appropriate parameters dynamically. This allows the system to adapt to different video content characteristics and achieve better coding efficiency without excessive complexity.
2Productivity
If motion candidates are reordered using complex criteria, then coding efficiency improves, but computational complexity increases
Solution Approach 1:
The patent applies partial action by implementing reordering methods that process only the most relevant motion candidates rather than all candidates uniformly. The system performs reordering based on specific criteria (such as motion vector magnitude or temporal distance) only when and where it provides significant benefit, avoiding unnecessary computational overhead for all candidates and achieving a balance between compression performance and computational complexity.
Solution Approach 2:
The patent uses preliminary action by pre-establishing multiple reordering methods and criteria before the actual encoding process. The system prepares different reordering strategies in advance and selects the most appropriate one based on block characteristics, avoiding the need to compute and evaluate all possible reordering methods during the critical encoding process, thus reducing real-time computational complexity.
3Measurement precision
If motion candidate list is constructed without reordering, then processing is fast, but selection of motion vectors is not optimized
Solution Approach 1:
The patent applies preliminary action by pre-defining multiple reordering methods and criteria before the encoding process. The system prepares different reordering strategies in advance and selects the most appropriate one based on block characteristics, avoiding the need to compute and evaluate all possible reordering methods during the critical encoding process, thus reducing real-time computational complexity.
Solution Approach 2:
The patent applies dynamics by making the motion candidate list construction process adaptive and flexible. Different reordering methods are selected based on block characteristics, and the candidate list is dynamically adjusted during the encoding process to optimize coding efficiency while managing complexity through intelligent selection rather than fixed rigid rules.
Data Source
AI summary
Embodiments of the present disclosure provide a solution for video processing. A method for video processing is proposed. The method comprises: applying, during a conversion between a target block of a video and a bitstream of the target block, a reordering or refined process to motion candidates during constructing a motion candidate list based on the motion candidates; and performing the conversion based on the constructed motion candidate list.