Granted Patent B2

US 12,236,647 · App. 17/108,496 · Granted Feb 25, 2025

Inventor: Toshiyasu Sugio (Osaka, JP)

Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA

G06T9/001G06T3/40G06T17/20G06T9/40

Abstract

Claims (75)

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 including a prefix and a suffix;

selecting a first occurrence probability value to be used to arithmetic encode a current bit of the suffix;

selecting a second occurrence probability value to be used to arithmetic encode a current bit of the prefix; and

arithmetic encoding the binary data, wherein

in the arithmetic encoding of the binary data, (i) the first occurrence probability value is independently applied to the current bit of the suffix, and (ii) the second occurrence probability value is independently applied to the current bit of the prefix, and

the first occurrence probability value and the second occurrence probability value each indicate a probability of occurrence of 0 or 1 in the binary data.

2. 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.

3. 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.

4. The three-dimensional data encoding method according to claim 1 ,

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

5. 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.

6. 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.

7. 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 including a prefix and a suffix;

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, wherein

the three-dimensional data decoding method further comprises:

selecting a first occurrence probability value to be used to arithmetic decode a current bit of the suffix; and

selecting a second occurrence probability value to be used to arithmetic decode a current bit of the prefix,

in the arithmetic decoding of the encoded data, (i) the first occurrence probability value is independently applied to the current bit of the suffix, and (ii) the second occurrence probability value is independently applied to the current bit of the prefix, and

the first occurrence probability value and the second occurrence probability value each indicate a probability of occurrence of 0 or 1 in the binary data.

8. The three-dimensional data decoding method according to claim 7 ,

wherein in the arithmetic decoding, a different coding table is used for each bit included in the binary data.

9. The three-dimensional data decoding method according to claim 8 ,

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.

10. The three-dimensional data decoding method according to claim 7 ,

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

11. The three-dimensional data decoding method according to claim 7 ,

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-Golomb 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.

12. The three-dimensional data decoding method according to claim 11 , 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.

13. 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 including a prefix and a suffix;

selecting a first occurrence probability value to be used to arithmetic encode a current bit of the suffix;

selecting a second occurrence probability value to be used to arithmetic encode a current bit of the prefix; and

arithmetic encodes the binary data,

in the arithmetic encoding of the binary data, (i) the first occurrence probability value is independently applied to the current bit of the suffix, and (ii) the second occurrence probability value is independently applied to the current bit of the prefix, and

the first occurrence probability value and the second occurrence probability value each indicate a probability of occurrence of 0 or 1 in the binary data.

14. 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, the binary data including a prefix and a suffix;

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, wherein

the processor further:

selects a first occurrence probability value to be used to arithmetic decode a current bit of the suffix; and

selects a second occurrence probability value to be used to arithmetic decode a current bit of the prefix,

in the arithmetic decoding of the encoded data, (i) the first occurrence probability value is independently applied to the current bit of the suffix, and (ii) the second occurrence probability value is independently applied to the current bit of the prefix, and

the first occurrence probability value and the second occurrence probability value each indicate a probability of occurrence of 0 or 1 in the binary data.

Assignments (1)

Continuity (3)

References Cited (22)