IP Library Granted Patent US 12,555,244
Granted Patent B2
US 12,555,244 · App. 18/199,267 · Granted Feb 17, 2026

Performing semantic segmentation of 3D data using deep learning

Inventor: Ryan Knuffman (Danvers, IL)
Assignee: Roofr Inc.
G06T7/11G06N3/04G06N3/08G06T2207/10028G06T2207/20081G06T2207/20084
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,555,244
App. No.
18/199,267
Granted
Feb 17, 2026
Kind
B2
Abstract

A computer-implemented method of training a deep artificial neural network includes receiving a three-dimensional point cloud and training the deep artificial neural network by subdividing the three-dimensional point cloud, and updating weights of the deep artificial neural network. A computing system includes a processor; and a memory having stored thereon computer-executable instructions that, when executed by the processor, cause the computing system to receive a three-dimensional point cloud and train the deep artificial neural network by subdividing the three-dimensional point cloud, and updating weights of the deep artificial neural network. In yet another aspect, a non-transitory computer-readable medium includes computer-executable instructions that when executed, cause a computer to receive a three-dimensional point cloud and train the deep artificial neural network by subdividing the three-dimensional point cloud, and updating weights of the deep artificial neural network.

Claims (51)

1 . A computer-implemented method of training a deep artificial neural network to generate a semantically-segmented three-dimensional point cloud, the computer-implemented method comprising:

receiving a three-dimensional point cloud having at least one labeled feature corresponding to an outdoor structure; and

training the deep artificial neural network to output a set of point labels corresponding to an outdoor scene by:

subdividing the three-dimensional point cloud into a plurality of subdivisions, wherein at least one subdivision of the plurality of subdivisions overlaps with another subdivision of the plurality of subdivisions;

pre-processing the plurality of subdivisions by:

determining a corresponding number of samples included in each of the plurality of subdivisions; and

downsampling or upsampling a subdivision of the plurality of subdivisions in response to determining that the corresponding number of samples included in the subdivision does not equal a particular number of samples;

normalizing Z coordinate values such that a ground layer of the outdoor scene is at an origin Z-value; and

processing the at least one labeled feature to update one or more weights of the deep artificial neural network.

2 . The computer-implemented method of claim 1 , wherein pre-processing the plurality of subdivisions further includes:

collapsing a set of points within the plurality of subdivisions onto a unit sphere.

3 . The computer-implemented method of claim 2 , further comprising:

generating a semantically-segmented three-dimensional point cloud by using the trained deep artificial neural network to analyze a three-dimensional point cloud not used for training the deep artificial neural network; and

storing the semantically-segmented three-dimensional point cloud on a computer readable storage medium, wherein the three-dimensional point cloud comprises the set of point labels.

4 . The computer-implemented method of claim 1 , wherein one or more of the point labels is determined using a pairwise distance function.

5 . The computer-implemented method of claim 1 , wherein one or more of the point labels is determined by selecting an arg max of a vector of labels corresponding to the one or more point labels.

6 . The computer-implemented method of claim 1 , wherein each of the plurality of subdivisions is columnar in shape.

7 . The computer-implemented method of claim 1 , wherein the set of point labels includes a type and an elevation.

8 . A computing system for training a deep artificial neural network to generate a semantically-segmented three-dimensional point cloud, the computing system comprising:

one or more processors; and

one or more memories having stored thereon computer-executable instructions that, when executed by the one or more processors, cause the computing system to:

receive a three-dimensional point cloud having at least one labeled feature corresponding to an outdoor structure; and

train the deep artificial neural network to output a set of point labels corresponding to an outdoor scene by:

subdivide the three-dimensional point cloud into a plurality of subdivisions, wherein at least one subdivision of the plurality of subdivisions overlaps with another subdivision of the plurality of subdivisions;

pre-process the plurality of subdivisions by:

determining a corresponding number of samples included in each of the plurality of subdivisions; and

