IP Library › Granted Patent US 12,354,315
Granted Patent B2
US 12,354,315 · App. 18/001,962 · Granted Jul 8, 2025

Method for encoding and decoding a point cloud

Inventors: Wei Zhang (Shaanxi, CN); Mary-Luc Georges Henry Champel (Beijing, CN)
Assignees: Beijing Xiaomi Mobile Software Co., Ltd.; Xidian University
G06T9/40G06T9/001H04N19/61
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,354,315
App. No.
18/001,962
Granted
Jul 8, 2025
Kind
B2
Abstract

A method for encoding attributes of points of a point cloud, includes: determining a true transform coefficient by applying RAHT to attributes of a present node; determining a difference between attributes of a present parent node and each parent node of a first set of parent nodes sharing a face or an edge with the present node; selecting a second set of parent nodes from the first set of parent nodes according to the difference; determining a predicted value for the attributes of the present node according to attributes of the second set of parent nodes; determining a predicted transform coefficient by applying the RAHT to the predicted value of the attributes of the present node; determining a residual from the true transform coefficient and the predicted transform coefficient; and encoding the residual to produce encoded data of attributes of the point cloud for a bitstream.

Claims (66)

1. A method for encoding attributes of points of a point cloud to generate a bitstream of compressed point cloud data, wherein the point cloud's geometry is represented by a voxel-based structure with a plurality of nodes having parent-child relationships by recursively splitting a volumetric space containing the point cloud into sub-volumes each associated with a node of the voxel-based structure, the method comprising:

determining a true transform coefficient by applying Region-Adaptive Hierarchal Transform (RAHT), to attributes of a present node;

determining a difference between attributes of a present parent node and each parent node of a first set of parent nodes sharing a face or an edge with the present node, wherein the present parent node is the parent node of the present node;

selecting a second set of parent nodes from the first set of parent nodes according to the difference, wherein the second set of parent nodes includes the present parent node;

determining a predicted value for the attributes of the present node according to attributes of the second set of parent nodes;

determining a predicted transform coefficient by applying the RAHT to the predicted value of the attributes of the present node;

determining a residual from the true transform coefficient and the predicted transform coefficient; and

encoding the residual to produce encoded data of attributes of the point cloud for the bitstream.

2. The method according to claim 1 , wherein determining the difference between the attributes of the present parent node and each parent node of the first set of parent nodes includes:

determining a maximum difference among each parent node of the first set of parent nodes and the present parent node;

providing a first threshold; and

if the maximum difference is smaller than the first threshold, selecting all parent nodes of the first set of parent nodes.

3. The method according to claim 1 , wherein determining the difference between the attributes of the present parent node and each parent node of the first set of parent nodes includes:

determining a difference between the attributes of each of the parent nodes in the first set of parent nodes and the present parent node;

providing a second threshold; and

selecting parent nodes of the first set of parent nodes if the respective difference is smaller than the second threshold.

4. The method according to claim 3 , wherein at least one of the first threshold or the second threshold is fixed.

5. The method according to claim 3 , wherein at least one of the first threshold or the second threshold is determined according to a distribution of the attributes within the complete point cloud.

6. The method according to claim 3 , wherein at least one of the first threshold or the second threshold is determined according to the first set of parent nodes.

7. The method according to claim 3 , wherein the second threshold is a percentage of the first threshold.

8. The method according to claim 3 , wherein at least one of the first threshold and/or or the second threshold is determined according to a ration between the attributes of the present node and the attributes of parent nodes of the first set of parent nodes.

9. The method according to claim 3 , wherein at least one of the first threshold and or the second threshold is included into the bitstream.

10. The method according to claim 9 , wherein at least one of the first threshold or the second threshold is included into the bitstream only at the top of at least one subtree for which the at least one of the first threshold or the second threshold is used and is inherited by all nodes in the subtree for which there is no explicit signaling of another first or second threshold.

11. An encoder for encoding attributes of points of a point cloud to generate a bitstream of compressed point cloud data, wherein the point cloud's geometry is represented by a voxel-based structure with a plurality of nodes having parent-child relationships by recursively splitting a volumetric space containing the point cloud into sub-volumes each associated with a node of the voxel-based structure, the encoder comprising:

a processor; and

a memory storage device storing instructions executable by the processor,

wherein the processor is configured to:

determine a true transform coefficient by applying Region-Adaptive Hierarchal Transform (RAHT) to attributes of a present node;

determine a difference between attributes of a present parent node and each parent node of a first set of parent nodes sharing a face or an edge with the present node, wherein the present parent node is the parent node of the present node;

select a second set of parent nodes from the first set of parent nodes according to the difference, wherein the second set of parent nodes includes the present parent node;

