IP Library › Granted Patent US 12,131,509
Granted Patent B2
US 12,131,509 · App. 17/690,671 · Granted Oct 29, 2024

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

Inventors: Chung Dean Han (Johor Bahru, MY); Pongsak Lasang (Singapore, SG); Pradit Mittrapiyanuruk (Singapore, SG); Keng Liang Loi (Singapore, SG); Noritaka Iguchi (Osaka, JP); Toshiyasu Sugio (Osaka, JP)
Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
G06T9/40G06T9/00H04N19/17G06T17/00G06T17/005G06T2200/04G06T2207/10028G06T2207/20021H04N2007/243H04N13/161H04N19/96H04N21/23614H04N21/8146H04N21/816
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,131,509
App. No.
17/690,671
Granted
Oct 29, 2024
Kind
B2
Abstract

A three-dimensional data encoding method includes: encoding three-dimensional points each located in any one of a plurality of regions, on a per region basis, to generate encoded three-dimensional points; generating connectivity information generated based on a relationship between a first region among the plurality of regions and second regions aside from the first region among the plurality of regions, the connectivity information including (i) tile information indicating values each uniquely assigned to a different one of the plurality of regions and (ii) relation information indicating that the first region and one of the second regions are related; and generating a bitstream including the connectivity information generated and the encoded three-dimensional points.

Claims (51)

1. A three-dimensional data encoding method comprising:

encoding three-dimensional points each located in any one of a plurality of regions, on a per region basis, to generate encoded three-dimensional points;

generating connectivity information generated based on a relationship between a first region among the plurality of regions and second regions aside from the first region among the plurality of regions, the connectivity information including (i) tile information indicating values each uniquely assigned to a different one of the plurality of regions and (ii) relation information indicating that the first region and one of the second regions are related; and

generating a bitstream including the connectivity information generated and the encoded three-dimensional points;

wherein the generating of the connectivity information includes:

determining which predetermined group among predetermined groups each of the second regions belongs to based on the relationship; and

generating the connectivity information including group information indicating each predetermined group that is determined.

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

the relationship is a positional relationship between the first region and the second regions.

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

the generating of the connectivity information includes generating the connectivity information including the relation information indicating that an encoded three-dimensional point located in the one of the second regions which contacts or overlaps the first region is to be decoded.

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

the generating of the connectivity information includes generating the connectivity information including the relation information which (i) is generated based on direction information indicating a direction from the first region and (ii) indicates that an encoded three-dimensional point located in the one of the second regions which is located in the direction when seen from the first region is to be decoded.

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

the generating of the connectivity information includes generating the connectivity information including the relation information indicating that the encoded three-dimensional points are decoded in an order of ascending distance between the first region and the second regions.

6. A three-dimensional data decoding method comprising:

obtaining a bitstream including encoded three-dimensional points each located in any one of a plurality of regions and encoded on a per region basis;

obtaining connectivity information generated based on a relationship between a first region among the plurality of regions and second regions aside from the first region among the plurality of regions, the connectivity information including (i) tile information indicating values each uniquely assigned to a different one of the plurality of regions and (ii) relation information indicating that the first region and one of the second regions are related; and

selectively decoding the encoded three-dimensional points on a per region basis, based on the connectivity information obtained;

wherein the obtaining of the connectivity information includes obtaining the connectivity information including group information indicating which predetermined group among predetermined groups each of the second regions belongs to based on the relationship.

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

the relationship is a positional relationship between the first region and the second regions.

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

the obtaining of the connectivity information includes obtaining the connectivity information including the relation information indicating that an encoded three-dimensional point located in the one of the second regions which contacts or overlaps the first region is to be decoded.

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

the obtaining of the connectivity information includes obtaining the connectivity information including the relation information which (i) is generated based on direction information indicating a direction from the first region and (ii) indicates that an encoded three-dimensional point located in the one of the second regions which is located in the direction when seen from the first region is to be decoded.

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

the obtaining of the connectivity information includes obtaining the connectivity information including the relation information indicating that the encoded three-dimensional points are decoded in an order of ascending distance between the first region and the second regions.

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

the connectivity information is included in the bitstream, and

the obtaining of the connectivity information includes obtaining the connectivity information included in the bitstream.

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

the obtaining of the connectivity information includes obtaining the connectivity information by generating the connectivity information based on the encoded three-dimensional points included in the bitstream.

13. A three-dimensional data encoding device comprising:

a processor; and

memory,

wherein using the memory, the processor:

encodes three-dimensional points each located in any one of a plurality of regions, on a per region basis, to generate encoded three-dimensional points;

generates connectivity information generated based on a relationship between a first region among the plurality of regions and second regions aside from the first region among the plurality of regions, the connectivity information including (i) tile information indicating values each uniquely assigned to a different one of the plurality of regions and (ii) relation information indicating that the first region and one of the second regions are related; and

generates a bitstream including the connectivity information generated and the encoded three-dimensional points;

wherein the generating of the connectivity information includes:

determining which predetermined group among predetermined groups each of the second regions belongs to based on the relationship; and

generating the connectivity information including group information indicating each predetermined group that is determined.

14. A three-dimensional data decoding device comprising:

a processor; and

memory,

wherein using the memory, the processor:

obtains a bitstream including encoded three-dimensional points each located in any one of a plurality of regions and encoded on a per region basis;

obtains connectivity information generated based on a relationship between a first region among the plurality of regions and second regions aside from the first region among the plurality of regions, the connectivity information including (i) tile information indicating values each uniquely assigned to a different one of the plurality of regions and (ii) relation information indicating that the first region and one of the second regions are related; and

selectively decodes the encoded three-dimensional points on a per region basis, based on the connectivity information obtained;

wherein the obtaining of the connectivity information includes obtaining the connectivity information including group information indicating which predetermined group among predetermined groups each of the second regions belongs to based on the relationship.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 19, 2022
From: HAN, CHUNG DEAN; LASANG, PONGSAK; MITTRAPIYANURUK, PRADIT; LOI, KENG LIANG; IGUCHI, NORITAKA; SUGIO, TOSHIYASU
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 061212/0348 →
Continuity (3)
Continuation PCTJP2020037594 · Oct 2, 2020
Provisional Application 62910039 · Oct 3, 2019
Related Publication 20220198719A1 · Jun 23, 2022
Cited By (1)
US 12,413,780