IP Library › Granted Patent US 10,762,394
Granted Patent B2
US 10,762,394 · App. 16/050,998 · Granted Sep 1, 2020

System and method for 3D blob classification and transmission

Inventors: Jonathan Distler (Ganot, IL); Tzach Ashkenazi (Petach Tikva, IL); Itay Kaufman (Tel-Aviv, IL); Maria Bortman (Ashkelon, IL)
Assignee: INTEL CORPORATION
G06K9/6267G06K9/6223G06T5/40G06T11/20G06T2207/10028G06T2210/12
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,762,394
App. No.
16/050,998
Granted
Sep 1, 2020
Kind
B2
Abstract

Embodiments described herein provide an apparatus comprising a processor to project and accumulate three-dimensional (3D) point data from a blob onto one of a floor plane or a ceiling plane, construct a histogram of the 3D point data, determine a center of mass of the point data from the blob, obtain height data for the 3D point data, and calculate dimensions for a bounding box to surround the blob. Other embodiments may be described and claimed.

Claims (40)

1. A method, comprising:

projecting and accumulating three-dimensional (3D) point data from a blob onto one of a floor plane or a ceiling plane;

constructing a histogram of the 3D point data;

determining a center of mass of the blob from the histogram of the 3D point data using a two-dimensional (2D) distance transform;

obtaining height data for the 3D point data; and

calculating dimensions for a bounding box to surround the blob.

2. The method of claim 1 , further comprising:

encoding the bounding box with coordinates for two opposing corners of the bounding box.

3. The method of claim 1 , further comprising:

implementing a classification algorithm to identify one or more blobs in a point cloud data set.

4. The method of claim 3 , wherein the classification algorithm comprises a K-means classification algorithm.

5. The method of claim 1 , further comprising:

calculating the 2D distance transform for the blob to generate peaks in coordinates for data in the blob; and

surrounding the peaks with a 2D rectangle defined by a diameter of the blob.

6. The method of claim 5 , further comprising:

merging the 2D rectangle with the height data to define the bounding box.

7. A non-transitory machine readable medium storing instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising:

projecting and accumulating three-dimensional (3D) point data from a blob onto one of a floor plane or a ceiling plane;

constructing a histogram of the 3D point data;

determining a center of mass of the blob from the histogram of the 3D point data using a two-dimensional (2D) distance transform;

obtaining height data for the 3D point data; and

calculating dimensions for a bounding box to surround the blob.

8. The non-transitory machine readable medium of claim 7 , the operations additionally comprising:

encoding the bounding box with coordinates for two opposing corners of the bounding box.

9. The non-transitory machine readable medium of claim 7 , the operations additionally comprising:

implementing a classification algorithm to identify one or more blobs in a point cloud data set.

10. The non-transitory machine readable medium of claim 9 , wherein the classification algorithm comprises a K-means classification algorithm.

11. The non-transitory machine readable medium of claim 7 , the operations additionally comprising:

calculating the 2D distance transform for the blob to generate peaks in coordinates for data in the blob; and

surrounding the peaks with a 2D rectangle defined by a diameter of the blob.

12. The non-transitory machine readable medium of claim 11 , the operations additionally comprising:

merging the 2D rectangle with the height data to define the bounding box.

13. An apparatus, comprising:

a processor to project and accumulate three-dimensional (3D) point data from a blob onto one of a floor plane or a ceiling plane, construct a histogram of the 3D point data, determine a center of mass of the blob from the histogram of the 3D point data using a two-dimensional (2D) distance transform, obtain height data for the 3D point data, and calculate dimensions for a bounding box to surround the blob; and

a memory communicatively coupled to the processor.

14. The apparatus of claim 13 , the processor to encode the bounding box with coordinates for two opposing corners of the bounding box.

15. The apparatus of claim 13 , the processor to implement a classification algorithm to identify one or more blobs in a point cloud data set.

16. The apparatus of claim 15 , wherein the classification algorithm comprises a K-means classification algorithm.

17. The apparatus of claim 13 , the processor to calculate the 2D distance transform for the blob to generate peaks in coordinates for data in the blob, and surround the peaks with a 2D rectangle defined by a diameter of the blob.

18. The apparatus of claim 17 , the processor to merge the 2D rectangle with the height data to define the bounding box.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 30, 2018
From: DISTLER, JONATHAN; ASHKENAZI, TZACH; KAUFMAN, ITAY; BORTMAN, MARIA
To: INTEL CORPORATION
Reel/Frame 046759/0225 →
Continuity (1)
Related Publication 20200042834A1 · Feb 6, 2020
Cited By (6)
US 12,219,115 US 12,219,158 US 12,330,057 US 12,425,554 US 12,555,298 US 12,739,410