IP Library Granted Patent US 12707051
Granted Patent B2
US 12707051 · App. 19/023,219 · Granted Aug 11, 2026

Boundary block partitioning in video coding

Inventors: Han Gao (Shenzhen, CN); Jianle Chen (San Diego, CA); Semih Esenlik (Munich, DE); Zhijie Zhao (Shenzhen, CN); Anand Meher Kotra (Munich, DE)
Assignee: Huawei Technologies Co., Ltd.
H04N19/119H04N19/176H04N19/192H04N19/96
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12707051
App. No.
19/023,219
Granted
Aug 11, 2026
Kind
B2
Abstract

A partitioning method comprises determining whether a current block of a picture is a boundary block and whether the size of the current block is larger than a minimum allowed quadtree leaf node size; and if the current block is the boundary block and the size of the current block is not larger than the minimum allowed quadtree leaf node size (MinQTSize), applying forced binary tree (BT) partitioning to the current block. A method comprises making a determination that a current block of a picture is a boundary block and that a size of the current block is less than or equal to a minimum allowed quadtree (QT) leaf node size (MinQTSize); and applying, in response to the determination, forced binary tree (BT) partitioning to the current block.

Claims (27)

1 . A method for encoding a current block of a picture, the method comprising:

determining the current block of the picture is a boundary block and that a size of the current block is less than or equal to a minimum allowed quadtree (QT) leaf node size (MinQTSize) parameter;

in response to the determining, applying forced binary tree (BT) partitioning to the current block, wherein the boundary block is located at a corner boundary, and wherein applying the forced BT partitioning comprises:

recursively partitioning the current block by a horizontal forced boundary partitioning until a sub-partition of the current block is located at a bottom boundary of the picture; and

recursively partitioning the sub-partition by a vertical forced boundary partitioning until a leaf node is located at a right boundary of the picture; and

generating a bitstream comprising the current block encoded based on applying the forced BT partitioning.

2 . The method of claim 1 , further comprising applying the MinQTSize parameter for controlling partitioning of a non-boundary block of the picture.

3 . The method of claim 1 , further comprising transmitting the MinQTSize parameter via a sequence parameter set (SPS).

4 . An encoding apparatus, the encoding apparatus comprising:

a memory storing instructions; and

a processor coupled to the memory and configured to execute the instructions to:

determine that a current block of a picture is a boundary block and that a size of the current block is larger than a minimum allowed quadtree (QT) leaf node size (MinQTSize) parameter;

in response to the determining, apply forced binary tree (BT) partitioning to the current block, wherein the boundary block is located at a corner boundary, and wherein applying the forced BT partitioning comprises:

recursively partitioning the current block by a horizontal forced boundary partitioning until a sub-partition of the current block is located at a bottom boundary of the picture; and

recursively partitioning the sub-partition by a vertical forced boundary partitioning until a leaf node is located at a right boundary of the picture; and

generate a bitstream comprising the current block encoded based on applying the forced BT partitioning.

5 . The encoding apparatus of claim 4 , wherein the processor is further configured to execute the instructions to apply the MinQTSize parameter for controlling partitioning of a non-boundary block of the picture.

6 . The encoding apparatus of claim 4 , further comprising:

a transmitter coupled to the processor, wherein the transmitter is configured to transmit the MinQTSize parameter via a sequence parameter set (SPS).

7 . A non-transitory computer-readable storage medium storing a computer program product comprising computer executable instructions that, when executed by a processor, cause an encoding apparatus to:

determine that a current block of a picture is a boundary block and that a size of the current block is larger than a minimum allowed quadtree (QT) leaf node size (MinQTSize) parameter;

in response to the determining, apply forced binary tree (BT) partitioning to the current block, wherein the boundary block is located at a corner boundary, and wherein applying the forced BT partitioning comprises:

recursively partitioning the current block by a horizontal forced boundary partitioning until a sub-partition of the current block is located at a bottom boundary of the picture; and

recursively partitioning the sub-partition by a vertical forced boundary partitioning until a leaf node is located at a right boundary of the picture; and

generate a bitstream comprising the current block encoded based on applying the forced BT partitioning.

8 . The non-transitory computer-readable storage medium of claim 7 , wherein the processor executing the instructions further causes the apparatus to apply the MinQTSize parameter for controlling partitioning of a non-boundary block of the picture.

9 . The non-transitory computer-readable storage medium of claim 7 , wherein the processor executing the instructions further causes the apparatus to transmit the MinQTSize parameter via a sequence parameter set (SPS).