IP Library Granted Patent US 10,769,840
Granted Patent B2
US 10,769,840 · App. 16/051,219 · Granted Sep 8, 2020

Analysis of point cloud data using polar depth maps and planarization techniques

Inventors: Ishwar Kulkarni (Santa Clara, CA); Ibrahim Eden (Redmond, WA); Michael Kroepfl (Redmond, WA); David Nister (Redmond, WA)
Assignee: Nvidia Corporation
G06T15/04G01S17/89G06K9/00791G06K9/00805G06K9/00818G06K9/00825G06T7/30G06T7/521G06T11/001G06T2207/10028G06T2207/30241
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 10,769,840
App. No.
16/051,219
Granted
Sep 8, 2020
Kind
B2
Abstract

Various types of systems or technologies can be used to collect data in a 3D space. For example, LiDAR (light detection and ranging) and RADAR (radio detection and ranging) systems are commonly used to generate point cloud data for 3D space around vehicles, for such functions as localization, mapping, and tracking. This disclosure provides improvements for processing the point cloud data that has been collected. The processing improvements include using a three dimensional polar depth map to assist in performing nearest neighbor analysis on point cloud data for object detection, trajectory detection, freespace detection, obstacle detection, landmark detection, and providing other geometric space parameters.

Claims (46)

1. A method of generating geometric space parameters, utilizing a graphics processing unit (GPU), comprising:

transforming point cloud data, for a three dimensional (3D) point representation, to a 3D polar depth map that includes distances between data points of said point cloud data and a sensor for collecting said data points, wherein said point cloud data are not received as said polar depth map;

determining plane information for said data points of said polar depth map;

performing nearest neighbor analysis for said data points utilizing said plane information and said polar depth map; and

generating said geometric space parameters utilizing said nearest neighbor analysis and said polar depth map.

2. The method as recited in claim 1 , further comprising:

storing said plane information and said polar depth map in a two dimensional (2D) depth map, wherein said performing utilizes said stored plane information and said stored polar depth map.

3. The method as recited in claim 2 , wherein said storing utilizes a texture map.

4. The method as recited in claim 1 , further comprising:

utilizing a LiDAR system to generate, at a periodic interval, multiple slices of said point cloud data wherein said 3D point representation is for part of a geometric space associated with said LiDAR system.

5. The method as recited in claim 4 , wherein said transforming, said determining, said performing, and said generating are executed for each of said multiple slices.

6. The method as recited in claim 1 , further comprising:

estimating trajectory equations utilizing said nearest neighbor analysis and said point cloud data; and

calculating moving object parameters utilizing said trajectory equations.

7. The method as recited in claim 1 , wherein said geometric space parameters are parameters for at least one of obstacle detection, freespace detection, and landmark detection.

8. The method as recited in claim 1 , wherein said determining plane information utilizes a best fit model over a bounded neighborhood of said data points.

9. The method as recited in claim 8 , wherein said bounded neighborhood utilizes a five by five grid of said data points.

10. The method as recited in claim 8 , wherein said bounded neighborhood utilizes a fixed grid of said data points.

11. The method as recited in claim 8 , wherein said bounded neighborhood utilizes a depth parameter to remove some of said data points from said determining plane information.

12. A point cloud data analysis system to compute geometric space parameters for a vehicle, comprising:

a receiver, operable to receive point cloud data of a three dimensional (3D) point representation of at least part of a geometric space surrounding a vehicle; and

a graphics processing unit (GPU) operable to transform said point cloud data to a polar depth map, wherein said polar depth map includes distances between data points of said point cloud data and an initiator for collecting said data points.

13. The system as recited in claim 12 , further comprising:

said initiator, operable to initiate generation of said point cloud data at a periodic interval.

14. The system as recited in claim 13 , wherein said initiator is a LiDAR system.

15. The system as recited in claim 12 , wherein said vehicle is one of an autonomous vehicle and a semi-autonomous vehicle.

16. The system as recited in claim 12 , wherein said geometric space parameters are parameters for at least one of a moving object detection, obstacle detection, freespace detection, and landmark detection.

17. A computer program product having a series of operating instructions stored on a non-transitory computer-readable medium that directs a data processing apparatus, when executed thereby, to perform operations, comprising:

receiving point cloud data, wherein said point cloud data are a three dimensional (3D) point representation of at least part of a geometric space surrounding a vehicle;

transforming said point cloud data to a 3D polar depth map that includes distances between data points of said point cloud data and a sensor for collecting said data points;

determining plane information for said data points of said polar depth map;

performing nearest neighbor analysis for said data points utilizing said plane information and said polar depth map; and

computing geometric space parameters utilizing said nearest neighbor analysis and said polar depth map.

18. The computer program product as recited in claim 17 , further comprising:

storing said plane information and said polar depth map in a two dimensional (2D) depth map, wherein said performing utilizes said stored plane information and said stored polar depth map.

19. The computer program product as recited in claim 17 , further comprising:

utilizing a LiDAR system to generate, at a periodic interval, multiple slices of said point cloud data.

20. The computer program product as recited in claim 19 , wherein said receiving, said transforming, said determining, said performing, and said computing are executed on each of said multiple slices.

21. The computer program product as recited in claim 17 , wherein said geometric space parameters are parameters for at least one of moving object detection, obstacle detection, freespace detection, and landmark detection.

22. The computer program product as recited in claim 17 , wherein said determining plane information utilizes a best fit model over a determined neighborhood of said data points, and said determined neighborhood utilizes a depth parameter to remove some of said data points from said determining plane information.

23. A method of storing three dimensional (3D) sensor ranging information, comprising:

collecting 3D data points employing a detection and ranging sensor; and

storing said collected 3D data points as a 3D polar depth map, wherein said polar depth map includes distances between said 3D data points and said sensor.

24. The method as recited in claim 23 , further comprising:

transforming said 3D data points to said 3D polar depth map, wherein said received 3D data points are not received as said 3D polar depth map; and

determining plane information for data points of said 3D polar depth map and adjusting said 3D polar depth map utilizing said plane information.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 31, 2018
From: KULKARNI, ISHWAR; EDEN, IBRAHIM; KROEPFL, MICHAEL; NISTER, DAVID
To: NVIDIA CORPORATION
Reel/Frame 046517/0784 →
Continuity (2)
Provisional Application 62636117 · Feb 27, 2018
Related Publication 20190266779A1 · Aug 29, 2019