# US 2021/0082153 A1 · Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device

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

- Number: US 2021/0082153 A1
- Document ID: US20210082153A1
- Status: Published application
- Kind: A1
- Application number: 17/108,496
- Filed: 2020-12-01
- Published: 2021-03-18
- Earliest claimed: 2018-06-06
- Assignees: Panasonic Intellectual Property Corporation of America
- Applicants: Panasonic Intellectual Property Corporation of America
- Inventors: Toshiyasu SUGIO
- Web page: https://patentgrep.com/patent/US20210082153A1

## CPC

- G06T 9/001: {Model-based coding, e.g. wire frame}
- H04N 19/597: specially adapted for multi-view video sequence encoding
- G06T 3/40: Scaling of whole images or parts thereof, e.g. expanding or contracting
- G06T 9/004: {Predictors, e.g. intraframe, interframe coding}
- G06T 9/005: {Statistical coding, e.g. Huffman, run length coding}
- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- H04N 19/91: Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
- G06T 9/40: Tree coding, e.g. quadtree, octree
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A three-dimensional data encoding method is a three-dimensional data encoding method of encoding a three-dimensional point having attribute information. The three-dimensional data encoding method includes: calculating a predicted value of the attribute information of the three-dimensional point; calculating a prediction residual which is a difference between the attribute information of the three-dimensional point and the predicted value; binarizing the prediction residual to generate binary data; and arithmetic encoding the binary data, For example, the three-dimensional data encoding method may use, in the arithmetic encoding, a different coding table for each bit included in the binary data.

## Claims

### Claim 1

A three-dimensional data encoding method of encoding a three-dimensional point having attribute information, the three-dimensional data encoding method comprising:
calculating a predicted value of the attribute information of the three-dimensional point;
calculating a prediction residual which is a difference between the attribute information of the three-dimensional point and the predicted value;
binarizing the prediction residual to generate binary data; and
arithmetic encoding the binary data.

### Claim 2 (depends on 1)

The three-dimensional data encoding method according to claim 1,
wherein in the arithmetic encoding, a different coding table is used for each bit included in the binary data.

### Claim 3 (depends on 2)

The three-dimensional data encoding method according to claim 2,
wherein in the arithmetic encoding, a total number of coding tables to be used is larger for a lower-order bit included in the binary data.

### Claim 4 (depends on 1)

The three-dimensional data encoding method according to claim 1,
wherein in the arithmetic encoding, a coding table to be used to arithmetic encode a current bit included in the binary data is selected according to a value of a higher-order bit with respect to the current bit.

### Claim 5 (depends on 1)

The three-dimensional data encoding method according to claim 1,
wherein in the binarizing:
the binary data which has a fixed bit count is generated by binarizing the prediction residual when the prediction residual is smaller than a threshold value; and
the binary data including a first code and a second code is generated when the prediction residual is larger than or equal to the threshold value, the first code having the fixed bit count indicating the threshold value, the second code having been obtained by binarizing, using exponential-Golomb coding, a value obtained by subtracting the threshold value from the prediction residual, and
in the arithmetic encoding, different arithmetic encoding methods are used for the first code and the second code.

### Claim 6 (depends on 5)

The three-dimensional data encoding method according to claim 5, further comprising:
quantizing the prediction residual; and
binarizing the prediction residual quantized, in the binarizing,
wherein the threshold value is modified according to a quantization scale in the quantizing.

### Claim 7 (depends on 5)

The three-dimensional data encoding method according to claim 5,
wherein the second code includes a prefix and a suffix, and
in the arithmetic encoding, different coding tables are used for the prefix and the suffix.

### Claim 8

A three-dimensional data decoding method of decoding a three-dimensional point having attribute information, the three-dimensional data decoding method comprising:
calculating a predicted value of the attribute information of the three-dimensional point;
arithmetic decoding encoded data included in a bitstream to generate binary data;
debinarizing the binary data to generate a prediction residual; and
calculating a decoded value of the attribute information of the three-dimensional point by adding the predicted value and the prediction residual.

### Claim 9 (depends on 8)

The three-dimensional data decoding method according to claim 8,
wherein in the arithmetic decoding, a different coding table is used for each bit included in the binary data.

### Claim 10 (depends on 9)

The three-dimensional data decoding method according to claim 9,
wherein in the arithmetic. decoding, a total number of coding tables to be used is larger for a lower-order bit included in the binary data.

### Claim 11 (depends on 8)

The three-dimensional data decoding method according to claim 8,
wherein in the arithmetic decoding, a coding table to be used to arithmetic encode a current bit included in the binary data is selected according to a value of a higher-order hit with respect to the current bit.

### Claim 12 (depends on 8)

The three-dimensional data decoding method according to claim 8,
wherein in the debinarizing;
a first code which has a fixed bit count included in the binary data is debinarized to generate a first value;
the first value is determined to be the prediction residual when the first value is smaller than a threshold value; and
when the first value is larger than or equal to the threshold value, a code which is an exponential-Golumb code included in the binary data is debinarized to generate a second value, and the first value and the second value are added to generate the prediction residual, and
in the arithmetic decoding, different arithmetic decoding methods are used for the first code and the second code.

### Claim 13 (depends on 12)

The three-dimensional data decoding method according to claim 12, further comprising;
inverse quantizing the prediction residual; and
adding the predicted value and the prediction residual inverse quantized, in the adding,
wherein the threshold value is modified according to a quantization scale in the inverse quantizing.

### Claim 14 (depends on 12)

The three-dimensional data decoding method according to claim 12,
wherein the second code includes a prefix and a suffix, and
in the arithmetic decoding, different coding tables are used for the prefix and the suffix.

### Claim 15

A three-dimensional data encoding device which encodes a three-dimensional point having attribute information, the three-dimensional data encoding device comprising:
a processor; and
memory;
wherein, using the memory, the processor:
calculates a predicted value of the attribute information of the three-dimensional point;
calculates a prediction residual which is a difference between the attribute information of the three-dimensional point and the predicted value;
binarizes the prediction residual to generate binary data; and
arithmetic encodes the binary data.

### Claim 16

A three-dimensional data decoding device which decodes a three-dimensional point having attribute information, the three-dimensional data decoding device comprising:
a processor; and
memory,
wherein, using the memory the processor:
calculates a predicted value of the attribute information of the three-dimensional point;
arithmetic decodes encoded data included in a bitstream to generate binary data;
debinarizes the binary data to generate a prediction residual; and
calculating a decoded value of the attribute information of the three-dimensional point by adding the predicted value and the prediction residual.
