IP Library › Granted Patent US 12,536,707
Granted Patent B2
US 12,536,707 · App. 18/098,937 · Granted Jan 27, 2026

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

Inventors: Toshiyasu Sugio (Osaka, JP); Noritaka Iguchi (Osaka, JP); Takahiro Nishi (Nara, 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,536,707
App. No.
18/098,937
Granted
Jan 27, 2026
Kind
B2
Abstract

A three-dimensional data encoding method includes: encoding geometry information of a three-dimensional point included in point cloud data, using a prediction tree, to generate encoded geometry information; and encoding information indicating a child node count, which is a total number of child nodes of a node included in the prediction tree, to generate encoded child node count information. The encoded child node count information is represented by a bit count corresponding to the child node count, and when the child node count is 1, the encoded child node count information is represented by a lowest bit count.

Claims (48)

1 . A three-dimensional data encoding method comprising:

encoding geometry information of a three-dimensional point included in point cloud data, using a prediction tree, to generate encoded geometry information, the prediction tree including a plurality of nodes organized in a hierarchical structure;

encoding information indicating a child node count, which is a total number of child nodes of a node included in the prediction tree, to generate encoded child node count information; and

generating an encoded bitstream including the encoded geometry information and the encoded child node count information, wherein

the encoded child node count information is represented by a bit count corresponding to the child node count, and

when the child node count is 1, the encoded child node count information is represented by a lowest bit count.

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

when the child node count is 0, the encoded child node count information is represented by a second lowest bit count.

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

when the child node count is 1, the encoded child node count information is represented by 1 bit, and

when the child node count is 0, the encoded child node count information is represented by 2 bits.

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

when the child node count is 2 or 3, the encoded child node count information is represented by 3 bits.

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

when the child node count is 0 or 2, the encoded child node count information is not represented by the lowest bit count.

6 . A three-dimensional data decoding method comprising:

obtaining an encoded bitstream including encoded geometry information and encoded child node count information, the encoded geometry information being generated by encoding geometry information of a three-dimensional point included in point cloud data using a prediction tree, the prediction tree including a plurality of nodes organized in a hierarchical structure, the encoded child node count information being generated by encoding information indicating a child node count which is a total number of child nodes of a target node included in the prediction tree;

decoding the encoded child node count information to obtain the information indicating the child node count; and

decoding the encoded geometry information using the prediction tree and the information indicating the child node count, wherein

the encoded child node count information is represented by a bit count corresponding to the child node count, and

when the child node count is 1, the encoded child node count information is represented by a lowest bit count.

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

when the child node count is 0, the encoded child node count information is represented by a second lowest bit count.

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

when the child node count is 1, the encoded child node count information is represented by 1 bit, and

when the child node count is 0, the encoded child node count information is represented by 2 bits.

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

when the child node count is 2 or 3, the encoded child node count information is represented by 3 bits.

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

when the child node count is 0 or 2, the encoded child node count information is not represented by the lowest bit count.

11 . A three-dimensional data encoding device comprising:

a processor; and

memory, wherein

using the memory, the processor:

encodes geometry information of a three-dimensional point included in point cloud data, using a prediction tree, to generate encoded geometry information, the prediction tree including a plurality of nodes organized in a hierarchical structure;

encodes information indicating a child node count, which is a total number of child nodes of a node included in the prediction tree, to generate encoded child node count information; and

generates an encoded bitstream including the encoded geometry information and the encoded child node count information, wherein

the encoded child node count information is represented by a bit count corresponding to the child node count, and

when the child node count is 1, the encoded child node count information is represented by a lowest bit count.

12 . A three-dimensional data decoding device comprising:

a processor; and

memory, wherein

using the memory, the processor:

obtains an encoded bitstream including encoded geometry information and encoded child node count information, the encoded geometry information being generated by encoding geometry information of a three-dimensional point included in point cloud data using a prediction tree, the prediction tree including a plurality of nodes organized in a hierarchical structure, the encoded child node count information being generated by encoding information indicating a child node count which is a total number of child nodes of a target node included in the prediction tree;

decodes the encoded child node count information to obtain the information indicating the child node count; and

decodes the encoded geometry information using the prediction tree and the information indicating the child node count, wherein

the encoded child node count information is represented by a bit count corresponding to the child node count, and

when the child node count is 1, the encoded child node count information is represented by a lowest bit count.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 25, 2023
From: SUGIO, TOSHIYASU; IGUCHI, NORITAKA; NISHI, TAKAHIRO
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 063769/0209 →
Continuity (3)
Continuation PCTJP2021028424 · Jul 30, 2021
Provisional Application 63059500 · Jul 31, 2020
Related Publication 20230162405A1 · May 25, 2023
References Cited (13)
US 11935270B2 · Ray · 2024 [cited by examiner]
US 12069316B2 · Oh · 2024 [cited by examiner]
US 12080034B2 · Wan · 2024 [cited by examiner]
US 12236646B2 · Oh · 2025 [cited by examiner]
US 20140375638A1 · Tomaru et al. · 2014 [cited by applicant]
US 20210012538A1 · Wang et al. · 2021 [cited by applicant]
US 20230123146A1 · Sugio · 2023 [cited by examiner]
US 20240251097A1 · Pham Van · 2024 [cited by examiner]
US 20240323438A1 · Sugio · 2024 [cited by examiner]
US 20240373044A1 · Sugio · 2024 [cited by examiner]
WO 2014020663 · 2014 [cited by applicant]
WO 2019203297 · 2019 [cited by applicant]
International Search Report (ISR) issued on Oct. 26, 2021 in International (PCT) Application No. PCT/JP2021/028424. [cited by applicant]