Inter-Prediction Candidate Lists for Block-Based Image Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing image encoding/decoding technologies face challenges in determining and managing candidate lists for inter-prediction, which affects the efficiency and performance of image compression and decoding.
Innovation Solution
The method involves constructing candidate lists for inter-prediction by classifying blocks into types based on coding parameters, including spatially neighboring, temporal neighboring, and non-neighboring blocks, and generating integrated lists by adding candidates in a predetermined order, using motion information derivation methods.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single unified candidate list is used for inter-prediction, then the management complexity is reduced, but the prediction performance deteriorates due to inability to differentiate between different block types
Solution Approach 1:
The patent divides the candidate list into multiple type-specific candidate lists (first type for spatially neighboring blocks, second type for temporal neighboring blocks, third type for non-neighboring blocks). This segmentation allows each list to be optimized for its specific block type characteristics, improving prediction accuracy while maintaining manageable complexity through organized categorization.
2Manufacturing precision
If multiple type-specific candidate lists are constructed and managed, then the prediction performance improves through differentiated candidate selection, but the device complexity increases due to multiple list management operations
Solution Approach 1:
The patent implements dynamic candidate list management where the selection and construction of candidate lists adapts based on block type classification. Different candidate lists are constructed and merged dynamically according to the specific block characteristics, allowing the system to optimize prediction performance for each block type while managing complexity through adaptive rather than static list management.
Solution Approach 2:
The patent employs a nested structure where type-specific candidate lists are constructed independently and then merged into an integrated candidate list. Each type-specific list contains candidates optimized for particular block characteristics, and these nested lists are systematically combined through predetermined merging operations, improving prediction accuracy while organizing complexity in a hierarchical manner.
3Speed
If candidates are selected without classification by block type, then the processing speed is faster due to simpler selection logic, but the prediction performance deteriorates due to suboptimal candidate matching
Solution Approach 1:
The patent performs preliminary classification of blocks into types (spatially neighboring, temporal neighboring, non-neighboring) before candidate selection. This preliminary action organizes blocks into categories that can be efficiently matched with appropriate candidate lists, maintaining processing speed through pre-established classification while improving prediction accuracy by selecting candidates tailored to each block type's characteristics.
Data Source
AI summary
This disclosure provides an image encoding/decoding method and device and recording medium storing a bitstream. The image decoding method may comprise: constructing a candidate list related to prediction of a current block; generating a prediction block of the current block based on a candidate selected from the candidate list; and generating a reconstructed block of the current block based on the prediction block, wherein the constructing of the candidate list includes: generating a candidate list for each of two or more types classified based on at least one coding parameter; and generating an integrated candidate list by adding at least one candidate selected in the candidate list for each type in a predetermined order, and wherein the at least one coding parameter is a motion information derivation method, and the two or more types include a first type of a spatially neighboring block, a second type of a temporal neighboring block and a third type of a non-neighboring block.