Boundary Matching Mode Selection for Flexible Video Block Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding systems face challenges in efficiently handling various types of video sources, including 3D video signals, due to limitations in coding efficiency and flexibility in block partitioning, leading to increased processing complexity and redundant splits, which affect throughput and buffer size management.
Innovation Solution
The implementation of a quadtree with nested multi-type tree coding structure in VVC, which allows for flexible block partitioning, reduces redundant splits, and includes features like virtual pipeline data units, intra chroma partitioning, and improved intra prediction modes to enhance coding efficiency and throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional block partitioning methods are used in video coding, then the coding structure is simple, but coding efficiency is insufficient and processing complexity increases
Solution Approach 1:
The patent implements a quadtree structure where coding units are recursively divided into smaller blocks, and within each coding unit, a multi-type tree structure further partitions blocks into prediction units and transform units. This nested partitioning allows flexible block division while maintaining an organized hierarchical structure, improving coding efficiency without excessively increasing processing complexity.
Solution Approach 2:
The patent segments video blocks into different types of units (coding units, prediction units, transform units) with specific functions. This segmentation allows each unit to be optimized independently for its specific purpose, improving overall coding efficiency while keeping the structure manageable through clear functional separation.
2Adaptability or versatility
If more coding tools are added to handle various video sources, then adaptability improves, but device complexity increases
Solution Approach 1:
The patent creates a universal coding framework where the quadtree with nested multi-type tree structure can handle different video sources (including 3D video signals) through a single unified partitioning mechanism. The structure adapts to different content requirements by adjusting partition depths and types without requiring separate coding paths, thus improving versatility while controlling complexity.
Solution Approach 2:
The patent introduces dynamic partitioning where the structure adapts its complexity based on content characteristics. The quadtree and multi-type tree partitioning can adjust the number and size of blocks dynamically according to the video source requirements, allowing the system to handle various video sources efficiently without maintaining maximum complexity for all cases.
3Manufacturing precision
If redundant block splits are performed, then coding precision improves, but throughput decreases and buffer size increases
Solution Approach 1:
The patent applies different partitioning strategies to different regions of the video content based on local characteristics. The quadtree and multi-type tree structures allow deeper partitioning only where needed (in complex regions) while using coarser partitioning in simpler regions, thus achieving high precision where necessary without unnecessarily increasing throughput requirements or buffer sizes across the entire frame.
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.