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

Robust 3-D Plane Segmentation From Airborne Point Clouds Based on Quasi-A-Contrario Theory

Abstract: 3D plane segmentation has been and continues to be a challenge in 3D point cloud processing. The current methods typically focus on the planar subsets separation but ignore the requirement of the precise plane fitting. We propose a quasi-acontrario theory-based plane segmentation (QTPS) algorithm, which is capable of dealing with point clouds of severe noise level, low density, and high complexity robustly. The main proposition is that the final plane can be composed of basic planar subsets with high planar ac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 58 publications
0
4
0
Order By: Relevance
“…The proposed approach was implemented with C++ in Windows and carried out on a computer with an Intel Core i9-9900K processor and 64 GB of RAM. In addition, qualitative comparisons are performed between the proposed method and four popular and recent approaches: region-growing (RG), RANSCA, PLINKAGE [53], and QTPS [58]. The region-growing and RANSAC methods are the most popular, widely adopted algorithms for point cloud segmentation.…”
Section: Experiments and Discussionmentioning
confidence: 99%
“…The proposed approach was implemented with C++ in Windows and carried out on a computer with an Intel Core i9-9900K processor and 64 GB of RAM. In addition, qualitative comparisons are performed between the proposed method and four popular and recent approaches: region-growing (RG), RANSCA, PLINKAGE [53], and QTPS [58]. The region-growing and RANSAC methods are the most popular, widely adopted algorithms for point cloud segmentation.…”
Section: Experiments and Discussionmentioning
confidence: 99%
“…In contrast to that, plane segmentation for 3D points is less constrained by the adjacency relationship so is able to detect complete planar structures better. A novel plane segmentation method (QTPS), which was introduced in our previous paper and proved to be efficient and robust (Zhu et al, 2021), is employed in this part to partition mesh vertices into planes. For each segmented vertex subset, we collect the 1‐ring neighbour faces of each inlier vertex to construct the plane‐support region.…”
Section: Methodsmentioning
confidence: 99%
“…Xu et al proposed an optimal-vector field based method for LiDAR point cloud data [33], in which a local phase formulated a new optimal-vector field to detect plane intersections, and a global phase smoothed local segmentation cues to mimic leading eigenvector computation in the graph-cut. Zhu et al proposed a quasi-acontrario theory-based plane segmentation algorithm, which was capable of dealing with point clouds of severe noise level, low density, and high complexity robustly [34].…”
Section: E Hybrid Methodsmentioning
confidence: 99%