The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Sparse Iterative Closest Point
Open accessAbstract
Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface reconstruction, and shape matching. Most commonly, variants of the Iterative Closest Point (ICP) algorithm are employed for this task. These methods alternate between closest point computations to establish correspondences between two data sets, and solving for the optimal transformation that brings these correspondences into alignment. A major difficulty for this approach is the sensitivity to outliers and missing data often observed in 3D scans. Most practical implementations of the ICP algorithm address this issue with a number of heuristics to prune or reweight correspondences. However, these heuristics can be unreliable and difficult to tune, which often requires substantial manual assistance. We propose a new formulation of the ICP algorithm that avoids these difficulties by formulating the registration optimization using sparsity inducing norms. Our new algorithm retains the simple structure of the ICP algorithm, while achieving superior registration results when dealing with outliers and incomplete data. The complete source code of our implementation is provided at http://lgg.epfl.ch/sparseicp.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
(2006) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-0-387-40065-5 · Cited by 9,008
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
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
A new point matching algorithm for non-rigid registration
Chui, H., & Rangarajan, A. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00009-2 · Cited by 1,560
Segal, A., Haehnel, D., & Thrun, S. (2009) · Robotics: Science and Systems V · doi:10.15607/rss.2009.v.021 · Cited by 1,526
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
Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
Eldar, Y. C., Kuppinger, P., & Bolcskei, H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2044837 · Cited by 1,313
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
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
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
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
Optimization with Sparsity-Inducing Penalties
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2025) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000015 · Cited by 730
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
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
A Survey on Shape Correspondence
van Kaick, O., Zhang, H., Hamarneh, G., & Cohen‐Or, D. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01884.x · Cited by 606
Multiview registration for large data sets
Pulli, K. (2003) · Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062) · doi:10.1109/im.1999.805346 · Cited by 559
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
Realtime performance-based facial animation
Weise, T., Bouaziz, S., Li, H., & Pauly, M. (2011) · ACM SIGGRAPH 2011 papers · doi:10.1145/1964921.1964972 · Cited by 460
Self-citationMulti-scale EM-ICP: A Fast and Robust Approach for Surface Registration
Granger, S., & Pennec, X. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47979-1_28 · Cited by 444
A Correlation-Based Approach to Robust Point Set Registration
Tsin, Y., & Kanade, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_44 · Cited by 416
Global Correspondence Optimization for Non‐Rigid Registration of Depth Scans
Li, H., Sumner, R. W., & Pauly, M. (2008) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2008.01282.x · Cited by 399
Self-citationFree-form surface inspection techniques state of the art review
Li, Y., & Gu, P. (2004) · Computer-Aided Design · doi:10.1016/j.cad.2004.02.009 · Cited by 371
Realtime performance-based facial animation
Weise, T., Bouaziz, S., Li, H., & Pauly, M. (2011) · ACM Transactions on Graphics · doi:10.1145/2010324.1964972 · Cited by 356
Self-citationRegistration 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
Example-Based 3D Scan Completion
Pauly, M., Mitra, N. J., Giesen, J., Groß, M. H., & Guibas, L. (2005) · doi:10.2312/sgp/sgp05/023-032 · Cited by 233
Self-citationGeometry 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 $l_q$ Optimization and Matrix Completion
Marjanovic, G., & Solo, V. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2212015 · Cited by 194
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
Pottmann, H., Leopoldseder, S., & Hofer, M. (2004) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2004.04.002 · Cited by 163
A nonconvex ADMM algorithm for group sparsity with sparse groups
Chartrand, R., & Wohlberg, B. E. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638818 · Cited by 139
Geometry of the Squared Distance Function to Curves and Surfaces
Pottmann, H., & Höfer, M. (2003) · Mathematics and visualization · doi:10.1007/978-3-662-05105-4_12 · Cited by 118
From accurate range imaging sensor calibration to accurate model-based 3D object localization
Champleboux, G., Lavallée, S., Szeliski, R., et al. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1992.223223 · Cited by 105
Flöry, S., & Höfer, M. (2009) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2009.09.001 · Cited by 46
Mirza, M. J., & Boyer, K. L. (1993) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.210797 · Cited by 43
Cited by
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
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
PointNetLK: Robust & Efficient Point Cloud Registration Using PointNet
Aoki, Y., Goforth, H., Srivatsan, R. A., & Lucey, S. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00733 · Cited by 896
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
Metadata
- Authors
- Bouaziz, S., Tagliasacchi, A., & Pauly, M.
- Venue
- Computer Graphics Forum
- Publisher
- Wiley
- Published
- 2013-08
- Volume
- 32
- Issue
- 5
- Pages
- 113-123
- ISSN
- 0167-7055 (ISSN-L)
- 1467-8659
- OpenAlex
- W2107528150
- Cited by
- 534
- References
- 46
- FWCI
- 25.79
- 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.