downsampling or upsampling a subdivision of the plurality of subdivisions in response to determining that the corresponding number of samples included in the subdivision does not equal a particular number of samples;

normalize Z coordinate values such that a ground layer of the outdoor scene is at an origin Z-value; and

process the at least one labeled feature to update a set of weights of the deep artificial neural network.

9 . The computing system of claim 8 , wherein to pre-process the plurality of subdivisions, the processor is further configured to:

collapse a set of points within the plurality of subdivisions onto a unit sphere.

10 . The computing system of claim 9 , the one or more memories having stored thereon computer-executable instructions that, when executed by the one or more processors, cause the computing system to:

generate the semantically-segmented three-dimensional point cloud by using the trained deep artificial neural network to process a three-dimensional point cloud not used for training the deep artificial neural network, and

store the semantically-segmented three-dimensional point cloud on the one or more memories, wherein the three-dimensional point cloud comprises the set of point labels.

11 . The computing system of claim 9 , wherein one or more of the point labels is determined using a pairwise distance function.

12 . The computing system of claim 9 , wherein one or more of the point labels is determined by selecting an arg max of a vector of labels corresponding to the one or more point labels.

13 . The computing system of claim 8 , wherein each of the plurality of subdivisions is columnar in shape.

14 . The computing system of claim 8 , wherein the set of point labels includes a type and an elevation.

15 . A non-transitory computer-readable medium having stored thereon computer-executable instructions that when executed by one or more processors, cause a computer to:

receive a three-dimensional point cloud having at least one labeled feature corresponding to an outdoor structure; and

train a deep artificial neural network to output a set of point labels corresponding to an outdoor scene by:

subdivide the three-dimensional point cloud into a plurality of subdivisions, wherein at least one subdivision of the plurality of subdivisions overlaps with another subdivision of the plurality of subdivisions;

normalize Z coordinate values such that a ground layer of the outdoor scene is at an origin Z-value; and

process the at least one labeled feature to update a set of weights of the deep artificial neural network.

16 . The non-transitory computer-readable medium of claim 15 , having stored thereon further instructions that, when executed by the one or more processors, cause the computer to collapse a set of points within the plurality of subdivisions onto a unit sphere.

17 . The non-transitory computer-readable medium of claim 16 , having stored thereon further instructions that, when executed by the one or more processors, cause the computer to:

generate a semantically-segmented three-dimensional point cloud by using the trained deep artificial neural network to analyze a three-dimensional point cloud not used for training the deep artificial neural network; and

store the semantically-segmented three-dimensional point cloud on the computer readable medium, wherein the three-dimensional point cloud comprises the set of point labels.

18 . The non-transitory computer-readable medium of claim 16 , wherein one or more of the point labels is determined using a pairwise distance function.

19 . The non-transitory computer-readable medium of claim 16 , wherein one or more of the point labels is determined by selecting an arg max of a vector of labels corresponding to the one or more point labels.

20 . The non-transitory computer-readable medium of claim 16 , wherein the set of point labels includes a type and an elevation.

