Multi-Type Tree Depth Extension for Boundary CTU Partitioning

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current block-based hybrid video codecs face limitations in partitioning flexibility, particularly at image boundaries, leading to inefficiencies in video coding and decoding processes.

Innovation Solution

The proposed solution involves hierarchical multi-type splitting of coding tree units (CTUs) with adaptable maximum partition depths, allowing for enhanced flexibility in partitioning both non-boundary and boundary CTUs, using a combination of quad-tree and multi-type tree structures.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If a fixed maximum partition depth is applied to all coding tree units, then the coding structure is simple and easy to implement, but the partitioning flexibility at image boundaries is limited

Engineering Contradiction:

Improvepartitioning flexibilityVSAvoidcoding structure complexity

Core Design Contradiction:

Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent applies different maximum partition depth rules to different locations: non-boundary CTUs use a first maximum depth while boundary CTUs use a second maximum depth. This local differentiation allows the system to optimize for boundary handling without unnecessarily complicating the entire coding structure.

Inventive Principle:

Principle #3Local quality

Solution Approach 2:

The patent introduces dynamic adaptability by allowing the maximum partition depth to vary based on CTU location (boundary vs. non-boundary). This dynamic approach enables the coding structure to adapt to different spatial requirements without being completely restructured.

Inventive Principle:

Principle #15Dynamics

2Reliability

If multi-type splitting is applied to boundary CTUs with extended maximum depth, then the handling of image boundaries is improved, but the computational cost increases

Engineering Contradiction:

Improveboundary handling qualityVSAvoidcomputational cost

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent changes the depth parameter selectively for boundary CTUs, extending the maximum partition depth only where needed at image boundaries. This parameter change improves boundary handling quality while limiting the increase in computational cost to only the necessary regions.

Inventive Principle:

Principle #35Parameter changes

3Adaptability or versatility

If the maximum multi-type partition depth is extended for boundary CTUs, then the partitioning adaptability is improved, but the device complexity increases

Engineering Contradiction:

Improvepartitioning adaptabilityVSAvoidpartitioning structure complexity

Core Design Contradiction:

Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent implements local quality by applying extended partition depth rules specifically to boundary CTUs while maintaining standard rules for non-boundary CTUs. This localized approach improves partitioning adaptability at boundaries without unnecessarily increasing the complexity of the overall partitioning structure.

Inventive Principle:

Principle #3Local quality

Data Source

PatentUS20250324051A1Multi-type tree depth extension for picture boundary handling

Publication Date: 2025.10.16 HUAWEI TECH CO LTD

AI summary

The present disclosure provides apparatuses and methods for splitting an image into coding units. An image is divided into coding tree units (CTUs) which are hierarchically partitioned. Hierarchical partitioning includes multi-type partitioning such as binary tree or quad tree splitting. For CTUs completely within the image and CTUs on the boundary, respective multi-type partition depths are chosen. The present disclosure provides for multi-type partitioning flexibility in a boundary portion of the image.