Asymmetric Binary Partitioning in QTBT Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding standards, such as HEVC, face challenges in efficiently partitioning video blocks to accommodate higher resolutions and better video quality, particularly in handling asymmetric correlations within blocks, which affects coding efficiency and bitstream management.
Innovation Solution
The proposed method employs a quadtree plus binary tree (QTBT) structure for JVET video coding, allowing quadtree partitioning, symmetric binary partitioning, and asymmetric binary partitioning to split coding units into unequal sizes, with asymmetric partitioning limited to leaf nodes to reduce search complexity and overhead bits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If asymmetric binary partitioning is applied to all nodes in the QTBT structure, then coding efficiency is improved by better adapting to asymmetric correlations, but device complexity and search complexity increase significantly
Solution Approach 1:
The patent applies asymmetric binary partitioning selectively only at quadtree leaf nodes rather than uniformly across all nodes. This local application allows the system to adapt to asymmetric correlations where they exist (at leaf nodes) while avoiding the complexity overhead of applying asymmetric partitioning throughout the entire tree structure, thus resolving the contradiction between coding efficiency and device complexity
Solution Approach 2:
The patent segments the partitioning process into two distinct phases: quadtree partitioning followed by selective binary partitioning only at leaf nodes. This segmentation allows the system to first establish a hierarchical structure with quadtree, then apply asymmetric partitioning only where needed, reducing overall search complexity while maintaining coding efficiency benefits
2Adaptability or versatility
If asymmetric binary partitioning is allowed at all nodes, then flexibility in block partitioning is improved, but overhead bits and bitstream complexity increase
Solution Approach 1:
The patent restricts asymmetric binary partitioning to only quadtree leaf nodes, applying flexibility locally where it provides maximum benefit for adapting to asymmetric correlations, while avoiding the overhead of signaling asymmetric partitioning at intermediate nodes where it would not improve coding performance
Solution Approach 2:
The patent segments the partitioning hierarchy into quadtree nodes and binary tree nodes, with asymmetric partitioning enabled only at the boundary (leaf nodes). This segmentation reduces bitstream complexity by eliminating the need to signal asymmetric partitioning decisions at every level of the tree
3Adaptability or versatility
If multiple partitioning types are allowed at each node, then adaptability is improved, but difficulty of detecting and measuring partitioning type increases
Solution Approach 1:
The patent applies different partitioning rules to different node types: quadtree partitioning for internal nodes and selective binary partitioning (symmetric or asymmetric) only for leaf nodes. This local differentiation simplifies the detection and measurement process by establishing clear, context-dependent rules rather than requiring complex classification at every node
Data Source
AI summary
A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.