2016
DOI: 10.1109/lgrs.2016.2614749
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Planar Feature Fitting Method Using Point Cloud Simplification and Threshold-Independent BaySAC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
10

Relationship

1
9

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…Borges et al [176] also segmented points into planes and then calculated the intersection lines between adjacent planes. Ni et al [170] and Kang et al [177] projected 3-D points onto a plane and then identified edge points based on the distribution of the projected points such as the pattern of angular gaps [177]. A region-growing method can connect edge points using point orientations estimated by RANSAC to constrain the growth.…”
Section: ) Segment-based Methods: Fold Edges In 3-d Point Cloudsmentioning
confidence: 99%
“…Borges et al [176] also segmented points into planes and then calculated the intersection lines between adjacent planes. Ni et al [170] and Kang et al [177] projected 3-D points onto a plane and then identified edge points based on the distribution of the projected points such as the pattern of angular gaps [177]. A region-growing method can connect edge points using point orientations estimated by RANSAC to constrain the growth.…”
Section: ) Segment-based Methods: Fold Edges In 3-d Point Cloudsmentioning
confidence: 99%
“…Unlike distance-based rules, statistical rules were used to refine the clusters base on expectation maximization algorithm, where the objective function is log-likelihood measuring how well the probabilistic subset fits the point cloud dataset [23], [24]. Another widely accepted rule is the local feature, which was estimated and clustered based on curvatures [25], [26], vertices and boundaries [27], [28], angle parameters [29], eigenvalues [30], natural quadric shapes [31], dual quadric metric [32], graph [33], and thresholdindependent Bayesian sampling consensus [34]. A recent work in [33] realized a uniform resampling while preserving the local features through normalized Laplacian and a k-nearest-neighbor graph.…”
Section: Fig1 Application Framework Of Automatic Assembly Line Basedmentioning
confidence: 99%
“…If the point set belongs to pole in non-empty voxels, it has a cylindrical feature when the density of point clouds is high. The RANSAC algorithm is used to detect cylinder from point set [41][42][43]. Figure 7 shows the result of cylinder detection, and the black ring is the top view of the detected cylindrical feature.…”
Section: Extraction Of Pole-like Objectmentioning
confidence: 99%