Ordered Neighbor Selection in VVC Merge Candidate Lists
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 can impact 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 traditional merge candidate list construction methods are 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 merge candidates. Each segment is constructed and inserted into the list separately, allowing for optimized processing of each type while maintaining overall system organization and improving coding efficiency through structured candidate selection
Solution Approach 2:
The patent performs preliminary actions by pre-constructing spatial merge candidate lists from available neighboring blocks before the actual merge mode decision. The encoder prepares multiple types of merge candidates (spatial, temporal, combined) in advance and stores them in a structured list, so that during encoding the decoder can efficiently select from pre-computed options without performing complex calculations in real-time, thus improving coding efficiency
Solution Approach 3:
The patent extends the traditional two-dimensional spatial merge candidate selection by incorporating temporal dimension through temporal merge candidates from reference pictures. Additionally, it introduces a third dimension by creating combined merge candidates that merge spatial and temporal information. This multi-dimensional approach enriches the candidate pool and improves compression performance by providing diverse prediction options
2Productivity
If more spatial merge candidates are added to the list, then the compression performance improves, but the computational complexity increases
Solution Approach 1:
The patent applies local quality by constructing different types of merge candidates with specialized characteristics suited for specific local situations. Spatial merge candidates capture local spatial correlations from neighboring blocks, temporal candidates capture temporal correlations from reference pictures, and combined candidates capture both. This localized specialization allows the system to achieve high compression performance by selecting the most appropriate candidate type for each local context without uniformly increasing complexity across all scenarios
Solution Approach 2:
The patent implements partial action by selectively constructing and inserting only the necessary types of merge candidates based on availability and relevance. Not all five spatial neighboring blocks will always provide valid candidates, and the system selectively processes available ones rather than forcing construction of all possible candidates. This selective approach achieves sufficient compression performance without the excessive computational cost of processing all potential candidates uniformly
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.