Video Coding Candidate Lists Using Non-Adjacent Intra Prediction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies, such as MPEG-2, MPEG-4, ITU-T.263, ITU-T.264/MPEG-4 AVC, ITU-T.265 HEVC, and VVC, face challenges in improving coding efficiency for video processing.
Innovation Solution
The method involves determining a candidate list for video units based on non-adjacent video units using intra block copy (IBC) or intra template matching prediction (IntraTMP), with predefined order positions or coding information, to enhance templating matching and improve coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If template matching is performed using only adjacent video units for intra block copy, then the device complexity is reduced, but the coding efficiency deteriorates due to limited search space
Solution Approach 1:
The candidate list is segmented into multiple types including spatial candidates from adjacent blocks, temporal candidates from reference frames, and non-adjacent candidates from other regions. This segmentation allows the system to explore a broader search space without overwhelming complexity by organizing candidates into manageable categories with different construction strategies.
Solution Approach 2:
Candidate lists are pre-constructioned and stored before the actual template matching process. The encoder prepares multiple candidate lists with different candidate types in advance, and the decoder can select from these pre-prepared lists, reducing the computational burden during real-time encoding and decoding operations.
2Measurement precision
If the candidate list includes more diverse video unit types including non-adjacent units, then the templating matching accuracy is improved, but the processing time increases
Solution Approach 1:
The system constructs candidate lists with a predetermined number of candidates of each type rather than exhaustively searching all possible video units. By selecting a representative subset of spatial, temporal, and non-adjacent candidates, the system achieves sufficient matching accuracy without the prohibitive computational cost of complete enumeration.
Solution Approach 2:
Different regions of the video frame are treated differently in candidate selection. Adjacent blocks provide spatial candidates for local consistency, while non-adjacent blocks provide diverse candidates for capturing global patterns. This localized quality approach optimizes the balance between accuracy and computational efficiency for different candidate types.
3Ease of operation
If predefined order positions are used for non-adjacent video units, then the ease of operation is improved, but the adaptability to different coding scenarios deteriorates
Solution Approach 1:
The candidate list construction is made dynamic by allowing the order and selection of non-adjacent video units to be adjusted based on coding scenario requirements. The system can switch between predefined order positions for simplicity and adaptive selection based on content characteristics, enabling flexibility across different video types and coding conditions while maintaining ease of operation through standardized interfaces.
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: determining, for a conversion between a video unit of a video and a bitstream of the video, a candidate list for the video unit based on one or more non-adjacent video units of the video unit, wherein the candidate list is an intra block copy (IBC) candidate list or an intra template matching prediction (IntraTMP) candidate list, wherein an order positions of the one or more non-adjacent video units is predefined or based on coding information; and performing the conversion based on the candidate list.