The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Go-ICP: Solving 3D Registration Efficiently and Globally Optimally
Open accessAbstract
Registration is a fundamental task in computer vision. The Iterative Closest Point (ICP) algorithm is one of the widely-used methods for solving the registration problem. Based on local iteration, ICP is however well-known to suffer from local minima. Its performance critically relies on the quality of initialization, and only local optimality is guaranteed. This paper provides the very first globally optimal solution to Euclidean registration of two 3D point sets or two 3D surfaces under the L2 error. Our method is built upon ICP, but combines it with a branch-and-bound (BnB) scheme which searches the 3D motion space SE(3) efficiently. By exploiting the special structure of the underlying geometry, we derive novel upper and lower bounds for the ICP error function. The integration of local ICP and global BnB enables the new method to run efficiently in practice, and its optimality is exactly guaranteed. We also discuss extensions, addressing the issue of outlier robustness.
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
Shape matching and object recognition using shape contexts
Belongie, S., Malik, J., & Puzicha, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.993558 · Cited by 6,306
Comparing images using the Hausdorff distance
Huttenlocher, D. P., Klanderman, G. A., & Rucklidge, W. J. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232073 · Cited by 4,545
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
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
Using spin images for efficient object recognition in cluttered 3D scenes
Johnson, A. E., & Hebert, M. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765655 · Cited by 2,599
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
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 Iterative Closest Point (ICP) [5] [10] [35] is a wellknown algorithm for registering two point sets (in 2D or 3D) under Euclidean transformation.”
BackgroundA large-scale hierarchical multi-view RGB-D object dataset
Lai, K., Bo, L., Ren, X., & Fox, D. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980382 · Cited by 1,316
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
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
The Trimmed Iterative Closest Point algorithm
Chetverikov, D., Svirko, D., Stepanov, D., & Krsek, P. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1047997 · Cited by 617
Gelfand, N., Mitra, N. J., Guibas, L., & Pottmann, H. (2005) · doi:10.2312/sgp/sgp05/197-206 · Cited by 514
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
An Approach to Multimodal Biomedical Image Registration Utilizing Particle Swarm Optimization
Wachowiak, M. P., Smolikova, R., Zheng, Y., Zurada, J. M., & Elmaghraby, A. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826068 · Cited by 389
A robust algorithm for point set registration using mixture of Gaussians
Jian, B., & Vemuri, B. C. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.17 · Cited by 354
Fully Automatic Registration of 3D Point Clouds
Makadia, A., Patterson, A. I., & Daniilidis, K. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.122 · Cited by 306
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
Global Optimization through Rotation Space Search
Hartley, R. I., & Kahl, F. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0186-9 · Cited by 227
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
Self-citationBranch-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
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Li, H. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459398 · Cited by 150
Self-citationOptimal correspondences from pairwise constraints
Enqvist, O., Josephson, K., & Kahl, F. (2009) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459319 · Cited by 116
From accurate range imaging sensor calibration to accurate model-based 3D object localization
Champleboux, G., Lavallée, S., Szeliski, R., & Brunie, L. (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 113
Point Set Registration via Particle Filtering and Stochastic Dynamics
Sandhu, R., Dambreville, S., & Tannenbaum, A. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.142 · Cited by 104
Globally Optimal Consensus Set Maximization through Rotation Search
Bazin, J., Seo, Y., & Pollefeys, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37444-9_42 · Cited by 85
Castellani, U., & Bartoli, A. (2012) · Springer eBooks · doi:10.1007/978-1-4471-4063-4_6 · Cited by 51
Discrete and geometric Branch and Bound algorithms for medical image registration
Pfeuffer, F., Stiglmayr, M., & Klamroth, K. (2010) · Annals of Operations Research · doi:10.1007/s10479-010-0760-8 · Cited by 24
Model-Based Multiple Rigid Object Detection and Registration in Unstructured Range Data
Breitenreicher, D., & Schnörr, C. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-010-0401-3 · Cited by 17
Cited by
cryoSPARC: algorithms for rapid unsupervised cryo-EM structure determination
Punjani, A., Rubinstein, J. L., Fleet, D. J., & Brubaker, M. A. (2017) · Nature Methods · doi:10.1038/nmeth.4169 · Cited by 11,626
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
Self-citationPointNetLK: 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
Registration of large-scale terrestrial laser scanner point clouds: A review and benchmark
Dong, Z., Liang, F., Yang, B., Xu, Y., Zang, Y., Li, J., Wang, Y., Dai, W., Fan, H., Hyyppä, J., et al. (2020) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2020.03.013 · Cited by 438
Opromolla, R., Fasano, G., Rufino, G., & Grassi, M. (2017) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2017.07.001 · Cited by 330
Metadata
- Authors
- Yang, J., Li, H., & Jia, Y.
- Venue
- 2013 IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2013-12
- Pages
- 1457-1464
- OpenAlex
- W2097832352
- Cited by
- 486
- References
- 29
- FWCI
- 35.30
- Type
- conference paper
- 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.