Picture Block Partitioning With Multi-Tree Split Flag Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards, such as HEVC and VVC, face inefficiencies in block partitioning due to the use of fixed square blocks and lack of adaptive partitioning strategies, particularly in handling non-square block shapes, which affect compression efficiency.
Innovation Solution
Implementing recursive multi-tree splitting for picture partitioning based on splitting information signaled in a data stream, using split, quad, and direction flags to determine block partitioning, allowing for flexible block shapes and reducing redundant flag decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If fixed square blocks are used for partitioning, then the partitioning structure is simple, but compression efficiency is reduced due to inability to adapt to non-square block shapes
Solution Approach 1:
The partitioning structure is divided into multiple independent tree types (quadtree, binary tree, ternary tree) that can be selectively applied. Each tree type segments blocks differently, allowing the system to choose the most appropriate segmentation strategy for different block shapes and content characteristics, thereby improving adaptability without requiring a single complex partitioning structure
Solution Approach 2:
The partitioning system transitions from a static fixed-square-block approach to a dynamic multi-tree structure where the partitioning strategy can change based on block characteristics. The decoder adapts the partitioning tree type and splitting behavior according to the current block's properties, enabling flexible adaptation to various block shapes while maintaining manageable complexity through conditional logic
2Manufacturing precision
If multiple flags are decoded for each block split, then partitioning control is precise, but decoding complexity and time increase
Solution Approach 1:
The partitioning tree type (quadtree, binary, or ternary) is determined and configured in advance before the actual block partitioning process. This preliminary action allows the decoder to pre-load the appropriate parsing logic and context models, so that during actual decoding, the system can quickly apply the predetermined partitioning strategy without needing to evaluate multiple options in real-time, thus maintaining precision while reducing decoding time
Solution Approach 2:
The patent uses context models that are copied and adapted from previously decoded blocks. Instead of building context models from scratch for each block, the system copies and modifies existing context information, significantly reducing the computational effort required for each partitioning decision while maintaining accurate control over the partitioning process
Data Source
AI summary
An apparatus for decoding a picture is configured to partition the picture into coding blocks, using recursive multi-tree splitting. Splitting schemes for the multi-tree splitting are described. According to an embodiment, the decoder decodes a split direction flag from a data stream by context adaptive entropy decoding using a context which depends on whether, and discriminates be-tween, a first number of criteria which would be fulfilled in case of a split direction indicated by the split direction flag being horizontal equals a second number of criteria which would be fulfilled in case of the split direction indicated by the split direction flag being vertical, the first number being greater than the second number, and the first number being smaller than the second number.


