2014
DOI: 10.1016/j.isprsjprs.2014.04.022
|View full text |Cite
|
Sign up to set email alerts
|

A global optimization approach to roof segmentation from airborne lidar point clouds

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
53
0
1

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 80 publications
(57 citation statements)
references
References 28 publications
0
53
0
1
Order By: Relevance
“…Modeling buildings has been performed by scholars adopting various processing methods that can be classified into two fundamental categories: data-driven and model-driven methods [13]. Data-driven methods utilize a LiDAR point cloud dataset for a primary data source, which utilizes several segmentation algorithms, such as region growing (RG) [14], the 3D Hough transform [15], feature clustering [16], model fitting [17] and random sample consensus (RANSAC) [18,19]. Polyhedral building models are generated from the planar segmented patches through intersection and step-edge generation and are then regulated by certain construction rules to improve the shape.…”
Section: Introductionmentioning
confidence: 99%
“…Modeling buildings has been performed by scholars adopting various processing methods that can be classified into two fundamental categories: data-driven and model-driven methods [13]. Data-driven methods utilize a LiDAR point cloud dataset for a primary data source, which utilizes several segmentation algorithms, such as region growing (RG) [14], the 3D Hough transform [15], feature clustering [16], model fitting [17] and random sample consensus (RANSAC) [18,19]. Polyhedral building models are generated from the planar segmented patches through intersection and step-edge generation and are then regulated by certain construction rules to improve the shape.…”
Section: Introductionmentioning
confidence: 99%
“…The computation of the normal vectors becomes unstable when noise points exist or the supporting points are not properly selected. In addition, these methods may lead to over-segmentation or under-segmentation in the surface intersection region and noisy areas [38].…”
Section: Introductionmentioning
confidence: 99%
“…The segmentation can be modeled as an optimization problem to determine the best graph cut [39][40][41]. The frequently used graph cut algorithms are minimum spanning tree [42], normalized cut [43,44] and Graphcuts [38]. Other optimization methods, such as level set, are also utilized to segment planes [45].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations