IP Library Granted Patent US 12,177,495
Granted Patent B2
US 12,177,495 · App. 18/081,029 · Granted Dec 24, 2024

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
H04N19/96H04N19/423H04N19/597H04N19/91
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,177,495
App. No.
18/081,029
Granted
Dec 24, 2024
Kind
B2
Abstract

A three-dimensional data encoding method includes: obtaining data units each including three-dimensional points; encoding the three-dimensional points included in each of the data units; and generating a bitstream including encoded data obtained by encoding the three-dimensional points. In the encoding: geometry information of three-dimensional points included in a data unit to be encoded is converted into occupancy maps using an N-ary tree; each of the occupancy maps is converted into an index using a table indicating a correspondence relation between occupancy maps and indexes, and the encoded data is generated by encoding the index; the table is updated according to the index resulting from the conversion, and is stored into the memory; and when it is determined that the table stored in the memory is not to be initialized, encoding of a next data unit is started using the table stored in the memory.

Claims (54)

1. A three-dimensional data encoding method comprising:

obtaining data units each including three-dimensional points;

encoding the three-dimensional points included in each of the data units; and

generating a bitstream including encoded data obtained by encoding the three-dimensional points,

wherein in the encoding:

geometry information of three-dimensional points included in a data unit to be encoded is converted into occupancy maps using an N-ary tree, N being an integer greater than or equal to 2;

each of the occupancy maps is converted into an index using a table indicating a correspondence relation between occupancy maps and indexes, and the encoded data is generated by encoding the index;

the table is updated according to the index resulting from the conversion, and is stored into memory;

whether the table stored in the memory is to be initialized is determined when a lead three-dimensional point included in a next data unit following the data unit to be encoded is encoded; and

when it is determined that the table stored in the memory is not to be initialized, encoding of the next data unit is started using the table stored in the memory, and

the bitstream further includes first identification information indicating a result of the determination.

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

wherein the index indicates a total number of occurrences of an occupancy map or an occurrence frequency of an occupancy map.

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

wherein when indicating that the table is to be initialized, the first identification information indicates that context of a preceding data unit is to be initialized, and attribute information of the three-dimensional points is to be encoded; and when indicating that the table is not to be initialized, the first identification information indicates that the attribute information is to be encoded continuously using the context of the preceding data unit.

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

wherein the bitstream further includes second identification information indicating whether a function of continuing entropy between the data units is to be used, and

when the second identification information indicates that the function of continuing the entropy between the data units is to be used, the first identification information is shown.

5. A three-dimensional data decoding method comprising:

obtaining a bitstream including encoded data and first identification information, the encoded data being obtained by encoding a data unit including three-dimensional points, the first identification information indicating whether a table is to be initialized and used to encode the data unit, the table being used in encoding a preceding data unit preceding the data unit; and

decoding the encoded data using the table according to the first identification information,

wherein the table indicates a correspondence relation between occupancy maps and indexes, the occupancy map representing geometry information of the three-dimensional points using an N-ary tree, N being an integer greater than or equal to 2,

the encoded data includes the index encoded, and

in the decoding, the geometry information of the three-dimensional points is calculated by deriving an occupancy map corresponding to, in the table, the index obtained by decoding the encoded data.

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

wherein the index indicates a total number of occurrences of an occupancy map or an occurrence frequency of an occupancy map.

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

wherein when indicating that the table is to be initialized, the first identification information indicates that context of the preceding data unit is to be initialized, and attribute information of the three-dimensional points is to be encoded; and when indicating that the table is not to be initialized, the first identification information indicates that the attribute information is to be encoded continuously using the context of the preceding data unit.

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

wherein the bitstream further includes second identification information indicating whether a function of continuing entropy between the data units is to be used, and

when the second identification information indicates that the function of continuing the entropy between the data units is to be used, the first identification information is shown.

9. A three-dimensional data encoding device comprising:

a processor; and

memory,

wherein using the memory, the processor:

obtains data units each including three-dimensional points;

encodes the three-dimensional points included in each of the data units; and

generates a bitstream including encoded data obtained by encoding the three-dimensional points,

in the encoding:

geometry information of three-dimensional points included in a data unit to be encoded is converted into occupancy maps using an N-ary tree, N being an integer greater than or equal to 2;

each of the occupancy maps is converted into an index using a table indicating a correspondence relation between occupancy maps and indexes, and the encoded data is generated by encoding the index;

the table is updated according to the index resulting from the conversion, and is stored into the memory;

whether the table stored in the memory is to be initialized is determined when a lead three-dimensional point included in a next data unit following the data unit to be encoded is encoded; and

when it is determined that the table stored in the memory is not to be initialized, encoding of the next data unit is started using the table stored in the memory, and

the bitstream further includes first identification information indicating a result of the determination.

10. A three-dimensional data decoding device comprising:

a processor; and

memory,

wherein using the memory, the processor:

obtains a bitstream including encoded data and first identification information, the encoded data being obtained by encoding a data unit including three-dimensional points, the first identification information indicating whether a table is to be initialized and used to encode the data unit, the table being used in encoding a preceding data unit preceding the data unit; and

decodes the encoded data using the table according to the first identification information,

the table indicates a correspondence relation between occupancy maps and indexes, the occupancy map representing geometry information of the three-dimensional points using an N-ary tree, N being an integer greater than or equal to 2,

the encoded data includes the index encoded, and

in the decoding, the geometry information of the three-dimensional points is calculated by deriving an occupancy map corresponding to, in the table, the index obtained by decoding the encoded data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 26, 2023
From: IGUCHI, NORITAKA; SUGIO, TOSHIYASU
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 063769/0462 →
Continuity (3)
Continuation PCTJP2021023939 · Jun 24, 2021
Provisional Application 63043937 · Jun 25, 2020
Related Publication 20230145001A1 · May 11, 2023
Cited By (2)
US 12,299,944 US 12,718,414