Video Motion Candidate Processing for GPM Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies, such as MPEG-2, MPEG-4, AVC, HEVC, and VVC, face challenges in improving coding efficiency, particularly in the generation of merge candidate lists during video encoding and decoding processes.
Innovation Solution
Implementing an adaptive geometric partitioning mode (GPM) for constructing motion candidate lists, which involves processing each motion candidate with a coded candidate index before application, to enhance the effectiveness of merge mode and improve coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional merge candidate list generation process is used, then device complexity is reduced, but coding efficiency deteriorates
Solution Approach 1:
The patent implements dynamic adaptation of merge candidate lists based on video content characteristics and block structures. The system adjusts the candidate selection process adaptively rather than using a fixed conventional approach, allowing the merge candidate list generation to respond to varying video content and improve coding efficiency while managing complexity through intelligent adaptation.
Solution Approach 2:
The patent modifies parameters related to merge candidate selection by introducing adaptive mechanisms that change candidate list composition based on video content analysis. This includes dynamically adjusting which candidates are included and how they are selected, thereby improving coding efficiency without requiring a complete redesign of the overall system architecture.
2Productivity
If adaptive merge candidate list generation is implemented, then coding efficiency is improved, but device complexity increases
Solution Approach 1:
The patent segments the merge candidate list generation process into distinct stages and components, allowing adaptive mechanisms to be applied selectively to specific parts of the process. This segmentation enables improved coding efficiency through adaptive selection while managing overall system complexity by localizing the adaptive logic to specific segments rather than requiring global complexity increases.
3Loss of information
If motion candidate selection is refined, then compression performance is improved, but computational complexity increases
Solution Approach 1:
The patent applies partial refinement to motion candidate selection by focusing adaptive processing on the most significant candidates rather than uniformly processing all candidates. This approach improves compression performance by concentrating computational resources on the candidates that provide the greatest benefit, thereby achieving better results with reduced overall computational complexity compared to exhaustive refinement of all candidates.
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: constructing, during a conversion between a target block of a video and a bitstream of the target block, a motion candidate list for a target block which is coded with a geometric partitioning mode (GPM), the candidate list comprising one or more candidates; processing the candidate list before applying the candidate list, each candidate in the processed candidate list having a coded candidate index; and performing the conversion using the processed candidate list.