Boundary Matching Mode Selection for Video Coding Blocks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards like HEVC face challenges in efficiently handling various types of video sources, including 3D video signals, and require improved coding efficiency and flexibility in block partitioning to reduce redundant splits and maintain small Virtual Pipeline Data Units (VPDUs) while optimizing hardware decoder throughput.
Innovation Solution
The Versatile Video Coding (VVC) standard introduces a quadtree with nested multi-type tree coding structure that allows for flexible block partitioning, including separate block trees for luma and chroma components, restricts redundant splits, and uses Virtual Pipeline Data Units (VPDUs) to manage decoder throughput, along with enhancements like intra prediction modes, cross-component linear model prediction, and multiple reference line intra prediction to improve coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If flexible block partitioning is introduced to handle various video sources, then coding efficiency and adaptability are improved, but device complexity increases
Solution Approach 1:
The coding structure is segmented into separate block trees for luma and chroma components, allowing independent partitioning strategies for each color plane. This segmentation enables flexible handling of different video source characteristics while maintaining manageable complexity through modular processing units.
Solution Approach 2:
The patent implements a nested multi-type tree structure where binary trees and ternary trees are nested within the quadtree framework. This nested arrangement allows progressive refinement of block partitioning from coarse to fine levels, providing adaptability for various video sources while organizing complexity in a hierarchical manner.
2Productivity
If redundant splits are restricted to optimize hardware decoder throughput, then productivity is improved, but device complexity increases due to split restriction rules
Solution Approach 1:
The patent applies preliminary actions by pre-defining valid split patterns and restriction rules at the encoding stage. By establishing which splits are redundant beforehand and preventing them from occurring, the decoder throughput is optimized without requiring complex real-time analysis during decoding, as the restrictions are already baked into the coding structure.
Solution Approach 2:
The patent changes structural parameters by introducing specific constraints on tree splitting depths and patterns. By modifying the partitioning parameters to prevent excessive or redundant splits, the coding structure achieves better alignment with hardware decoder capabilities, improving throughput while maintaining controlled complexity through parameterized restrictions.
3Productivity
If Virtual Pipeline Data Units are maintained at optimal size for decoder throughput, then productivity is improved, but device complexity increases due to VPDU management
Solution Approach 1:
The patent implements dynamic VPDU management where the size and composition of Virtual Pipeline Data Units are adaptively adjusted based on the coding context and block partitioning structure. This dynamic approach allows the system to maintain optimal VPDU sizes for decoder throughput while using flexible management rules that respond to different video content characteristics, rather than employing rigid fixed-size structures.
Data Source
AI summary
A method and apparatus for video coding. According to the method, a set of candidates associated with coding modes or mode parameters are determined. Boundary matching costs associated with the set of candidates are determined, where each of the boundary matching costs is determined for one target candidate of the set of candidates. The costs are calculated by using reconstructed or predicted samples of the current block and one or more neighboring blocks of the current block. Each of the boundary matching costs is calculated using one target configuration selected from a plurality of configurations. A final candidate is selected from the set of candidates based on the boundary matching costs. The current block is encoded or decoded using the final candidate.