IP Library Granted Patent US 12,437,447
Granted Patent B2
US 12,437,447 · App. 17/846,628 · Granted Oct 7, 2025

Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device

Inventors: Noritaka Iguchi (Osaka, JP); Toshiyasu Sugio (Osaka, JP)
Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
G06T9/001G06T9/40
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,437,447
App. No.
17/846,628
Granted
Oct 7, 2025
Kind
B2
Abstract

A three-dimensional data encoding method includes: generating quantized values by quantizing, using one or more first parameters for one or more groups to which one or more attribute information belong, a coefficient value calculated for each node included in a layered structure of three-dimensional points. At least one attribute information belongs to any of the one or more groups. The calculating includes calculating, using two first coefficient values of two first nodes of a first layer, a second coefficient value of a second node of a second layer which is one layer higher. The quantizing includes: shifting-up the one or more first parameters by N bits (N is a natural number); shifting-down, by one bit, a sum of two second parameters of the two first nodes; shifting-down the result by N bits; and quantizing the second coefficient value using the obtained parameter.

Claims (68)

1. A three-dimensional data encoding method comprising:

calculating a coefficient value of each of nodes included in a layered structure by generating the layered structure in which each of items of attribute information of three-dimensional points included in point cloud data is hierarchically divided into a first component and a second component; and

quantizing, for each of the nodes, the coefficient value of the node using one or more first parameters for one or more groups to which one or more items of attribute information used in the calculating of the coefficient value belong, to generate quantized values, wherein

at least one item of attribute information among the items of attribute belongs to any one of the one or more groups,

in the calculating, a second coefficient value of a second node of a second layer which is one layer higher than a first layer of the layered structure is calculated using two first coefficient values of two first nodes belonging to the first layer,

the quantizing includes:

(i) generating one or more second parameters by left-shifting the one or more first parameters by N bits, N being a natural number;

(ii) generating a third parameter by right-shifting, by one bit, a sum obtained by adding up two second parameters from among the one or more second parameters, the two second parameters corresponding to the two first nodes;

(iii) generating a fourth parameter by right-shifting the third parameter by N bits; and

(iv) quantizing the second coefficient value using the fourth parameter, and

each parameter of the one or more first parameters, the one or more second parameters, the third parameter, and the fourth parameter is expressed by a bit sequence.

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

the first parameter and the fourth parameter are each differences from a reference parameter, and

in the quantizing of the second coefficient value, a fifth parameter obtained by adding the reference parameter to the fourth parameter is used.

3. The three-dimensional data encoding method according to claim 1 , wherein N is 4.

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

each of the items of attribute information is classified into any one of the one or more groups, according to a three-dimensional space to which the three-dimensional point having the item of attribute information belongs.

5. A three-dimensional data decoding method comprising:

calculating, using quantized values and one or more first parameters, coefficient values by inverse-quantizing each of the quantized values; and

calculating, from the coefficient values, items of attribute information of three-dimensional points included in point cloud data, wherein

the one or more first parameters are one or more parameters for one or more groups to which one or more items of attribute information belong, the one or more items of attribute information being used in the calculating of a coefficient value to which a corresponding one of the quantized values corresponds,

at least one item of attribute information among the items of attribute information belongs to any one of the one or more groups,

the coefficient values are calculated corresponding to nodes included to a layered structure,

the layered structure is a structure in which each of the items of attribute information is hierarchically divided into a first component and a second component,

two first coefficient values of two first nodes belonging to a first layer of the layered structure are used in calculating a second coefficient value of a second node of a second layer which is one layer higher than the first layer,

the inverse-quantizing includes:

(i) generating one or more second parameters by left-shifting the one or more first parameters by N bits, N being a natural number;

(ii) generating a third parameter by right-shifting, by one bit, a sum obtained by adding up two second parameters from among the one or more second parameters, the two second parameters corresponding to the two first nodes;

(iii) generating a fourth parameter by right-shifting the third parameter by N bits; and

(iv) inverse-quantizing a quantized value of the second node using the fourth parameter, and

each parameter of the one or more first parameters, the one or more second parameters, the third parameter, and the fourth parameter is expressed by a bit sequence.

6. The three-dimensional data decoding method according to claim 5 , wherein

the first parameter and the fourth parameter are each differences from a reference parameter, and

in the inverse-quantizing of the quantized value of the second node, a fifth parameter obtained by adding the reference parameter to the fourth parameter is used.

7. The three-dimensional data decoding method according to claim 5 , wherein N is 4.

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

each of the items of attribute information is classified into any one of the one or more groups, according to a three-dimensional space to which the three-dimensional point having the item of attribute information belongs.

9. A three-dimensional data encoding device comprising:

a processor; and

memory, wherein

using the memory, the processor:

calculates a coefficient value of each of nodes included in a layered structure by generating the layered structure in which each of items of attribute information of three-dimensional points included in point cloud data is hierarchically divided into a first component and a second component; and

quantizes, for each of the nodes, the coefficient value of the node using one or more first parameters for one or more groups to which one or more items of attribute information used in the calculating of the coefficient value belong, to generate quantized values,

at least one item of attribute information among the items of attribute belongs to any one of the one or more groups,

in the calculating, the processor calculates a second coefficient value of a second node of a second layer which is one layer higher than a first layer of the layered structure, using two first coefficient values of two first nodes belonging to the first layer,

in the quantizing, the processor:

(i) generates one or more second parameters by left-shifting the one or more first parameters by N bits, N being a natural number;

