# US 2025/0168328 A1 · Method and device for encoding/decoding image, and recording medium in which bitstream is stored

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

- Number: US 2025/0168328 A1
- Document ID: US20250168328A1
- Status: Published application
- Kind: A1
- Application number: 19/027,653
- Filed: 2025-01-17
- Published: 2025-05-22
- Earliest claimed: 2017-07-06
- Assignees: Lx Semicon Co., Ltd.
- Applicants: LX Semicon Co., Ltd.
- Inventors: Jin Ho LEE; Jung Won KANG; Hyun Suk KO; Sung Chang LIM; Ha Hyun LEE; Dong San JUN; Hui Yong KIM
- Web page: https://patentgrep.com/patent/US20250168328A1

## CPC

- G06T 9/004: {Predictors, e.g. intraframe, interframe coding}
- H04N 19/11: among a plurality of spatial predictive coding modes
- H04N 19/105: Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
- H04N 19/117: Filters, e.g. for pre-processing or post-processing (sub-band filter banks H04N19/635)
- H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/593: involving spatial prediction techniques
- H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence)
- H04N 19/59: involving spatial sub-sampling or interpolation, e.g. alteration of picture size or resolution
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

An image encoding/decoding method and apparatus for performing intra prediction using a plurality of reference sample lines are provided. The image decoding method can include receiving partition information for a coding tree unit and size information, partitioning a split target block in the coding tree unit into a plurality of coding units based on the partition information, and performing intra prediction for each of the plurality of coding units.

## Claims

### Claim 1

An image decoding method performed by an image decoding apparatus, the method comprising:
receiving partition information for a coding tree unit and size information;
partitioning a split target block in the coding tree unit into a plurality of coding units based on the partition information; and
performing intra prediction for each of the plurality of coding units,
wherein a partition type for the coding tree unit includes at least one of quad tree split, binary tree split and ternary tree split,
wherein the partition information includes quad tree split information for the quad tree split and multi-type tree split information for the binary tree split and the ternary tree split,
wherein the size information includes minimum size information of the quad tree split and information related to a minimum size of the binary tree split or a minimum size of the ternary tree split,
wherein based on a multi-type tree depth of the split target block being equal to a maximum multi-type tree depth, the split target block is not split into a binary tree,
wherein based on a multi-type tree depth of the split target block being equal to a maximum multi-type tree depth, the split target block is not split into a ternary tree,
wherein based on a size of the split target block being equal to the minimum size of the binary tree, the split target block is not split into the binary tree, and
wherein based on the size of the split target block being equal to two times as large as the minimum size of the ternary tree, the split target block is not split into the ternary tree.

### Claim 2

An image encoding method performed by an image encoding apparatus, the method comprising:
partitioning a split target block in a coding tree unit into a plurality of coding units;
performing intra prediction for each of the plurality of coding units; and
encoding image information including partition information for the coding tree unit and size information,
wherein a partition type for the coding tree unit includes at least one of quad tree split, binary tree split and ternary tree split,
wherein the partition information includes quad tree split information for the quad tree split and multi-type tree split information for the binary tree split and the ternary tree split,
wherein the size information includes minimum size information of the quad tree split and information related to a minimum size of the binary tree split or a minimum size of the ternary tree split,
wherein based on a multi-type tree depth of the split target block being equal to a maximum multi-type tree depth, the split target block is not split into a binary tree,
wherein based on a multi-type tree depth of the split target block being equal to a maximum multi-type tree depth, the split target block is not split into a ternary tree,
wherein based on a size of the split target block being equal to the minimum size of the binary tree, the split target block is not split into the binary tree, and
wherein based on the size of the split target block being equal to two times as large as the minimum size of ternary tree, the split target block is not split into the ternary tree.

### Claim 3 (depends on 2)

A non-transitory computer-readable recording-medium storing a bitstream which is generated by the image encoding method of claim 2.

### Claim 4

A transmission method for image data, the method comprising:
obtaining a bitstream for encoded image information, wherein the encoded image information is generated based on partitioning a split target block in a coding tree unit into a plurality of coding units, performing intra prediction for each of the plurality of coding units; and encoding image information including partition information for the coding tree unit and size information; and
transmitting the image data comprising the bitstream,
wherein a partition type for the coding tree unit includes at least one of quad tree split, binary tree split and ternary tree split,
wherein the partition information includes quad tree split information for the quad tree split and multi-type tree split information for the binary tree split and the ternary tree split,
wherein the size information includes minimum size information of the quad tree split and information related to a minimum size of the binary tree split or a minimum size of the ternary tree split,
wherein based on a multi-type tree depth of the split target block being equal to a maximum multi-type tree depth, the split target block is not split into a binary tree,
wherein based on a multi-type tree depth of the split target block being equal to a maximum multi-type tree depth, the split target block is not split into a ternary tree,
wherein based on a size of the split target block being equal to the minimum size of binary tree, the split target block is not split into the binary tree, and
wherein based on the size of the split target block being equal to two times as large as the minimum size of ternary tree, the split target block is not split into the ternary tree.
