IP Library › Granted Patent US 12,190,550
Granted Patent B2
US 12,190,550 · App. 17/771,354 · Granted Jan 7, 2025

Angular priors for improved prediction in point-predictive trees

Inventors: Sébastien Lasserre (Thorigné-fouillard, FR); Jonathan Taquet (Talensac, FR)
Assignee: BlackBerry Limited
G06T9/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,190,550
App. No.
17/771,354
Granted
Jan 7, 2025
Kind
B2
Abstract

A method of encoding or decoding a point cloud for representing a three-dimensional location of an object, the point cloud being generated by a device comprising a plurality of beam emitters. The method comprises using information from the beam emitter such as the angle of each beam emitter, and the azimuthal distance between each point capture, to more efficiently represent the point cloud data.

Claims (44)

1. A method of decoding a bitstream of compressed point cloud data representing a three-dimensional location of an object, the point cloud being represented by a predictive-point tree, for generating a point cloud data, the method comprising:

a) determining at least one of an elevation angle and an azimuthal angle associated with a point of a current node of the tree;

b) determining a prediction point from the at least one angle;

c) decoding a residual point from the bitstream; and

d) computing a point for the point cloud data by adding the residual point to the prediction point.

2. The method of claim 1 , wherein determining the prediction point further comprises computing a prediction radius.

3. The method of claim 2 , wherein the prediction radius is determined by a linear combination of radiuses associated with at least one ancestor node of the current node and one sibling node of the current node.

4. The method of claim 1 , wherein step b) further comprises converting the prediction point to cartesian coordinates.

5. The method of claim 1 , further comprising decoding a second residual from the bitstream and wherein the step d) of computing the point for the point cloud data further comprises adding the second residual to a sum of the residual point and the prediction point transformed from spherical coordinates to cartesian coordinates.

6. The method of claim 1 , wherein determining the prediction point comprises:

determining a first prediction point by a linear combination of points associated with at least one of an ancestor node of the current node and a sibling node of the current node;

projecting the first prediction point on a subspace determined from the at least one angle.

7. The method of claim 6 , wherein the subspace is an intersection of a cone associated with the elevation angle and a half-plane associated with the azimuthal angle.

8. The method of claim 1 , wherein determining the elevation angle comprises mapping a beam emitter index to the elevation angle.

9. The method of claim 2 , wherein determining the azimuthal angle comprises:

determining a first azimuthal angle associated to an ancestor node;

adding kΔφ h +Δφ(L anc →L current ) to the first azimuthal angle;

wherein k is an integer, Δφ h is an elementary horizontal shift for azimuthal angle, and Δφ(L anc →L current ) is an azimuthal distance between two consecutive points probed respectively by a laser beam L anc associated with the ancestor point and a laser beam L current associated with the current point.

10. A decoder for decoding a bitstream of compressed point cloud data to produce a reconstructed point cloud representing a three-dimensional location of a physical object, the decoder comprising:

a processor;

a memory; and

a decoding application containing instructions executable by the processor that, when executed, cause the processor to:

a) determine at least one of an elevation angle and an azimuthal angle associated with a point of a current node of the tree;

b) determine a prediction point from the at least one angle;

c) decode a residual point from the bitstream; and

d) compute a point for the point cloud data by adding the residual point to the prediction point.

11. A non-transitory processor-readable medium storing processor-executable instructions that, when executed by a processor, cause the processor to:

a) determine at least one of an elevation angle and an azimuthal angle associated with a point of a current node of the tree;

b) determine a prediction point from the at least one angle;

c) decode a residual point from the bitstream; and

d) compute a point for the point cloud data by adding the residual point to the prediction point.

12. The decoder of claim 10 , wherein the processor is caused to determine the prediction point by computing a prediction radius.

13. The decoder of claim 12 , wherein the prediction radius is determined by a linear combination of radiuses associated with at least one ancestor node of the current node and one sibling node of the current node.

14. The decoder of claim 10 , wherein the processor is caused to determine the prediction point from the at least one angle by converting the prediction point to cartesian coordinates.

15. The decoder of claim 10 , wherein the processor is further caused to decode a second residual from the bitstream and wherein the processor is further caused to compute the point for the point cloud data by adding the second residual to a sum of the residual point and the prediction point transformed from spherical coordinates to cartesian coordinates.

16. The decoder of claim 10 , wherein the processor is caused to determine the prediction point by:

determining a first prediction point by a linear combination of points associated with at least one of an ancestor node of the current node and a sibling node of the current node;

projecting the first prediction point on a subspace determined from the at least one angle.

17. The decoder of claim 16 , wherein the subspace is an intersection of a cone associated with the elevation angle and a half-plane associated with the azimuthal angle.

18. The decoder of claim 10 , wherein the processor is caused to determine the elevation angle by mapping a beam emitter index to the elevation angle.

19. The decoder of claim 12 , wherein the processor is caused to determine the azimuthal angle by:

determining a first azimuthal angle associated to an ancestor node;

adding kΔφ h +Δφ(L anc →L current ) to the first azimuthal angle;

