Inter Prediction Candidate Lists Using FIFO History Queues
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face inefficiencies in constructing candidate lists for inter prediction, particularly in advanced codecs like VVC, leading to increased computational complexity and suboptimal coding performance.
Innovation Solution
A method for constructing candidate lists using a first-in-first-out (FIFO) queue to store historical inter prediction information, combined with template matching costs and scanner order, to determine the most suitable inter prediction parameters for current blocks, allowing for efficient selection of inter prediction candidates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional candidate list construction methods are used for inter prediction, then coding performance can be maintained, but computational complexity increases and coding efficiency decreases
Solution Approach 1:
The patent applies preliminary action by pre-organizing candidate blocks into a FIFO queue structure before the actual prediction process. Historical inter prediction information is stored and managed in advance, allowing the decoder to efficiently retrieve and evaluate candidates without performing complex search operations during decoding, thus reducing computational complexity while maintaining coding efficiency
Solution Approach 2:
The patent changes the parameter of candidate organization from traditional spatial/temporal ordering to FIFO queue-based historical information ordering. This parameter change allows the system to prioritize candidates based on their historical prediction quality and recency, improving coding efficiency by selecting better predictors while reducing the computational burden of candidate evaluation
2Reliability
If more candidate blocks are included in the candidate list, then coding performance improves, but computational complexity and processing time increase
Solution Approach 1:
The patent extracts only the most relevant inter prediction information from historical data and stores it in the FIFO queue. By taking out only the essential prediction parameters and organized candidates rather than processing all possible candidate blocks, the system achieves good coding performance with reduced processing time compared to evaluating exhaustive candidate lists
Solution Approach 2:
The patent applies partial action by maintaining a limited-size FIFO queue that contains a subset of the most valuable candidate blocks. Rather than including all possible candidates, the system uses a partial set of historically relevant candidates that provides sufficient coding performance while avoiding the time cost of processing excessive candidates
Data Source
AI summary
A method includes receiving a bitstream of coded information for a sequence of pictures, the coded information indicates an inter prediction of a current block in a current picture using a formular based inter prediction technique, the formular based inter prediction technique generates a prediction sample of the current block based on a formular with reconstructed samples of a reference block in a reference picture being input to the formular, the formular includes parameters derived based on a current template of the current block and a reference template of the reference block. The method also includes constructing a candidate list including one or more coded blocks associated with the current block, a coded block in the one or more coded blocks is a candidate that provides formular based inter prediction information.