The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Fast and Robust Iterative Closest Point
Open accessAbstract
The iterative closest point (ICP) algorithm and its variants are a fundamental technique for rigid registration between two point sets, with wide applications in different areas from robotics to 3D reconstruction. The main drawbacks for ICP are its slow convergence, as well as its sensitivity to outliers, missing data, and partial overlaps. Recent work such as Sparse ICP achieves robustness via sparsity optimization at the cost of computational speed. In this paper, we propose a new method for robust registration with fast convergence. First, we show that the classical point-to-point ICP can be treated as a majorization-minimization (MM) algorithm, and propose an Anderson acceleration approach to speed up its convergence. In addition, we introduce a robust error metric based on the Welsch's function, which is minimized efficiently using the MM algorithm with Anderson acceleration. On challenging datasets with noises and partial overlaps, we achieve similar or better accuracy than Sparse ICP while being at least an order of magnitude faster. Finally, we extend the robust formulation to point-to-plane ICP, and solve the resulting problem using a similar Anderson-accelerated MM strategy. Our robust ICP methods improve the registration accuracy on benchmark datasets while being competitive in computational time.
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
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
A Mathematical Introduction to Robotic Manipulation
Murray, R. M., Li, Z., & Sastry, S. S. (2017) · CRC Press eBooks · doi:10.1201/9781315136370 · Cited by 6,694
A benchmark for the evaluation of RGB-D SLAM systems
Sturm, J., Engelhard, N., Endres, F., Burgard, W., & Cremers, D. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385773 · Cited by 3,976
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 · cited 4×
“One popular approach is to disregard erroneous correspondence between points, using heuristics based on their distance or the angle between their normals [5].”
BackgroundInfluentialFast Point Feature Histograms (FPFH) for 3D registration
Rusu, R. B., Blodow, N., & Beetz, M. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152473 · Cited by 3,878
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
Point Set Registration: Coherent Point Drift
Myronenko, A., & Song, X. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.46 · Cited by 2,762
A Mathmematical Introduction to Robotic Manipulation
Murray, R. M., Li, Z., & Sastry, S. (1994) · Cited by 2,676
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
Robust regression using iteratively reweighted least-squares.
Holland, P. W., & Welsch, R. E. (1977) · Communications in Statistics - Theory and Methods · doi:10.1080/03610927708827533 · Cited by 2,115
Functions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
Lie Groups, Lie Algebras, and Their Representations
Varadarajan, V. S. (1984) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-1126-6 · Cited by 1,739
Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
Wang, Y., Yin, W., & Zeng, J. (2019) · Journal of Scientific Computing · doi:10.1007/s10915-018-0757-z · Cited by 1,268
Iteratively reweighted algorithms for compressive sensing
Chartrand, R., & Yin, W. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518498 · Cited by 1,248
Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration
Yang, J., Li, H., Campbell, D., & Jia, Y. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2513405 · Cited by 1,170
3DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructions
Zeng, A., Song, S., Niessner, M., Fisher, M., Xiao, J., & Funkhouser, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.29 · Cited by 1,128
Deep Closest Point: Learning Representations for Point Cloud Registration
Wang, Y., & Solomon, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00362 · Cited by 1,112
Zhou, Q.-Y., Park, J., & Koltun, V. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46475-6_47 · Cited by 1,028
Iterative Procedures for Nonlinear Integral Equations
Anderson, D. G. (1965) · Journal of the ACM · doi:10.1145/321296.321305 · Cited by 979
Robust Point Set Registration Using Gaussian Mixture Models
Jian, B., & Vemuri, B. C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.223 · Cited by 975
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
TEASER: Fast and Certifiable Point Cloud Registration
Yang, H., Shi, J., & Carlone, L. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3033695 · Cited by 895
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
Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid
Tam, G. K. L., Cheng, Z.-Q., Lai, Y.-K., Langbein, F. C., Liu, Y., Marshall, D., Martin, R. R., Sun, X.-F., & Rosin, P. L. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.310 · Cited by 679
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
Super 4PCS Fast Global Pointcloud Registration via Smart Indexing
Mellado, N., Aiger, D., & Mitra, N. J. (2014) · Computer Graphics Forum · doi:10.1111/cgf.12446 · Cited by 624
Anderson Acceleration for Fixed-Point Iterations
Walker, H. F., & Ni, P. (2011) · SIAM Journal on Numerical Analysis · doi:10.1137/10078356x · Cited by 590
Choy, C., Dong, W., & Koltun, V. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00259 · Cited by 548
Sparse Iterative Closest Point
Bouaziz, S., Tagliasacchi, A., & Pauly, M. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12178 · Cited by 534
Gelfand, N., Mitra, N. J., Guibas, L., & Pottmann, H. (2005) · doi:10.2312/sgp/sgp05/197-206 · Cited by 514
Robust Euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm
Chetverikov, D., Николаевич, С. Д., & Kršek, P. (2005) · Image and Vision Computing · doi:10.1016/j.imavis.2004.05.007 · Cited by 507
Estimating surface normals in noisy point cloud data
Mitra, N. J., & Nguyen, A. (2003) · Proceedings of the nineteenth annual symposium on Computational geometry · doi:10.1145/777792.777840 · Cited by 413
A Comparative Study on Methods for Convergence Acceleration of Iterative Vector Sequences
Eyert, V. (1996) · Journal of Computational Physics · doi:10.1006/jcph.1996.0059 · Cited by 376
Two classes of multisecant methods for nonlinear acceleration
Fang, H., & Saad, Y. (2009) · Numerical Linear Algebra with Applications · doi:10.1002/nla.617 · Cited by 309
4-points congruent sets for robust pairwise surface registration
Aiger, D., Mitra, N. J., & Cohen-Or, D. (2008) · ACM SIGGRAPH 2008 papers · doi:10.1145/1399504.1360684 · Cited by 285
Challenging data sets for point cloud registration algorithms
Pomerleau, F., Liu, M., Colas, F., & Siegwart, R. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912458814 · Cited by 263
Registration of point cloud data from a geometric optimization perspective
Mitra, N. J., Gelfand, N., Pottmann, H., & Guibas, L. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057435 · Cited by 262
A Robust Method for Registration and Segmentation of Multiple Range Images
Masuda, T., & Yokoya, N. (1995) · Computer Vision and Image Understanding · doi:10.1006/cviu.1995.1024 · Cited by 250
Robust guided image filtering using Nonconvex potentials
Ham, B., Cho, M., & Ponce, J. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2669034 · Cited by 219
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
Pottmann, H., Huang, Q.-X., Yang, Y.-L., & Hu, S.-M. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-5167-2 · Cited by 218
On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
Ochs, P., Dosovitskiy, A., Brox, T., & Pock, T. (2015) · SIAM Journal on Imaging Sciences · doi:10.1137/140971518 · Cited by 207
Convergence Analysis for Anderson Acceleration
Toth, A., & Kelley, C. T. (2015) · SIAM Journal on Numerical Analysis · doi:10.1137/130919398 · Cited by 203
The 3D-3D Registration Problem Revisited
Li, H., & Hartley, R. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4409077 · Cited by 191
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
A symmetric objective function for ICP
Rusinkiewicz, S. (2019) · ACM Transactions on Graphics · doi:10.1145/3306346.3323037 · Cited by 178
Pottmann, H., Leopoldseder, S., & Hofer, M. (2004) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2004.04.002 · Cited by 163
Branch-and-Bound Methods for Euclidean Registration Problems
Olsson, C., Kahl, F., & Oskarsson, M. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.131 · Cited by 161
Robust Registration of 2D and 3D Point Sets
Fitzgibbon, A. W. (2001) · British Machine Vision Conference (BMVC) · doi:10.5244/c.15.43 · Cited by 157
AA-ICP: Iterative Closest Point with Anderson Acceleration
Pavlov, A. L., Ovchinnikov, G. V., Derbyshev, D. Y., Tsetserukou, D., & Oseledets, I. V. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8461063 · Cited by 153
COMPUTING EXPONENTIALS OF SKEW-SYMMETRIC MATRICES AND LOGARITHMS OF ORTHOGONAL MATRICES
Gallier, J. H., & Xu, D. (2002) · Cited by 103
Anderson Accelerated Douglas--Rachford Splitting
Fu, A., Zhang, J., & Boyd, S. (2020) · SIAM Journal on Scientific Computing · doi:10.1137/19m1290097 · Cited by 91
Self-citationGeneralization of Euler Angles to N -Dimensional Orthogonal Matrices
Hoffman, D. K., Raffenetti, R. C., & Ruedenberg, K. (1972) · Journal of Mathematical Physics · doi:10.1063/1.1666011 · Cited by 69
Static/Dynamic Filtering for Mesh Geometry
Zhang, J., Deng, B., Yang, H. C., et al. (2018) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2816926 · Cited by 68
Self-citationAccelerating ADMM for efficient simulation and optimization
Zhang, J., Peng, Y., Ouyang, W., & Deng, B. (2019) · ACM Transactions on Graphics · doi:10.1145/3355089.3356491 · Cited by 68
Self-citationRobot arm pose estimation through pixel-wise part classification
Bohg, J., Romero, J., Herzog, A., & Schaal, S. (2014) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2014.6907311 · Cited by 66
Modern techniques and applications for real-time non-rigid registration
Bouaziz, S., Tagliasacchi, A., Li, H., & Pauly, M. V. (2016) · SIGGRAPH Asia Courses · doi:10.1145/2988458.2988490 · Cited by 42
Metadata
- Authors
- Zhang, J., Yao, Y., & Deng, B.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2021
- Volume
- 44
- Issue
- 7
- Pages
- 1-1
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W3042567147
- Cited by
- 343
- References
- 56
- FWCI
- 29.58
- Type
- journal article
- Language
- en
- Open access
- green
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.