2020
DOI: 10.1109/jstars.2019.2951293
|View full text |Cite
|
Sign up to set email alerts
|

Classification of LiDAR Point Clouds Using Supervoxel-Based Detrended Feature and Perception-Weighted Graphical Model

Abstract: Interpretation of 3-D scene through LiDAR point clouds has been a hot research topic for decades. To utilize measured points in the scene, assigning unique tags to the points of the scene with labels linking to individual objects plays a crucial role in the analysis process. In this article, we present a supervised classification approach for the semantic labeling of laser scanning points. A novel method for extracting geometric features is proposed, removing redundant and insignificant information in the loca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
10

Relationship

1
9

Authors

Journals

citations
Cited by 29 publications
(27 citation statements)
references
References 53 publications
0
27
0
Order By: Relevance
“…Our proposed method for boundary refined supervoxel generation consist the detection of boundary points, and the refinement of boundary points. Firstly, based on the generated VCCS supervoxel, points within each supervoxel were defined by the distance from the point to the supervoxel center considering the local curvature exploring the spatial proximity of adjacent supervoxels in geodetic space [ 31 ]. If the distance was larger than a given threshold, which was empirically set to be one-half of the seed supervoxel resolution, the point was regarded as a boundary point.…”
Section: Methodsmentioning
confidence: 99%
“…Our proposed method for boundary refined supervoxel generation consist the detection of boundary points, and the refinement of boundary points. Firstly, based on the generated VCCS supervoxel, points within each supervoxel were defined by the distance from the point to the supervoxel center considering the local curvature exploring the spatial proximity of adjacent supervoxels in geodetic space [ 31 ]. If the distance was larger than a given threshold, which was empirically set to be one-half of the seed supervoxel resolution, the point was regarded as a boundary point.…”
Section: Methodsmentioning
confidence: 99%
“…Although accurate minimization is intractable, the minimization problem is easily and appropriately solved by a graph-cut algorithm using the α-expansion [57,58]. With a few graph-cut iterations, we can effectively and quickly find an approximate solution for optimizing multi-label energies.…”
Section: Graph-structured Optimization For Classification Refinementmentioning
confidence: 99%
“…(1) Local features which describe the properties of 3D point clouds within a local neighbor range. Typical local features include surface normal, fast point feature histogram (FPFH) [21], signature of histogram of orientations (SHOT) [22], and covariance matrix and its derivations such as surface curvatures, eigenvalues, linearity, planarity, and scattering [23]. However, these local features only reflect the statistic properties of point clouds and cannot accurately describe the complex geometric structures of 3D objects in real situations.…”
Section: Feature Extraction For 3d Point Cloudsmentioning
confidence: 99%