IP Library Granted Patent US 12,444,093
Granted Patent B2
US 12,444,093 · App. 18/096,637 · Granted Oct 14, 2025

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

Inventors: Masato Ohkawa (Toyama, JP); Noritaka Iguchi (Osaka, JP); Toshiyasu Sugio (Osaka, JP)
Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
G06T9/40H04N19/96
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,444,093
App. No.
18/096,637
Granted
Oct 14, 2025
Kind
B2
Abstract

A three-dimensional data encoding method includes: encoding geometry information of a plurality of three-dimensional points represented by a tree structure; and generating a bitstream including the geometry information encoded and division number information indicating a total number of divisions of each of a plurality of nodes included in the tree structure. The division number information includes common division number information collectively indicating the total number of divisions of two or more nodes among the plurality of nodes.

Claims (46)

1. A three-dimensional data encoding method comprising:

encoding geometry information of a plurality of three-dimensional points represented by a tree structure; and

generating a bitstream including the geometry information encoded and division number information indicating a total number of divisions of each of a plurality of nodes included in the tree structure, wherein

the division number information includes common division number information collectively indicating the total number of divisions of two or more nodes among the plurality of nodes.

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

among the plurality of nodes, nodes located at a same depth in the tree structure are divided into a same number of divisions,

the division number information indicates the total number of divisions of nodes for each of depths in the tree structure, and

the common division number information collectively indicates the total number of divisions of nodes for two or more of the depths.

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

the common division number information includes trigger information indicating that nodes have a same number of divisions from a predetermined depth and beyond in the tree structure.

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

the common division number information further includes end depth information indicating an end depth up to which the total number of divisions of nodes from the predetermined depth is the same.

5. The three-dimensional data encoding method according to claim 3 , wherein

the plurality of nodes each correspond to at least part of a space in a three-axis orthogonal coordinate system,

the division number information includes flag information indicating, for each of depths in the tree structure, whether to divide the space in each of three axial directions of the three-axis orthogonal coordinate system, and

the trigger information is the flag information indicating not to divide the space in each of the three axial directions.

6. A three-dimensional data decoding method comprising:

obtaining a bitstream including encoded geometry information and division number information, the encoded geometry information being geometry information of a plurality of three-dimensional points represented by a tree structure, the division number information indicating a total number of divisions of each of a plurality of nodes included in the tree structure; and

decoding the encoded geometry information based on the division number information, wherein

the division number information includes common division number information collectively indicating the total number of divisions of two or more nodes among the plurality of nodes.

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

among the plurality of nodes, nodes located at a same depth in the tree structure are divided into a same number of divisions,

the division number information indicates the total number of divisions of nodes for each of depths in the tree structure, and

the common division number information collectively indicates the total number of divisions of nodes for two or more of the depths.

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

the common division number information includes trigger information indicating that nodes have a same number of divisions from a predetermined depth and beyond in the tree structure.

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

the common division number information further includes end depth information indicating an end depth up to which the total number of divisions of nodes from the predetermined depth is the same.

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

the plurality of nodes each correspond to at least part of a space in a three-axis orthogonal coordinate system,

the division number information includes flag information indicating, for each of depths in the tree structure, whether to divide the space in each of three axial directions of the three-axis orthogonal coordinate system, and

the trigger information is the flag information indicating not to divide the space in each of the three axial directions.

11. A three-dimensional data encoding device comprising:

a processor; and

memory, wherein

using the memory, the processor:

encodes geometry information of a plurality of three-dimensional points represented by a tree structure; and

generates a bitstream including the geometry information encoded and division number information indicating a total number of divisions of each of a plurality of nodes included in the tree structure, wherein

the division number information includes common division number information collectively indicating the total number of divisions of two or more nodes among the plurality of nodes.

12. A three-dimensional data decoding device comprising:

a processor; and

memory, wherein

using the memory, the processor:

obtains a bitstream including encoded geometry information and division number information, the encoded geometry information being geometry information of a plurality of three-dimensional points represented by a tree structure, the division number information indicating a total number of divisions of each of a plurality of nodes included in the tree structure; and

decodes the encoded geometry information based on the division number information, wherein

the division number information includes common division number information collectively indicating the total number of divisions of two or more nodes among the plurality of nodes.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 25, 2023
From: OHKAWA, MASATO; IGUCHI, NORITAKA; SUGIO, TOSHIYASU
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 063769/0227 →
Continuity (3)
Continuation PCTJP2021027117 · Jul 20, 2021
Provisional Application 63055042 · Jul 22, 2020
Related Publication 20230154056A1 · May 18, 2023
References Cited (7)
US 12108085B2 · Iguchi · 2024 [cited by examiner]
US 20140375638A1 · Tomaru et al. · 2014 [cited by applicant]
US 20200252659A1 · Lasang · 2020 [cited by examiner]
US 20230419554A1 · Chen · 2023 [cited by examiner]
WO 2014020663 · 2014 [cited by applicant]
WO 2019082837 · 2019 [cited by applicant]
International Search Report issued Sep. 28, 2021 in International (PCT) Application No. PCT/JP2021/027117. [cited by applicant]