Video Block Partitioning Rules for Unsymmetrical Tree Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards face challenges in efficiently managing bandwidth and compression complexity due to unsymmetrical tree partitioning schemes, particularly for video blocks with dimensions that exceed maximum allowed sizes, leading to inefficiencies in bitstream processing.
Innovation Solution
Implementing a rule-based partitioning scheme that disables unsymmetrical tree partitioning for video blocks exceeding certain dimensions or depth thresholds, using multi-type trees (MTT) and local-dual trees, and enabling color-specific coding to optimize video block processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If unsymmetrical tree partitioning schemes are applied to video blocks, then partitioning flexibility is improved, but computational complexity increases
Solution Approach 1:
The patent applies parameter changes by dynamically adjusting the maximum partition depth parameter (maxPartDepth) and block size parameters based on video block characteristics. When video blocks exceed certain dimension thresholds or depth limits, the encoder modifies these parameters to disable unsymmetrical tree partitioning, thereby reducing computational complexity while maintaining adaptability for suitable blocks.
Solution Approach 2:
The patent implements dynamics by making the partitioning scheme adaptive rather than static. The encoder dynamically determines whether to apply unsymmetrical tree partitioning based on real-time assessment of video block dimensions and depth, switching between symmetric and asymmetric partitioning modes as conditions warrant, thus balancing flexibility and complexity.
2Manufacturing precision
If unsymmetrical tree partitioning is applied to large video blocks, then partitioning precision is improved, but bandwidth utilization deteriorates
Solution Approach 1:
The patent changes parameters by setting maximum block size thresholds and maximum partition depth limits. When video blocks exceed these parameters, unsymmetrical tree partitioning is disabled, preventing excessive bandwidth consumption while preserving partitioning precision for blocks within acceptable size ranges.
Solution Approach 2:
The patent applies partial action by selectively enabling unsymmetrical tree partitioning only for video blocks that meet specific size and depth criteria. Rather than applying the complex partitioning scheme universally, the encoder applies it partially only where beneficial, avoiding unnecessary bandwidth expenditure on large blocks where it would be counterproductive.
3Productivity
If color-specific coding is implemented, then coding efficiency is improved, but processing complexity increases
Solution Approach 1:
The patent applies local quality by implementing color-specific coding rules that differentiate processing based on chroma block characteristics. Instead of uniform processing, the encoder applies specialized partitioning constraints and coding parameters tailored to chroma blocks versus luma blocks, optimizing coding efficiency for each color component type while managing processing complexity through targeted rather than universal complexity.
Data Source
AI summary
A mechanism for processing video data is disclosed. The method includes determining, for a conversion between a visual media data and a bitstream, whether a partitioning scheme is enabled for coding of the video media data according to a rule. The method includes performing the conversion based on determined rule.