wherein k is an integer, Δφ h is an elementary horizontal shift for azimuthal angle, and Δφ(L anc →L current ) is an azimuthal distance between two consecutive points probed respectively by a laser beam L anc associated with the ancestor point and a laser beam L current associated with the current point.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 22, 2022
From: LASSERRE, SÉBASTIEN; TAQUET, JONATHAN
To: BLACKBERRY FRANCE S.A.S.
Reel/Frame 059684/0258 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 22, 2022
From: BLACKBERRY FRANCE S.A.S.
To: BLACKBERRY LIMITED
Reel/Frame 059684/0353 →
Continuity (1)
Related Publication 20220358686A1 · Nov 10, 2022
References Cited (39)
US 11871037B2 · Ramasubramonian et al. · 2024 [cited by applicant]
US 11895307B2 · Mammou · 2024 [cited by examiner]
US 11941855B2 · Ray et al. · 2024 [cited by applicant]
US 20110282581A1 · Zeng · 2011 [cited by applicant]
US 20130235050A1 · Karras · 2013 [cited by applicant]
US 20160086353A1 · Lukac et al. · 2016 [cited by applicant]
US 20170214943A1 · Cohen et al. · 2017 [cited by applicant]
US 20170347100A1 · Chou et al. · 2017 [cited by applicant]
US 20190087979A1 · Mammou et al. · 2019 [cited by applicant]
US 20190156520A1 · Mammou et al. · 2019 [cited by applicant]
US 20190238853A1 · Galpin · 2019 [cited by examiner]
US 20210327095A1 · Van Der Auwera et al. · 2021 [cited by applicant]
US 20210327098A1 · Ray et al. · 2021 [cited by applicant]
US 20210327099A1 · Van Der Auwera et al. · 2021 [cited by applicant]
US 20210407143A1 · Van Der Auwera et al. · 2021 [cited by applicant]
US 20210409778A1 · Ramasubramonian et al. · 2021 [cited by applicant]
US 20220337872A1 · Park et al. · 2022 [cited by applicant]
US 20220366610A1 · Hur · 2022 [cited by examiner]
CN 101032172A · 2007 [cited by applicant]
CN 106846425A · 2017 [cited by applicant]
CN 108769679A · 2018 [cited by applicant]
J.-K. Ahn, K.-Y. Lee, J.-Y. Sim and C.-S. Kim, “Large-Scale 3D Point Cloud Compression Using Adaptive Radial Distance Prediction in Hybrid Coordinate Domains,” in IEEE Journal of Selected Topics in Signal Processing, vo… [cited by examiner]
I. Daribo, R. Furukawa, R. Sagawa and H. Kawasaki, “Adaptive arithmetic coding for point cloud compression,” 2012 3DTV—Conference: The True Vision—Capture, Transmission and Display of 3D Video (3DTV-CON), Zurich, Switze… [cited by examiner]
Patent Cooperation Treaty, International Search Report for International application No. PCT/IB2019/0012368 mailed Jun. 8, 2020. [cited by applicant]
Gustavo Sandri et al., “Region of Interest Coding for RAHT”, 126 MPEG Meeting, Mar. 2019, XP030212073. [cited by applicant]
Lasserre (Blackberry) S et al: “[GPCC][CE 13.22 related] An improvement of the planar coding mode”, 128, MPEG Meeting; Oct. 7-11, 2019, Geneva, XP030221086. [cited by applicant]
Tu Chenxi et al., “Real-Time Streaming Point Cloud Compression for 3D LiDAR Sensor Using U-Net”, IEEE Access, vol. 7, Aug. 2019, XP011742334. [cited by applicant]
Stefan Gumhold et al., “Predictive point-cloud compression”, Jul. 31, 2005, 1077952576-1077952576, Jul. 2005, pp. 137-es, XP058302295. [cited by applicant]
Lasserre (Blackberry) S et al: “[GPCC][CE 13.22 related] An improvement of the planar coding mode”, 128, MPEG Meeting; Oct. 7-11, 2019, Geneva, XP030221087. [cited by applicant]
Schwarz, Sebastian et al., “Emerging MPEG Standards for Point Cloud Compression”, IEEE Journal on Emerging and Selected Topics in Circuits and Systems, IEEE, Piscataway, NJ, USA, vol. 9, No. 1, Mar. 2019, pp. 133-148, X… [cited by applicant]
United States Patent and Trademark Office (USPTO) Office Action for U.S. Appl. No. 17/765,015 mailed Jun. 12, 2024, 22 pages. [cited by applicant]
In-Wook Song et al., “Progressive compression of PointTexture images” article in Proceedings of SPIE, Visual Communications and Image Processing 2004, Jan. 2004, 4 pages. [cited by applicant]
Miguel Branco Roque Nazare Ferreira, “Dynamic 3D Point Cloud Compression”, Master of Science Thesis from Tecnico Lisboa, Nov. 2017, 110 pages. [cited by applicant]
Armin Hornung et al. “OctoMap: an efficient probabilistic 3D mapping framework based on octrees”, Autonomous Robots, 2013, Preprint, 17 pages. [cited by applicant]
“G-PCC codec description v4” ISO/IEC JTC 1 S/C 29 W/G 11 coding of moving pictures and audio convenorship: UNI (Italy), Jul. 2019, 62 pages. [cited by applicant]
European Patent Office (EPO), Extended European Search Report (EESR), Application No. 19200890.2, Dated: Mar. 20, 2020, 11 pages. [cited by applicant]
China National Intellectual Property Administration (CNIPA): Office Action for Application No. 201980101940.0, dated Sep. 5, 2024, 5 pages. [cited by applicant]
United States Patent and Trademark Office (USPTO): Office Action for U.S. Appl. No. 17/771,246, Dated Sep. 19, 2024, 69 pages. [cited by applicant]
Canadian Intellectual Property Office (CIPO) Office Action for Application No. 3, 153,825, dated Aug. 29, 2024, 4 pages. [cited by applicant]
Cited By (1)
US 12,579,696