2016
DOI: 10.5194/isprsannals-iii-3-177-2016
|View full text |Cite
|
Sign up to set email alerts
|

Fast Semantic Segmentation of 3d Point Clouds With Strongly Varying Density

Abstract: ABSTRACT:We describe an effective and efficient method for point-wise semantic classification of 3D point clouds. The method can handle unstructured and inhomogeneous point clouds such as those derived from static terrestrial LiDAR or photogammetric reconstruction; and it is computationally efficient, making it possible to process point clouds with many millions of points in a matter of minutes. The key issue, both to cope with strong variations in point density and to bring down computation time, turns out to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
127
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 174 publications
(127 citation statements)
references
References 22 publications
0
127
0
Order By: Relevance
“…The set of descriptors computed for each point in 3D space is presented in Table 1. For the computation of geometric features, we adapt the method based on eigenanalyses, which is widely applied in the classification literature [32,33]. The spatial coordinates of the neighboring points are used to compute a local 3D structure covariance tensor, whose eigenvalues of λ max ≥ λ med ≥ λ min together with the eigenvector e min serve as a base for the computation of local geometry features.…”
Section: Data Structure Approximation and Feature Extractionmentioning
confidence: 99%
“…The set of descriptors computed for each point in 3D space is presented in Table 1. For the computation of geometric features, we adapt the method based on eigenanalyses, which is widely applied in the classification literature [32,33]. The spatial coordinates of the neighboring points are used to compute a local 3D structure covariance tensor, whose eigenvalues of λ max ≥ λ med ≥ λ min together with the eigenvector e min serve as a base for the computation of local geometry features.…”
Section: Data Structure Approximation and Feature Extractionmentioning
confidence: 99%
“…Several scholars have put effort into road furniture recognition by introducing supervised approaches [18,[30][31][32][33][34][35][36].…”
Section: Introductionmentioning
confidence: 99%
“…Hackel et al [35] described an efficient and effective method for point-wise semantic classification, which can deal with point clouds captured by LiDAR or derived from photogrammetric reconstruction with high-density variations. Instead of computing optimal neighborhoods for each point, they down-sample the entire point cloud to generate a multi-scale pyramid with decreasing point density and compute features for every voxel at every scale level.…”
Section: Introductionmentioning
confidence: 99%
“…The identification of the neighborhood typically employs either the k-nearest-neighborhood (KNN) search [29] or the instance radius search [5]. The former is based on a fixed number of k neighboring points that approximates the density-adaptive search.…”
Section: Region Growing Segmentationmentioning
confidence: 99%