determine a predicted value for the attributes of the present node according to attributes of the second set of parent nodes;

determine a predicted transform coefficient by applying the RAHT to the predicted value of the attributes of the present node;

determine a residual from the true transform coefficient and the predicted transform coefficient; and

encode the residual to produce encoded data of attributes of the point cloud for the bitstream.

12. A decoder for decoding a bitstream of compressed point cloud data to generate attributes of points of a reconstructed point cloud, wherein the point cloud's geometry is represented by a voxel-based structure with a plurality of nodes having parent-child relationships by recursively splitting a volumetric space containing the point cloud into sub-volumes each associated with a node of the voxel-bases structure, the decoder comprising:

a processor; and

a memory storage device storing instructions executable by the processor,

wherein the processor is configured to:

decode a residual of attributes of a present node of the point cloud from the bitstream;

determine a difference between attributes of a present parent node and each parent node of a first set of parent nodes sharing a face or an edge with the present node, wherein the present parent node is the parent node of the present node;

select a second set of parent nodes from the first set of parent nodes according to the difference, wherein the second set of parent nodes includes the present parent node;

determine a predicted value for the attributes of the present node according to attributes of the second set of parent nodes;

determine a predicted transform coefficient by applying Region-Adaptive Hierarchal Transform (RAHT) to the predicted value of the attributes of the present node; and

determine from the residual and the predicted transform coefficient the attributes of the present node by applying an inverse RAHT.

13. A method for decoding a bitstream of compressed point cloud data to generate attributes of points in a reconstructed point cloud, wherein the point cloud's geometry is represented by a voxel-based structure with a plurality of nodes having parent-child relationships by recursively splitting a volumetric space containing the point cloud into sub-volumes each associated with a node of the voxel-bases structure, the method comprising:

decoding a residual of attributes of a present node of the point cloud from the bitstream;

determining a difference between attributes of a present parent node and each parent node of a first set of parent nodes sharing a face or an edge with the present node, wherein the present parent node is the parent node of the present node;

selecting a second set of parent nodes from the first set of parent nodes according to the difference, wherein the second set of parent nodes includes the present parent node;

determining a predicted value for the attributes of the present node according to attributes of the second set of parent nodes;

determining a predicted transform coefficient by applying Region-Adaptive Hierarchal Transform (RAHT) to the predicted value of the attributes of the present node; and

determining from the residual and the predicted transform coefficient the attributes of the present node by applying an inverse RAHT.

14. The method according to claim 13 , wherein determining the difference between the attributes of the present parent node and each parent node of the first set of parent nodes includes:

determining a maximum difference among each parent node of the first set of parent nodes and the present parent node;

providing a first threshold; and

if the maximum difference is smaller than the first threshold, selecting all parent nodes of the first set of parent nodes.

15. The method according to claim 13 , wherein determining the difference between the attributes of the present parent node and each parent node of the first set of parent nodes includes:

determining a difference between the attributes of each of the parent nodes in the first set of parent nodes and the present parent node;

providing a second threshold; and

selecting parent nodes of the first set of parent nodes if the respective difference is smaller than the second threshold.

16. The method according to claim 15 , wherein at least one of the first threshold or the second threshold is fixed.

17. The method according to claim 15 , wherein at least one of the first threshold or the second threshold is determined according to a distribution of the attributes within the complete point cloud.

18. The method according to claim 15 , wherein at least one of the first threshold or the second threshold is determined according to the first set of parent nodes.

19. The method according to claim 15 , wherein the second threshold is a percentage of the first threshold.

20. The method according to claim 15 , wherein at least one of the first threshold or the second threshold is determined according to a ration between the attributes of the present node and the attributes of parent nodes of the first set of parent nodes.

21. The method according to claim 15 , wherein at least one of the first threshold or the second threshold is included into the bitstream.