Assignments (3)
SECURITY INTEREST Recorded Oct 20, 2025
From: ROOFR INC.
To: STIFEL BANK
Reel/Frame 072598/0354 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 21, 2025
From: STATE FARM MUTUAL AUTOMOBILE INSURANCE CO.
To: ROOFR INC.
Reel/Frame 072083/0039 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 18, 2023
From: KNUFFMAN, RYAN
To: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
Reel/Frame 064633/0569 →
Continuity (3)
Continuation 17031612 · Sep 24, 2020
Provisional Application 62970263 · Feb 5, 2020
Related Publication 20230289974A1 · Sep 14, 2023
References Cited (58)
US 8179393B2 · Minear · 2012 [cited by examiner]
US 10754999B1 · Vratimos · 2020 [cited by examiner]
US 11087494B1 · Srinivasan · 2021 [cited by examiner]
US 11176693B1 · Gonzalez-Nicolas et al. · 2021 [cited by applicant]
US 11205443B2 · Thuillier et al. · 2021 [cited by applicant]
US 11317840B2 · Youn et al. · 2022 [cited by applicant]
US 11370423B2 · Casas et al. · 2022 [cited by applicant]
US 11423614B2 · Pershing · 2022 [cited by examiner]
US 11762390B1 · Alagic · 2023 [cited by examiner]
US 12014433B1 · Pearson · 2024 [cited by examiner]
US 12158518B2 · Unnikrishnan · 2024 [cited by examiner]
US 20040041805A1 · Hayano et al. · 2004 [cited by applicant]
US 20100201682A1 · Quan et al. · 2010 [cited by applicant]
US 20140192050A1 · Qiu · 2014 [cited by examiner]
US 20140212028A1 · Ciarcia · 2014 [cited by applicant]
US 20140218607A1 · Wilkins et al. · 2014 [cited by applicant]
US 20160214255A1 · Uhlenbrock · 2016 [cited by examiner]
US 20170011091A1 · Chehreghani · 2017 [cited by applicant]
US 20170053412A1 · Shen et al. · 2017 [cited by applicant]
US 20170116781A1 · Babahajiani et al. · 2017 [cited by applicant]
US 20170272651A1 · Mathy et al. · 2017 [cited by applicant]
US 20170304732A1 · Velic et al. · 2017 [cited by applicant]
US 20170358087A1 · Armeni et al. · 2017 [cited by applicant]
US 20180247416A1 · Ruda · 2018 [cited by examiner]
US 20190163990A1 · Mei · 2019 [cited by examiner]
US 20190179332A1 · Cheng et al. · 2019 [cited by applicant]
US 20190188337A1 · Keane · 2019 [cited by examiner]
US 20190192880A1 · Hibbard · 2019 [cited by applicant]
US 20190205695A1 · Yan · 2019 [cited by examiner]
US 20190270015A1 · Li · 2019 [cited by examiner]
US 20190279420A1 · Moreno · 2019 [cited by examiner]
US 20190385363A1 · Porter · 2019 [cited by examiner]
US 20190394448A1 · Ziegler · 2019 [cited by examiner]
US 20200043186A1 · Selviah · 2020 [cited by examiner]
US 20200084427A1 · Sun et al. · 2020 [cited by applicant]
US 20200132822A1 · Pimentel · 2020 [cited by examiner]
US 20200134384A1 · Hino · 2020 [cited by examiner]
US 20200184718A1 · Chiu et al. · 2020 [cited by applicant]
US 20200191593A1 · Herman · 2020 [cited by examiner]
US 20200234071A1 · Yuvaraj et al. · 2020 [cited by applicant]
US 20200349246A1 · Budman et al. · 2020 [cited by applicant]
US 20200386862A1 · Cop · 2020 [cited by examiner]
US 20200393562A1 · Staudinger et al. · 2020 [cited by applicant]
US 20210025696A1 · Goto · 2021 [cited by examiner]
US 20210049757A1 · Zhu · 2021 [cited by examiner]
US 20210072391A1 · Li et al. · 2021 [cited by applicant]
US 20210116568A1 · Kanza · 2021 [cited by examiner]
US 20210124901A1 · Liu et al. · 2021 [cited by applicant]
US 20210150078A1 · Ramanath et al. · 2021 [cited by applicant]
US 20210201476A1 · Prasad et al. · 2021 [cited by applicant]
US 20210201578A1 · Chaudhuri · 2021 [cited by examiner]
US 20210289366A1 · Ginis · 2021 [cited by examiner]
US 20220067943A1 · Claessen · 2022 [cited by examiner]
US 20220076802A1 · Bondar et al. · 2022 [cited by applicant]
US 20220284696A1 · Abbeloos · 2022 [cited by examiner]
US 20220392193A1 · Yao · 2022 [cited by examiner]
US 20230040195A1 · Kurata · 2023 [cited by examiner]
US 20230042369A1 · Böckem · 2023 [cited by examiner]