Motion Candidate List Ordering for Triangle Prediction Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding and decoding standards suffer from inefficiencies in constructing motion information candidate lists, leading to increased overhead in coding and decoding indices and reduced performance due to the selection of indices that are not the ones with the least number of bits.
Innovation Solution
A method for constructing a motion information candidate list that prioritizes the checking order for spatial candidate blocks based on their probability of being selected, specifically determining that the spatial candidate block on top of the current image block is checked before the one on the left, and constructing the list accordingly to reduce index overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a motion information candidate list is constructed using conventional checking order, then the construction process is simple, but the index overhead increases and coding performance deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-determining the checking order of spatial candidate blocks based on their probability of being selected. The top candidate block is checked first, followed by the left candidate block, ensuring that the most probable motion information is evaluated before less probable candidates. This preliminary ordering optimizes the subsequent index selection process and reduces the expected index overhead.
Solution Approach 2:
The patent changes the parameter of checking order from a conventional fixed sequence to a probability-based sequence. By adjusting the order in which candidate blocks are examined (top block before left block), the system optimizes the distribution of index values, leading to reduced index overhead and improved coding efficiency without increasing construction complexity.
2Ease of operation
If spatial candidate blocks are checked in conventional order, then the construction process is straightforward, but the number of bits for coding indices increases
Solution Approach 1:
The patent applies preliminary action by pre-determining the checking order of spatial candidate blocks based on their probability of being selected. The top candidate block is checked first, followed by the left candidate block, ensuring that the most probable motion information is evaluated before less probable candidates. This preliminary ordering optimizes the subsequent index selection process and reduces the expected index overhead.
Solution Approach 2:
The patent changes the parameter of checking order from a conventional fixed sequence to a probability-based sequence. By adjusting the order in which candidate blocks are examined (top block before left block), the system optimizes the distribution of index values, leading to reduced index overhead and improved coding efficiency without increasing construction complexity.
3Ease of manufacture
If the conventional candidate list construction is used, then implementation is simple, but video coding performance is reduced
Solution Approach 1:
The patent applies preliminary action by pre-determining the checking order of spatial candidate blocks based on their probability of being selected. The top candidate block is checked first, followed by the left candidate block, ensuring that the most probable motion information is evaluated before less probable candidates. This preliminary ordering optimizes the subsequent index selection process and reduces the expected index overhead.
Solution Approach 2:
The patent changes the parameter of checking order from a conventional fixed sequence to a probability-based sequence. By adjusting the order in which candidate blocks are examined (top block before left block), the system optimizes the distribution of index values, leading to reduced index overhead and improved coding efficiency without increasing construction complexity.
Data Source
Figure 1A(a)~2
Figure 3~5A
Figure 5B
AI summary
The present disclosure provides a method for constructing a motion information candidate list, a method and an apparatus for triangle prediction decoding. The method includes: determining a checking order for each of spatial candidate blocks of a current image block; wherein the checking order for the spatial candidate block on top of the current image block is prior to the checking order for the spatial candidate block on the left of the current image block; determining spatial candidate motion information based on the checking order; and constructing a motion information candidate list corresponding to the current image block based on the spatial candidate motion information. The method can reduce coding consumption, and improve coding performance.