The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
The Trimmed Iterative Closest Point algorithm
Abstract
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm (Besl and McKay, 1992) is presented, called the Trimmed ICP (TrICP). The new algorithm is based on the consistent use of the least trimmed squares (LTS) approach in all phases of the operation. Convergence is proved and an efficient implementation is discussed. TrICP is fast, applicable to overlaps under 50%, robust to erroneous measurements and shape defects, and has easy-to-set parameters. ICP is a special case of TrICP when the overlap parameter is 100%. Results of testing the new algorithm are shown.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Robust Regression and Outlier Detection
Piepel, G. F. (1989) · Technometrics · doi:10.1080/00401706.1989.10488524 · Cited by 6,144
Robust Regression and Outlier Detection
Rousseeuw, P. J., & Leroy, A. M. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/0471725382 · Cited by 5,609
Efficient variants of the ICP algorithm
Rusinkiewicz, S., & Levoy, M. (2002) · Proceedings Third International Conference on 3-D Digital Imaging and Modeling · doi:10.1109/im.2001.924423 · Cited by 3,945
Object modelling by registration of multiple range images
Chen, Y., & Medioni, G. (1992) · Image and Vision Computing · doi:10.1016/0262-8856(92)90066-c · Cited by 3,154
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Iterative point matching for registration of free-form curves and surfaces
Zhang, Z. (1994) · International Journal of Computer Vision · doi:10.1007/bf01427149 · Cited by 2,402
Unmasking Multivariate Outliers and Leverage Points
Rousseeuw, P. J., & van Zomeren, B. C. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10474920 · Cited by 1,508
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
Robust registration of 2D and 3D point sets
Fitzgibbon, A. W. (2003) · Image and Vision Computing · doi:10.1016/j.imavis.2003.09.004 · Cited by 925
Estimating 3-D rigid body transformations: a comparison of four major algorithms
Eggert, D. W., Lorusso, A., & Fisher, R. B. (1997) · Machine Vision and Applications · doi:10.1007/s001380050048 · Cited by 804
Robust motion and correspondence of noisy 3-D point sets with missing data
Trucco, E., Fusiello, A., & Roberto, V. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00055-0 · Cited by 186
Matching of 3-D curves using semi-differential invariants
Pajdla, T., & Gool, L. V. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1995.466913 · Cited by 114
Surface Reconstruction and Display from Range and Color Data
Pulli, K., & Shapiro, L. G. (2000) · Graphical Models · doi:10.1006/gmod.1999.0519 · Cited by 74
Cited by
Comparing ICP variants on real-world data sets: Open-source library and experimental protocol
Pomerleau, F., Colas, F., Siegwart, R., & Magnenat, S. (2013) · Autonomous Robots · doi:10.1007/s10514-013-9327-2 · Cited by 760
A Review of Point Cloud Registration Algorithms for Mobile Robotics
Pomerleau, F., Colas, F., & Siegwart, R. (2015) · Foundations and Trends® in Robotics · doi:10.1561/2300000035 · Cited by 717
An ICP variant using a point-to-line metric
Censi, A. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543181 · Cited by 626
Fingerprint-Based Fuzzy Vault: Implementation and Performance
Nandakumar, K., Jain, A. K., & Pankanti, S. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.908165 · Cited by 553
Go-ICP: Solving 3D Registration Efficiently and Globally Optimally
Yang, J., Li, H., & Jia, Y. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.184 · Cited by 486
Metadata
- Authors
- Chetverikov, D., Svirko, D., Stepanov, D., & Krsek, P.
- Venue
- Object recognition supported by user interaction for service robots
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Volume
- 3
- Pages
- 545-548
- OpenAlex
- W2140711847
- Cited by
- 617
- References
- 15
- FWCI
- 14.37
- Type
- conference paper
- Language
- en
- Open access
- closed
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.