# US 2025/0220172 A1 · Methods and apparatus of encoding/decoding video picture partitioned in ctu grids

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0220172 A1
- Document ID: US20250220172A1
- Status: Published application
- Kind: A1
- Application number: 18/850,354
- Filed: 2023-02-22
- Published: 2025-07-03
- Earliest claimed: 2022-03-31
- Assignees: Beijing Xiaomi Mobile Software Co., Ltd.
- Applicants: Beijing Xiaomi Mobile Software Co., Ltd.
- Inventors: Fabrice LELÉANNEC; Pierre ANDRIVON
- Web page: https://patentgrep.com/patent/US20250220172A1

## CPC

- H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
- H04N 19/14: Coding unit complexity, e.g. amount of activity or edge presence estimation (H04N19/146 takes precedence)
- H04N 19/172: the region being a picture, frame or field
- H04N 19/184: the unit being bits, e.g. of the compressed video stream
- H04N 19/96: Tree coding, e.g. quad-tree coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A method for encoding a video picture into a bitstream of encoded video picture data, includes: splitting the video picture into rectangular picture areas, a size of at least one rectangular picture area being different from an integer multiple of a default size of coding-tree unit encoded into the bitstream; determining a grid of coding-tree units for each rectangular picture area, a grid of coding-tree units representing a spatial partition of a rectangular picture area, each coding-tree unit representing a sub-area of a rectangular picture area, the sub-area being subdivided according to a coding tree; obtaining encoded video picture data by encoding at least one coding unit (CU) of a coding tree associated with each coding tree unit (CTU) of each grid of coding-tree unit; and writing the encoded video picture data into the bitstream.

## Claims

### Claim 1

A method for encoding a video picture into a bitstream of encoded video picture data, wherein the method comprises:
splitting the video picture into rectangular picture areas, a size of at least one rectangular picture area being different from an integer multiple of a default size of coding-tree unit encoded into the bitstream;
determining a grid of coding-tree units for each rectangular picture area, a grid of coding-tree units representing a spatial partition of a rectangular picture area, each coding-tree unit representing a sub-area of a rectangular picture area, the sub-area being subdivided according to a coding tree;
obtaining encoded video picture data by encoding at least one coding unit (CU) of a coding tree associated with each coding tree unit (CTU) of each grid of coding-tree unit; and
writing the encoded video picture data into the bitstream.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
encoding, into the bitstream, partitioning information data representative of each grid of coding-tree units.

### Claim 3 (depends on 1)

The method of claim 1, wherein the video picture is split into rectangular picture areas to separate picture areas with low spatial activity from picture areas with high spatial activity of the video picture.

### Claim 4 (depends on 3)

The method of claim 3, wherein a spatial activity of the video picture is determined by detecting vertical and horizontal edges from video picture content.

### Claim 5 (depends on 1)

The method of claim 1, wherein the video picture is split according to a decomposition tree and at least one leaf of the decomposition tree is a rectangular picture area.

### Claim 6 (depends on 5)

The method of claim 5, wherein the decomposition tree is a binary decomposition tree, and wherein a split line offset is encoded into the bitstream to indicate a position of a line splitting a picture area associated with a parent into two sub-areas associated with two child nodes.

### Claim 7

A method of decoding a video picture from a bitstream of encoded video picture data, wherein the method comprises:
determining multiple grids of coding-tree units;
each grid of coding-tree units covering a rectangular picture area of the video picture;
a size of at least one rectangular picture area being different from an integer multiple of a default size of coding-tree unit decoded from the bitstream;
each coding-tree unit representing a sub-area of a rectangular picture area, the sub-area being subdivided according to a coding tree;
obtaining video picture data by decoding at least one coding unit (CU) of a coding tree associated with each coding tree unit (CTU) of each grid of coding-tree units from the bitstream; and
obtaining the video picture from the video picture data.

### Claim 8 (depends on 7)

The method of claim 7, wherein the multiple grids of coding-tree units are determined from partitioning information data decoded from the bitstream.

### Claim 9 (depends on 7)

The method of claim 7, wherein the rectangular picture areas are defined from sub-pictures, tiles or slices, each tile being a sequence of coding-tree units, a slice comprising an integer number of tiles or an integer number of consecutive coding-tree unit rows within a tile, each of the coding-tree units having a size equals to the default size.

### Claim 10 (depends on 7)

The method of claim 7, wherein a single grid of coding-tree units is determined by partitioning a rectangular picture area, and wherein the grid of coding-tree units is used for encoding/decoding each component of the rectangular picture area.

### Claim 11 (depends on 7)

The method of claim 7, wherein a grid of coding-tree units is determined per component of a rectangular picture area.

### Claim 12

(canceled)

### Claim 13 (depends on 1)

An apparatus, comprising:
a processor; and
a memory storing programs executable by the processor;
wherein the processor is configured to perform the method of claim 1.

### Claim 14

(canceled)

### Claim 15 (depends on 1)

A non-transitory storage medium carrying instructions of program code for executing the method of claim 1.

### Claim 16

An apparatus, comprising:
a processor; and
a memory storing programs executable by the processor;
wherein the processor is configured to perform:
determining multiple grids of coding-tree units;
each grid of coding-tree units covering a rectangular picture area of the video picture;
a size of at least one rectangular picture area being different from an integer multiple of a default size of coding-tree unit decoded from the bitstream;
each coding-tree unit representing a sub-area of a rectangular picture area, the sub-area being subdivided according to a coding tree;
obtaining video picture data by decoding at least one coding unit (CU) of a coding tree associated with each coding tree unit (CTU) of each grid of coding-tree units from the bitstream; and
obtaining the video picture from the video picture data.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein the multiple grids of coding-tree units are determined from partitioning information data decoded from the bitstream.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein the rectangular picture areas are defined from sub-pictures, tiles or slices, each tile being a sequence of coding-tree units, a slice comprising an integer number of tiles or an integer number of consecutive coding-tree unit rows within a tile, each of the coding-tree units having a size equals to the default size.

### Claim 19 (depends on 16)

The apparatus of claim 16, wherein a single grid of coding-tree units is determined by partitioning a rectangular picture area, and wherein the grid of coding-tree units is used for encoding/decoding each component of the rectangular picture area.

### Claim 20 (depends on 16)

The apparatus of claim 16, wherein a grid of coding-tree units is determined per component of a rectangular picture area.

### Claim 21 (depends on 7)

A non-transitory storage medium carrying instructions of program code for executing the method of claim 7.
