# US 12,225,202 B2 · Encoding method, encoding apparatus, and program

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

- Number: US 12,225,202 B2
- Document ID: US12225202B2
- Status: Granted
- Kind: B2
- Application number: 17/796,528
- Filed: 2020-02-25
- Published: 2023-02-23
- Granted: 2025-02-11
- Earliest claimed: 2020-02-25
- Assignees: Nippon Telegraph and Telephone Corporation
- Applicants: Nippon Telegraph and Telephone Corporation
- Inventors: Yuya Omori; Ken Nakamura; Daisuke Kobayashi; Hiroe Iwasaki
- Web page: https://patentgrep.com/patent/US12225202B2

## CPC

- H04N 19/137: Motion inside a coding unit, e.g. average field, frame or block difference
- H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/96: Tree coding, e.g. quad-tree coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A coding method is a coding method executed by a coding apparatus. The coding method includes partitioning a first block having a predetermined size in an original image into a group of second blocks each being a block serving as a unit for coding, by quad tree, ternary tree, or binary tree, and predicting movement for each of the second blocks. The partitioning includes first sub-partitioning and second sub-partitioning, the first sub-partitioning includes partitioning the first block into blocks each having a size selected from sizes determined according to the quad tree, the ternary tree, or the binary tree, and the second sub-partitioning includes further partitioning the blocks each having the selected size to generate the second blocks.

## Claims

### Claim 1

A coding method executed by a coding apparatus comprising at least one processor or at least one circuit, the method comprising:
partitioning a first block having a predetermined size in an original image into a group of second blocks each being a block serving as a unit for coding, by quad tree, ternary tree, or binary tree; and
predicting movement for each of the second blocks,
wherein the partitioning includes first sub-partitioning and second sub-partitioning,
the first sub-partitioning includes partitioning a whole of the first block by any one of the quad tree, the ternary tree, or the binary tree,
the second sub-partitioning includes further partitioning, by any one of the quad tree, the ternary tree, or the binary tree not selected in the first sub-partitioning, parts of the first block partitioned, to generate the second blocks, and
the predicting includes executing accurate prediction processing for each of the second blocks by progressively increasing the kinds of multiple reference lines to three as a final stage of the partitioning is approaching.

### Claim 2 (depends on 1)

The coding method according to claim 1, wherein the second sub-partitioning includes further partitioning results of partitioning the parts of the first block by any one of the quad tree, the ternary tree, or the binary tree not selected in the first sub-partitioning.

### Claim 3 (depends on 1)

The coding method according to claim 1, wherein the first sub-partitioning includes partitioning the first block by the quad tree.

### Claim 4

A coding apparatus, comprising:
a partitioner configured to partition a first block having a predetermined size in an original image into a group of second blocks each being a block serving as a unit for coding, by quad tree, ternary tree, or binary tree; and
a predictor configured to predict movement for each of the second blocks,
wherein the partitioner includes a first sub-partitioner and a second sub-partitioner,
the first sub-partitioner partitions a whole of the first block by any one of the quad tree, the ternary tree, or the binary tree,
the second sub-partitioner further partitions, by any one of the quad tree, the ternary tree, or the binary tree not selected in the first sub-partitioner, parts of the first block partitioned, to generate the second blocks, and
the predicting includes executing accurate prediction processing for each of the second blocks by progressively increasing the kinds of multiple reference lines to three as a final stage of the partitioning is approaching,
wherein each of the partitioner, the first sub-partitioner and the second sub-partitioner is implemented by:
i) computer executable instructions executed by at least one processor,
ii) at least one circuit or
iii) a combination of computer executable instructions executed by at least one processor and at least one circuit.

### Claim 5 (depends on 1)

A non-transitory computer readable medium storing a program causing a computer to operate as a coding apparatus for executing the coding method according to claim 1.

### Claim 6 (depends on 1)

The coding method according to claim 1, wherein the first sub-partitioning includes selecting one reference pixel from among reference pixels in three kinds of lines.