Evaluation of the ICP Algorithm in 3D Point Cloud Registration
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The iterative closest point (ICP) algorithm is widely used in three-dimensional (3D) point cloud registration, and it is very stable and robust. However, its biggest drawback is being easily trapped in a local optimal solution, which results in the incorrect registration result. Currently, there is neither a clear effective range to define whether the ICP algorithm will fall into a local optimum nor a study providing a comprehensive evaluation of the ICP algorithm. In this paper, we take the overlap ratio, angle, distance, and noise as the influencing factors of ICP and evaluate the validity, robustness, accuracy, and efficiency of point-to-point and point-to-plane ICP by using four datasets. We first analyze the effective ranges of the two ICP algorithms with respect to overlap ratio, angle, and distance and then propose a universal effective range for the three factors. Next, the effect of Gaussian noise on the validity and accuracy of two ICPs is evaluated. We also analyze the factors influencing ICP accuracy and explain their changing rules. We finally study the effect of different parameters on the efficiency. All results are compared by using point-to-point and point-to-plane ICP algorithms. The results show that the overlap ratio has no effect on validity, but it has a significant influence on accuracy. The angle has a great impact on the validity and efficiency of ICP but has no effect on accuracy. The distance only affects validity, has a limited effect on efficiency and no effect on accuracy. Meanwhile, Gaussian noise has a little effect on the validity. In addition, the general effective range of point-to-point ICP is larger than that of point-to-plane ICP, but the point-to-plane ICP algorithm presents a better efficiency. The point-to-point ICP is more robust to Gaussian noise with respect to validity, while the point-to-plane is more resistant in terms of accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Unique Signatures of Histograms for Local Surface Description
Tombari, F., Salti, S., & Di Stefano, L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15558-1_26 · Cited by 1,480
Object modeling by registration of multiple range images
Chen, Y., & Medioni, G. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.132043 · Cited by 1,409 · cited 1×
“The current methods mainly include judgment criteria based on point-to-line [13] and point-to-plane [14] and adding feature information of the points to the criteria [15].”
MethodSemantic 3D Object Maps for Everyday Manipulation in Human Living Environments
Rusu, R. B. (2010) · KI - Künstliche Intelligenz · doi:10.1007/s13218-010-0059-6 · Cited by 938
4-points congruent sets for robust pairwise surface registration
Aiger, D., Mitra, N. J., & Cohen-Or, D. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360684 · Cited by 677
Chen, C.-S., Hung, Y.-P., & Cheng, J.-B. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.809117 · Cited by 356 · cited 1×
“The existing methods are RANdom SAmpling Consistency (RANSAC) [34], robust global registration [35], Greedy Initial Alignment (GIA) [30], 4-Point Coplanar (4PCS) [36], Four Initial Point Pairs (FIPP) [37], Evolutionary Calculation [38], etc. Global registration is currently the best way to solve…”
Method
Metadata
- Authors
- Li, P., Wang, R., Wang, Y., & Tao, W.
- Venue
- IEEE Access
- Published
- 2020
- Volume
- 8
- Pages
- 68030-68048
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3016217770
- Cited by
- 215
- References
- 5
- FWCI
- 13.33
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.