(ii) generates a third parameter by right-shifting, by one bit, a sum obtained by adding up two second parameters from among the one or more second parameters, the two second parameters corresponding to the two first nodes;

(iii) generates a fourth parameter by right-shifting the third parameter by N bits; and

(iv) quantizes the second coefficient value using the fourth parameter, and

each parameter of the one or more first parameters, the one or more second parameters, the third parameter, and the fourth parameter is expressed by a bit sequence.

10. A three-dimensional data decoding device comprising:

a processor; and

memory, wherein

using the memory, the processor:

calculates, using quantized values and one or more first parameters, coefficient values by inverse-quantizing each of the quantized values; and

calculates, from the coefficient values, items of attribute information of three-dimensional points included in point cloud data,

the one or more first parameters are one or more parameters for one or more groups to which one or more items of attribute information belong, the one or more items of attribute information being used in the calculating of a coefficient value to which a corresponding one of the quantized values corresponds,

at least one item of attribute information among the items of attribute information belongs to any one of the one or more groups,

the coefficient values are calculated corresponding to nodes included to a layered structure,

the layered structure is a structure in which each of the items of attribute information is hierarchically divided into a first component and a second component,

two first coefficient values of two first nodes belonging to a first layer of the layered structure are used in calculating a second coefficient value of a second node of a second layer which is one layer higher than the first layer,

in the inverse-quantizing, the processor:

(i) generates one or more second parameters by left-shifting the one or more first parameters by N bits, N being a natural number;

(ii) generates a third parameter by right-shifting, by one bit, a sum obtained by adding up two second parameters from among the one or more second parameters, the two second parameters corresponding to the two first nodes;

(iii) generates a fourth parameter by right-shifting the third parameter by N bits; and

(iv) inverse-quantizes a quantized value of the second node using the fourth parameter, and

each parameter of the one or more first parameters, the one or more second parameters, the third parameter, and the fourth parameter is expressed by a bit sequence.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 18, 2022
From: IGUCHI, NORITAKA; SUGIO, TOSHIYASU
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 061817/0953 →
Continuity (3)
Continuation PCTJP2020048819 · Dec 25, 2020
Provisional Application 62953777 · Dec 26, 2019
Related Publication 20220327745A1 · Oct 13, 2022
References Cited (30)
US 5861921A · Shimizu · 1999 [cited by examiner]
US 7620240B2 · Chi · 2009 [cited by examiner]
US 7894440B2 · Xu · 2011 [cited by examiner]
US 8280939B2 · Reyzin · 2012 [cited by examiner]
US 8463835B1 · Walke · 2013 [cited by examiner]
US 8588297B2 · Kishore · 2013 [cited by examiner]
US 8638800B2 · Kramer · 2014 [cited by examiner]
US 10200688B2 · Ikai · 2019 [cited by examiner]
US 10277910B2 · Xiu · 2019 [cited by examiner]
US 10368104B1 · Mitchell · 2019 [cited by examiner]
US 10853447B2 · Chou · 2020 [cited by examiner]
US 11113786B2 · Rovers · 2021 [cited by examiner]
US 11146828B2 · Lasang · 2021 [cited by examiner]
US 11954112B2 · Siebel · 2024 [cited by examiner]
US 20110186359A1 · Chen · 2011 [cited by examiner]
US 20140375638A1 · Tomaru et al. · 2014 [cited by applicant]
US 20180302641A1 · Ikai · 2018 [cited by examiner]
EP 3944195B1 · 2024 [cited by examiner]
JP 2005354307A · 2005 [cited by examiner]
JP 2011166795A · 2011 [cited by examiner]
WO 2014020663 · 2014 [cited by applicant]
WO WO2017061189A1 · 2017 [cited by examiner]
Compression of 3D point clouds using a region-adaptive hierarchical transform. IEEE Transactions on Image Processing 25.8 (2016): 3947-3956. (Year: 2016). [cited by examiner]
De Queiroz et al. “Compression of 3D point clouds using a region-adaptive hierarchical transform.” IEEE Transactions on Image Processing 25.8 (2016): 3947-3956. (Year: 2016). [cited by examiner]
Salmela et al. “Low-Complexity Inverse Square Root Approximation for Baseband Matrix Operations.” International Scholarly Research Notices 2011.1 (2011): 615934. (Year: 2011). [cited by examiner]
H. Hou, K. W. Shum, M. Chen and H. Li, “BASIC regenerating code: Binary addition and shift for exact repair,” 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, 2013, pp. 1621-1625, doi: 10.1109/… [cited by examiner]
M. Burtscher and P. Ratanaworabhan, “FPC: A High-Speed Compressor for Double-Precision Floating-Point Data,” in IEEE Transactions on Computers, vol. 58, No. 1, pp. 18-31, Jan. 2009, doi: 10.1109/TC.2008.131 (Year: 2008). [cited by examiner]
Voronenko, Yevgen, and Markus Püschel. “Multiplierless multiple constant multiplication.” ACM Transactions on Algorithms (TALG) 3.2 (2007): 11-es. (Year: 2007). [cited by examiner]
Cai, Hongyun, Vincent W. Zheng, and Kevin Chen-Chuan Chang. “A comprehensive survey of graph embedding: Problems, techniques, and applications.” IEEE transactions on knowledge and data engineering 30.9 (2018): 1616-1637… [cited by examiner]
International Search Report (ISR) issued on Mar. 2, 2021 in International (PCT) Application No. PCT/JP2020/048819. [cited by applicant]