22. The method according to claim 21 , wherein at least one of the first threshold or the second threshold is included into the bitstream only at the top of at least one subtree for which the at least one of the first threshold or the second threshold is used and is inherited by all nodes in the subtree for which there is no explicit signaling of another first or second threshold.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 15, 2022
From: ZHANG, WEI; CHAMPEL, MARY-LUC GEORGES HENRY
To: BEIJING XIAOMI MOBILE SOFTWARE CO., LTD.; XIDIAN UNIVERSITY
Reel/Frame 062107/0779 →
Continuity (1)
Related Publication 20230267651A1 · Aug 24, 2023
References Cited (91)
US 10223810B2 · Chou et al. · 2019 [cited by applicant]
US 10674165B2 · Panusopone et al. · 2020 [cited by applicant]
US 10693492B1 · Lasserre et al. · 2020 [cited by applicant]
US 10694210B2 · Chou et al. · 2020 [cited by applicant]
US 11483363B2 · Hur · 2022 [cited by examiner]
US 11563984B2 · Zhang · 2023 [cited by examiner]
US 11601488B2 · Hur · 2023 [cited by examiner]
US 11601675B2 · Park · 2023 [cited by examiner]
US 11611775B2 · Gao · 2023 [cited by examiner]
US 11615557B2 · Flynn · 2023 [cited by examiner]
US 11620768B2 · Flynn · 2023 [cited by examiner]
US 11676310B2 · Huang · 2023 [cited by examiner]
US 11711545B2 · Zhang · 2023 [cited by examiner]
US 11736726B2 · Zhang · 2023 [cited by examiner]
US 11750839B2 · Zhang · 2023 [cited by examiner]
US 11843803B2 · Zhang · 2023 [cited by examiner]
US 11895307B2 · Mammou · 2024 [cited by examiner]
US 11936850B2 · Wan · 2024 [cited by examiner]
US 11948336B2 · Zhang · 2024 [cited by examiner]
US 12010341B2 · Oh · 2024 [cited by examiner]
US 12069316B2 · Oh · 2024 [cited by examiner]
US 12087023B2 · Sugio · 2024 [cited by examiner]
US 12113963B2 · Zhu · 2024 [cited by examiner]
US 12149717B2 · Zhang · 2024 [cited by examiner]
US 12165368B2 · Oh · 2024 [cited by examiner]
US 12167032B2 · Sugio · 2024 [cited by examiner]
US 12198392B2 · Iguchi · 2025 [cited by examiner]
US 20140270476A1 · Cameron et al. · 2014 [cited by applicant]
US 20170214943A1 · Cohen et al. · 2017 [cited by applicant]
US 20170347100A1 · Chou et al. · 2017 [cited by applicant]
US 20170347122A1 · Chou et al. · 2017 [cited by applicant]
US 20190394496A1 · Tourapis et al. · 2019 [cited by applicant]
US 20200021844A1 · Yea et al. · 2020 [cited by applicant]
US 20200143568A1 · Lasserre et al. · 2020 [cited by applicant]
US 20200396489A1 · Flynn et al. · 2020 [cited by applicant]
US 20200413080A1 · Lasserre et al. · 2020 [cited by applicant]
US 20210004992A1 · Flynn et al. · 2021 [cited by applicant]
US 20210327099A1 · Van der Auwera et al. · 2021 [cited by applicant]
US 20220351423A1 · Martin-Cocher et al. · 2022 [cited by applicant]
US 20250063196A1 · Sugio · 2025 [cited by examiner]
CA 3096452A1 · 2019 [cited by applicant]
CA 3103454A1 · 2019 [cited by applicant]
CN 106846425A · 2017 [cited by applicant]
CN 110418135A · 2019 [cited by applicant]
CN 110572655A · 2019 [cited by applicant]
CN 110915219A · 2020 [cited by applicant]
CN 111145090A · 2020 [cited by applicant]
CN 111615791A · 2020 [cited by applicant]
CN 111615792A · 2020 [cited by applicant]
CN 111699697A · 2020 [cited by applicant]
CN 114503440A · 2022 [cited by applicant]
EP 3514967A1 · 2019 [cited by applicant]
EP 3595180A1 · 2020 [cited by applicant]
JP 2018101404A · 2018 [cited by applicant]
JP 2021528917A · 2021 [cited by applicant]
JP 2022504344A · 2022 [cited by applicant]
RU 2267161C2 · 2005 [cited by applicant]
WO WO2017209961A1 · 2017 [cited by applicant]
WO WO2019140508A1 · 2019 [cited by applicant]
WO WO2019140510A1 · 2019 [cited by applicant]
WO WO2019195922A1 · 2019 [cited by applicant]
WO WO2020072665A1 · 2020 [cited by applicant]
European Patent Office, Office Action Issued in Application No. 20196648.8, Jan. 25, 2024, Germany, 5 pages. [cited by applicant]
European Patent Office, Office Action Issued in Application No. 20196653.8, Jan. 26, 2024, Germany, 7 pages. [cited by applicant]
Wei Zhang et al:“[G-PCC] [new proposal] Planar coding improvement”, 130.MPEG Meeting; Apr. 20, 2020-Apr. 24, 2020; XP030287104, No. m53522, Apr. 23, 2020, 5 pages. [cited by applicant]
Japanese Patent Office, Office Action Issued in Application No. 2022-579816, Mar. 5, 2024, 9 pages. (Submitted with Machine Translation). [cited by applicant]
State Intellectual Property Office of the People's Republic of China, Office Action and Search Report Issued in Application No. 2022107881419, Mar. 29, 2024, 16 pages. (Submitted with Machine Translation). [cited by applicant]
Notice of Reasons for Refusal issued in Japanese Application No. 2022-578799, dated Aug. 10, 2023, 4 pages. [cited by applicant]
Notice about the results of checking the patentability of an invention issued in Russian Application No. 2022133674/28(073328), dated Aug. 8, 2023, 16 pages. [cited by applicant]
Intellectual Property India, Office Action Issued in Application No. 202247074337, Apr. 24, 2023, 5 pages. [cited by applicant]
ISA State Intellectual Property Office of the People's Republic of China, Written Opinion of the International Searching Authority Issued in Application No. PCT/CN2020/098267, Nov. 11, 2020, WIPO, 6 pages. [cited by applicant]
ISA State Intellectual Property Office of the People's Republic of China, Written Opinion of the International Searching Authority Issued in Application No. PCT/CN2020/098272, Nov. 11, 2020, WIPO, 6 pages. [cited by applicant]
ISA State Intellectual Property Office of the People's Republic of China, Written Opinion of the International Searching Authority Issued in Application No. PCT/CN2020/119829, Jun. 29, 2021, WIPO, 5 pages. [cited by applicant]
ISA State Intellectual Property Office of the People's Republic of China, International Search Report issued in Application No. PCT/CN2020/098272, Nov. 11, 2020, WIPO, 2 pages. [cited by applicant]
State Intellectual Property Office of the People's Republic of China, Office Action and Search Report issued in Application No. 202080003877.X, Nov. 3, 2021, 9 pages. [cited by applicant]
State Intellectual Property Office of the People's Republic of China, Office Action and Search Report issued in Application No. 202080003878.4, Nov. 3, 2021, 14 pages. [cited by applicant]
ISA State Intellectual Property Office of the People's Republic of China, International Search Report issued in Application No. PCT/CN2020/098267, Nov. 11, 2020, WIPO, 4 pages. [cited by applicant]
ISA State Intellectual Property Office of the People's Republic of China, International Search Report issued in Application No. PCT/CN2020/119829, Jun. 29, 2021, WIPO, 5 pages. [cited by applicant]
European Patent Office, Extended European Search Report Issued in Application No. 20196648.8, Mar. 1, 2021, 8 pages. [cited by applicant]
European Patent Office, Extended European Search Report Issued in Application No. 20196653.8, Mar. 1, 2021, 13 pages. [cited by applicant]
Ke Zhang et al., “Hierarchical Segmentation Based Point Cloud Attribute Compression” “2018 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)”, Dec. 31, 2018, 5 pages. [cited by applicant]
Eduardo Pavez et al., “Dynamic Polygon Cloud Compression” “IEEE”, Mar. 5, 2017, 6 pages. [cited by applicant]
Sebastien Lasserre et al., “[GPCC] [CE 13.22 related] An improvement of the planar coding mode”, “128.MPEG meeting No. m50642”, Oct. 11, 2019, 3 pages. [cited by applicant]
Sebastien Lasserre et al., “[GPCC] Planar mode in octree-based geometry coding” “127.MPEG meeting No. m48906”, Jul. 12, 2019, 33 pages. [cited by applicant]
Antoine Dricot et al., “Adaptive Multi-level Triangle Soup for Geometry-based Point Cloud Coding”, “2019 IEE 21st International Workshop on Multimedia Signal Processing (MMSP)”, Dec. 31, 2019, 6 pages. [cited by applicant]
Lasserre (Blackberry)S et al., “On an improvement of RAHT to exploit attribute correlation”, “126. MPEG Meeting; Mar. 25, 2019-Mar. 29, 2019; Geneva; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11), No. m47378, … [cited by applicant]
3DG, “G-PCC codec description” “128.MPEG Meeting; Oct. 7, 2019-Oct. 11, 2019; Geneva; (Muiuinpicture Expert Group or ISO/IEC JTC1/SC29/WG11), No. n18891, XP030225589” Dec. 18, 2019, 74 pages. [cited by applicant]
Sebastien Lasserre et al., “Entropy coding an octree node occupancy depending on neighbour's child nodes (TM3)”, “124.MPEG Macau, m44753”, Oct. 2018, 29 pages. [cited by applicant]
Khaled Mammou et al., “Adaptive Distance-based Prediction in TMC3”, “Apple Inc., ISO/IEC JTC1/SC29/WG11 MPEG2018/m42642, San Diego, US”, Apr. 2018, 3 pages. [cited by applicant]
Office Action issued by the Intellectual Property India on Mar. 27, 2025, in corresponding Application No. IN 202247074338, 7 pages. [cited by applicant]
Non-final Office Action issued by the U.S. Patent and Trademark Office on May 20, 2025, in U.S. Appl. No. 18/000,919, 23 pages. [cited by applicant]