Flexible Block Partition Tree for Balanced Video Coding

The patent changes the structural parameters of the tree by enforcing balanced depth and restricting split operations to power-of-two block sizes. This transforms the unbalanced two-level MTT into a balanced tree structure where all leaves are at the same depth, thereby reducing computational complexity while maintaining partitioning flexibility through allowed split types (vertical, horizontal, diagonal).

The patent segments the block partitioning process into distinct, controlled stages: first dividing the block into quadrants, then applying balanced binary tree splitting only when block dimensions are powers of two. This segmentation prevents unnecessary computational paths and ensures balanced tree depth, reducing overall computational complexity while preserving adaptability for various block sizes.

The patent merges multiple splitting concepts (quad-tree, binary tree, and ternary tree) into a unified balanced tree structure. It combines the simplicity of quad-tree initial division with the flexibility of binary tree splitting, allowing both vertical and horizontal splits at each node. This integration provides advanced partitioning capabilities while maintaining a balanced, simple overall structure.

The patent introduces dynamic splitting decisions where the choice between vertical, horizontal, or no split is made adaptively at each node based on block dimensions and content characteristics. The system dynamically adjusts partitioning behavior to handle non-power-of-two block sizes gracefully, providing flexibility while maintaining balanced tree depth through controlled splitting logic.

The patent applies local quality by allowing different splitting behaviors at different nodes based on their specific characteristics. Power-of-two blocks can undergo binary tree splitting, while non-power-of-two blocks follow different paths. This localized adaptation maintains balanced tree depth globally while preserving partitioning options locally, achieving both computational efficiency and adaptability.

The patent introduces asymmetric splitting options (vertical vs. horizontal vs. diagonal) that can be applied selectively based on block orientation and content. This asymmetry in split directions provides additional partitioning flexibility without increasing tree depth, as all splits still lead to balanced leaf nodes. The asymmetric choices enrich partitioning options while maintaining computational efficiency through balanced structure.