2020
DOI: 10.3390/s20236999
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical Optimization of 3D Point Cloud Registration

Abstract: Rigid registration of 3D point clouds is the key technology in robotics and computer vision. Most commonly, the iterative closest point (ICP) and its variants are employed for this task. These methods assume that the closest point is the corresponding point and lead to sensitivity to the outlier and initial pose, while they have poor computational efficiency due to the closest point computation. Most implementations of the ICP algorithm attempt to deal with this issue by modifying correspondence or adding coar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 76 publications
0
5
0
Order By: Relevance
“…To validate the superior performance of the MSCS-ICP approach proposed herein, this section juxtaposes it against a variety of point cloud registration techniques. These include the multi-scale point cloud registration based on topological structure [13], MVG-ICP [12], LCP-4PCS [14], KSS-ICP [10], LPPF-ICP [11], and the method detailed in this study.…”
Section: Experimental Evaluation Of Stitching Accuracy For Standard S...mentioning
confidence: 99%
See 1 more Smart Citation
“…To validate the superior performance of the MSCS-ICP approach proposed herein, this section juxtaposes it against a variety of point cloud registration techniques. These include the multi-scale point cloud registration based on topological structure [13], MVG-ICP [12], LCP-4PCS [14], KSS-ICP [10], LPPF-ICP [11], and the method detailed in this study.…”
Section: Experimental Evaluation Of Stitching Accuracy For Standard S...mentioning
confidence: 99%
“…Yue et al [11] proposed a coarse-fine point cloud registration approach based on fast robust local point-pair features with ICP (LPPF-ICP), but due to the large amount of calculation for the point cloud, the matching time was long. Liu et al [12] proposed a hierarchical optimization method for 3D point cloud registration based on improved voxel filtering and multi-scale voxelized generalized-ICP (MVG-ICP), which successfully realized outlier filtering and down-sampling. However, the application of large translation disturbances and low overlap scene data to this method is not satisfactory.…”
Section: Introductionmentioning
confidence: 99%
“…VGICP [20] estimates the voxel distribution by the distribution of each point in the aggregated voxels with the help of the GICP model. MVGICP [21] uses multiscale iteration to avoid the problem of improper voxel meshing in VGICP. Wang et al [22] proposed the FasterGICP algorithm to further improve the registration efficiency by designing a two-step point filter on top of the accept-reject sampling.…”
Section: Point Cloud Registrationmentioning
confidence: 99%
“…In addition, all points are involved in calculating the transformation matrix and, as such, calculation errors increase when local noise is too large or outliers are included [26]. Therefore, point clouds must be filtered before this registration process, and it has high requirements for filtering [27][28][29].…”
Section: Introductionmentioning
confidence: 99%