Boundary-Matched Coding Mode Selection for Inter Prediction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding systems, such as VVC, face inefficiencies in coding efficiency due to the complexity and computational overhead of inter prediction processes, particularly in handling various types of video sources including 3D video signals, which can lead to suboptimal performance and increased resource utilization.
Innovation Solution
The implementation of reordering mode candidates based on boundary matching costs to improve coding efficiency by optimizing the selection and derivation of merge candidates, motion vector prediction, and affine motion compensation techniques, reducing redundancy and computational complexity in video coding systems.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If inter prediction processes are used to handle various types of video sources including 3D video signals, then coding efficiency is improved, but computational overhead and complexity increase
Solution Approach 1:
The patent applies preliminary action by pre-ordering merge candidates based on boundary matching costs before the actual prediction process. The boundary matching cost is calculated in advance to determine the priority order of merge candidates, so that when inter prediction is performed, the system already knows which candidates are most likely to be optimal, reducing the need for exhaustive search and lowering computational overhead during the prediction process itself.
Solution Approach 2:
The patent changes the parameter of candidate ordering from the conventional fixed顺序 to a dynamic order based on boundary matching costs. By calculating and using boundary matching costs as a sorting criterion, the system transforms the static candidate list into a priority-based sequence, enabling faster convergence to optimal prediction modes while maintaining coding efficiency for various video sources including 3D video.
2Productivity
If merge candidates are selected using conventional methods, then device complexity is reduced, but coding efficiency deteriorates due to suboptimal performance
Solution Approach 1:
The patent replaces the mechanical system of fixed-order candidate testing with a cost-based ordering mechanism. Instead of blindly testing candidates in a predetermined sequence, the system substitutes this with a boundary matching cost calculation that quantitatively evaluates and ranks candidates. This substitution allows the system to achieve superior coding efficiency by selecting the most appropriate merge candidates while managing computational complexity through intelligent ordering rather than brute-force evaluation.
3Productivity
If boundary matching costs are calculated for all candidates, then coding efficiency is improved through optimal candidate selection, but computational overhead increases
Solution Approach 1:
The patent applies preliminary action by calculating boundary matching costs for all merge candidates in advance and using these pre-computed costs to determine the ordering of candidates. This preliminary calculation allows the system to efficiently select optimal candidates during the prediction process without needing to re-evaluate all candidates exhaustively, thereby improving coding efficiency while controlling computational overhead through strategic pre-processing.
Solution Approach 2:
The patent applies partial action by calculating boundary matching costs for all candidates (excessive action) but then using this information selectively - only the top-ranked candidates based on boundary matching costs are pursued further in the prediction process. This approach ensures that computational resources are not wasted on clearly suboptimal candidates while maintaining the benefit of having evaluated all possibilities, thus balancing coding efficiency improvement with computational overhead management.
Data Source
AI summary
A method and apparatus for video coding. The method receives input data associated with a current block, wherein the input data comprise pixel data for the current block to be encoded at an encoder side or encoded data associated with the current block to be decoded at a decoder side, determines a set of candidates associated with coding modes or coding parameters; determines boundary matching costs associated with the set of candidates, wherein each of the boundary matching costs is determined, wherein the boundary matching costs include at least one of top boundary matching costs calculated by performing top boundary matching at a top boundary and left boundary matching costs calculated by performing left boundary matching at a left boundary; and encodes or decoding the current block using a final candidate selected from the set of candidates based on at least one of the boundary matching costs.