VVC Spatial Merge Candidate Lists for Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards face challenges in efficiently constructing merge candidate lists, particularly in advanced standards like VVC, which affect coding efficiency and compression performance.
Innovation Solution
The method involves constructing a first merge candidate list by adding specific neighboring blocks, including top, left, and above-left neighboring blocks when available, to improve the order and number of spatial merge candidates in VVC.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the traditional merge candidate list construction method is used, then the implementation is simpler, but the coding efficiency and compression performance are lower
Solution Approach 1:
The patent segments the merge candidate list construction into multiple distinct parts: spatial merge candidates from different neighboring blocks (A0, A1, B0, B1, B2), temporal merge candidates, and combined candidates. This segmentation allows for optimized selection of candidates from specific spatial locations, improving coding efficiency by providing more relevant motion information while maintaining manageable complexity through structured organization.
Solution Approach 2:
The patent extends the traditional merge candidate selection by adding above-left neighboring blocks (B2) to the conventional top (B0, B1) and left (A0, A1) neighbors. This dimensional expansion in the spatial domain provides additional motion prediction sources, enhancing coding efficiency by capturing motion patterns from more directions without significantly increasing overall system complexity.
2Measurement precision
If more spatial merge candidates are added to improve prediction accuracy, then the compression performance improves, but the computational complexity increases
Solution Approach 1:
The patent applies local quality by selecting merge candidates from specific neighboring block positions (A0, A1, B0, B1, B2) based on their spatial relationship to the current block. Each position provides locally relevant motion information, improving prediction accuracy for specific motion patterns while maintaining controlled complexity through position-based selection rules.
Solution Approach 2:
The patent changes the parameter of merge candidate quantity and diversity by incorporating candidates from five different neighboring block positions instead of the traditional fewer positions. This parameter change increases motion prediction accuracy by providing more varied motion information sources while the structured selection process keeps computational complexity manageable.
Data Source
AI summary
A video processing method is provided. The method includes inserting a set of spatial merge candidates to a first merge candidate list of a coding block, wherein the first merge candidate list is constructed by: adding a top neighboring block B1 to the first merge candidate list when the top neighboring block B1 is available; adding a left neighboring block A1 to the first merge candidate list when the left neighboring block A1 is available; adding a top neighboring block B0 to the first merge candidate list when the top neighboring block B0 is available; adding a left neighboring block A0 to the first merge candidate list when the left neighboring block A0 is available; and adding an above-left neighboring block B2 to the first merge candidate list when the above-left neighboring block B2 is available.