The DOI matches its Crossref record; 105 of the 105 references it cites were found in a registry or an index.
TEASER: Fast and Certifiable Point Cloud Registration
Open accessAbstract
We propose the first fast and certifiable algorithm for the registration of two sets of three-dimensional (3-D) points in the presence of large amounts of outlier correspondences. Acertifiable algorithmis one that attempts to solve an intractable optimization problem (e.g., robust estimation with outliers) and provides readily checkable conditions to verify if the returned solution is optimal (e.g., if the algorithm produced the most accurate estimate in the face of outliers) or bound its suboptimality or accuracy. Toward this goal, we first reformulate the registration problem using atruncated least squares(TLS) cost that makes the estimation insensitive to a large fraction of spurious correspondences. Then, we provide a general graph-theoretic framework to decouple scale, rotation, and translation estimation, which allows solving in cascade for the three transformations. Despite the fact that each subproblem (scale, rotation, and translation estimation) is still nonconvex and combinatorial in nature, we show that 1) TLS scale and (component-wise) translation estimation can be solved in polynomial time via anadaptive votingscheme, 2) TLS rotation estimation can be relaxed to a semidefinite program (SDP) and the relaxation is tight, even in the presence of extreme outlier rates, and 3) the graph-theoretic framework allows drastic pruning of outliers by finding the maximum clique. We name the resulting algorithm TEASER (Truncated least squares Estimation And SEmidefinite Relaxation). While solving large SDP relaxations is typically slow, we develop a second fast and certifiable algorithm, named TEASER++, that usesgraduated nonconvexityto solve the rotation subproblem and leveragesDouglas-Rachford Splittingto efficiently certify global optimality. For both algorithms, we provide theoretical bounds on the estimation errors, which are the first of their kind for robust registration problems. Moreover, we test their performance on standard benchmarks, object detection datasets, and the3DMatchscan matching dataset, and show that 1) both algorithms dominate the state-of-the-art (e.g., RANSAC, branch-&-bound, heuristics) and are robust to more than$\text{99}\%$outliers when the scale is known, 2) TEASER++ can run in milliseconds and it is currently the fastest robust registration algorithm, and 3) TEASER++ is so robust it can also solve problems without correspondences (e.g., hypothesizing all-to-all correspondences), where it largely outperforms ICP and it is more accurate than Go-ICP while being orders of magnitude faster. We release a fast open-source C++ implementation of TEASER++.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
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
PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation
Charles, R. Q., Su, H., Kaichun, M., & Guibas, L. J. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.16 · Cited by 9,237
ROS: an open-source Robot Operating System
Quigley, M. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · Cited by 8,729
Dynamic Graph CNN for Learning on Point Clouds
Wang, Y., Sun, Y., Liu, Z., Sarma, S. E., Bronstein, M. M., & Solomon, J. M. (2019) · ACM Transactions on Graphics · doi:10.1145/3326362 · Cited by 7,199
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Closed-form solution of absolute orientation using unit quaternions
Horn, B. K. P. (1987) · Journal of the Optical Society of America A · doi:10.1364/josaa.4.000629 · Cited by 4,116
Least-Squares Fitting of Two 3-D Point Sets
Arun, K. S., Huang, T. S., & Blostein, S. D. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767965 · Cited by 3,952 · cited 9×
“In particular, the closed-form solutions from Horn [14] and Arun et al. [15] can be used for (outlier-free) rotation search with isotropic Gaussian noise.”
BackgroundMethodInfluentialFast 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
Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
Self-citationMultiple View Geometry in Computer Vision
(2001) · Kybernetes · doi:10.1108/k.2001.30.9_10.1333.2 · Cited by 3,336
A volumetric method for building complex models from range images
Curless, B., & Levoy, M. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237269 · Cited by 3,124 · cited 6×
“Testing Setup: We use the Bunny point cloud from the Stanford 3-D Scanning Repository [98].”
MethodInfluentialPast, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Self-citationPoint 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
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
A Generalized Solution of the Orthogonal Procrustes Problem
Schönemann, P. H. (1966) · Psychometrika · doi:10.1007/bf02289451 · Cited by 2,040
On Projection Algorithms for Solving Convex Feasibility Problems
Bauschke, H. H., & Borwein, J. M. (1996) · SIAM Review · doi:10.1137/s0036144593251710 · Cited by 1,654
A 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
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
RGB-D mapping: Using Kinect-style depth cameras for dense 3D modeling of indoor environments
Henry, P., Krainin, M., Herbst, E., Ren, X., & Fox, D. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911434148 · Cited by 1,161
Open3D: A Modern Library for 3D Data Processing
Zhou, Q.-Y., Park, J., & Koltun, V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.09847 · Cited by 1,124
A Least Squares Estimate of Satellite Attitude
Wahba, G. (1965) · SIAM Review · doi:10.1137/1007077 · Cited by 1,116
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
Fundamentals of Spacecraft Attitude Determination and Control
Markley, F. L., & Crassidis, J. L. (2014) · doi:10.1007/978-1-4939-0802-8 · Cited by 1,035
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
Model globally, match locally: Efficient and robust 3D object recognition
Drost, B., Ulrich, M., Navab, N., & Ilic, S. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540108 · Cited by 981
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
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
Fully Convolutional Geometric Features
Choy, C., Park, J., & Koltun, V. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00905 · Cited by 759
Black, M. J., & Rangarajan, A. (1996) · International Journal of Computer Vision · doi:10.1007/bf00131148 · Cited by 757
Visual-lidar odometry and mapping: low-drift, robust, and fast
Zhang, J., & Singh, S. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139486 · Cited by 747
Computing a nearest symmetric positive semidefinite matrix
Higham, N. J. (1988) · Linear Algebra and its Applications · doi:10.1016/0024-3795(88)90223-6 · Cited by 698
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
Robust regression methods for computer vision: A review
Meer, P., Mintz, D., Rosenfeld, A., & Kim, D. Y. (1991) · International Journal of Computer Vision · doi:10.1007/bf00127126 · Cited by 638
Gower, J. C., & Dijksterhuis, G. B. (2004) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780198510581.001.0001 · Cited by 594
Robust reconstruction of indoor scenes
Choi, S., Zhou, Q.-Y., & Koltun, V. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299195 · Cited by 555
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
The Perfect Match: 3D Point Cloud Matching With Smoothed Densities
Gojcic, Z., Zhou, C., Wegner, J. D., & Wieser, A. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00569 · Cited by 530
Hartley, R., Trumpf, J., Dai, Y., & Li, H. (2013) · International Journal of Computer Vision · doi:10.1007/s11263-012-0601-0 · Cited by 486
Multi-view self-supervised deep learning for 6D pose estimation in the Amazon Picking Challenge
Zeng, A., Yu, K.-T., Song, S., Suo, D., Walker, E., Rodriguez, A., & Xiao, J. (2017) · 2017 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2017.7989165 · Cited by 457
Multi-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
Registering multiview range data to create 3D computer objects
Blais, G., & Levine, M. D. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400574 · Cited by 421
Performance Evaluation of 3D Keypoint Detectors
Tombari, F., Salti, S., & Stefano, L. D. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-012-0545-4 · Cited by 408
An algorithmic overview of surface registration techniques for medical imaging
Audette, M. A., Ferrie, F. P., & Peters, T. M. (2000) · Medical Image Analysis · doi:10.1016/s1361-8415(00)00014-1 · Cited by 406
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Eppstein, D., Löffler, M., & Strash, D. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17517-6_36 · Cited by 356
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
Yang, H., Antonante, P., Tzoumas, V., & Carlone, L. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2965893 · Cited by 325
Self-citationA review on algorithms for maximum clique problems
Wu, Q., & Hao, J.-K. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.09.064 · Cited by 314
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
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Self-citationScan2CAD: Learning CAD Model Alignment in RGB-D Scans
Avetisyan, A., Dahnert, M., Dai, A., Savva, M., Chang, A. X., & NieBner, M. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00272 · Cited by 231
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
Guaranteed Outlier Removal for Point Cloud Registration with Correspondences
Bustos, A. P., & Chin, T.-J. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2773482 · Cited by 214
Scaramuzza, D. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-011-0441-3 · Cited by 210
Robust Estimators in High Dimensions without the Computational Intractability
Diakonikolas, I., Kamath, G., Kane, D. M., Li, J., Moitra, A., & Stewart, A. (2016) · 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2016.85 · Cited by 200
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
SegICP: Integrated deep semantic segmentation and pose estimation
Wong, J. M., Kee, V., Le, T., Wagner, S., Mariottini, G.-L., Schneider, A. R., Hamilton, L., Chipalkatty, R., Hebert, M. R., Johnson, D. M. S., et al. (2017) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8206470 · Cited by 174
Submodularity beyond submodular energies: Coupling edges in graph cuts
Jegelka, S., & Bilmes, J. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995589 · Cited by 170
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
A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates
Yang, H., & Carlone, L. (2019) · Robotics: Science and Systems · doi:10.15607/rss.2019.xv.003 · Cited by 144
Self-citationTowards Verified Artificial Intelligence
Seshia, S. A., Sadigh, D., & Sastry, S. S. (2016) · arXiv · doi:10.48550/arxiv.1606.08514 · Cited by 142
Maier‐Hein, L., Franz, A. M., dos Santos, T. R., Schmidt, M., Fangerau, M., Meinzer, H.-P., & Fitzpatrick, J. M. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.248 · Cited by 134
Point registration via efficient convex relaxation
Maron, H., Dym, N., Kezurer, I., Kovalsky, S. Z., & Lipman, Y. (2016) · ACM Transactions on Graphics · doi:10.1145/2897824.2925913 · Cited by 130
Label Fusion: A Pipeline for Generating Ground Truth Labels for Real RGBD Data of Cluttered Scenes
Marion, P., Florence, P., Manuelli, L., & Tedrake, R. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8460950 · Cited by 125
Optimal 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
A fast and accurate approximation for planar pose graph optimization
Carlone, L., Aragüés, R., Castellanos, J. A., & Bona, B. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914523689 · Cited by 113
Self-citationCombining Model Checking and Runtime Verification for Safe Robotics
Desai, A., Dreossi, T., & Seshia, S. A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67531-2_11 · Cited by 111
Modeling Perceptual Aliasing in SLAM via Discrete–Continuous Graphical Models
Lajoie, P., Hu, S., Beltrame, G., & Carlone, L. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2894852 · Cited by 108
Self-citationParallel Maximum Clique Algorithms with Applications to Network Analysis
Rossi, R. A., Gleich, D. F., & Gebremedhin, A. H. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/14100018x · Cited by 106
Convex Global 3D Registration with Lagrangian Duality
Briales, J., & González-Jiménez, J. (2017) · 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.2017.595 · Cited by 104
Le, H., Do, T.-T., Hoang, T., & Cheung, N. M. (2019) · 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.2019.00021 · Cited by 104
At all Costs: A Comparison of Robust Cost Functions for Camera Correspondence Outliers
MacTavish, K., & Barfoot, T. D. (2015) · Canadian Conference on Computer and Robot Vision · doi:10.1109/crv.2015.52 · Cited by 103
End-to-End CAD Model Retrieval and 9DoF Alignment in 3D Scans
Avetisyan, A., Dai, A., & Nießner, M. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00264 · Cited by 96
A Quaternion-Based Certifiably Optimal Solution to the Wahba Problem With Outliers
Yang, H., & Carlone, L. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00175 · Cited by 95
Self-citationGlobally 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
A polynomial-time bound for matching and registration with outliers
Olsson, C., Enqvist, O., & Kahl, F. (2008) · 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.2008.4587757 · Cited by 79
Modeling Perceptual Aliasing in SLAM via Discrete–Continuous Graphical ModelsPreprint
Lajoie, P., Hu, S., Beltrame, G., & Carlone, L. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 76
Self-citationGlobally-Optimal Inlier Set Maximisation for Simultaneous Camera Pose and Feature Correspondence
Campbell, D., Petersson, L., Kneip, L., & Li, H. (2017) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.10 · Cited by 75
Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation
Kaneko, S., Kondo, T., & Miyamoto, A. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00050-5 · Cited by 74
Reflection methods for user-friendly submodular optimizationPreprint
Jegelka, S., Bach, F., & Sra, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.4296 · Cited by 72
The Maximum Consensus Problem: Recent Algorithmic Advances
Chin, T.-J., & Suter, D. (2017) · Synthesis lectures on computer vision · doi:10.2200/s00757ed1v01y201702cov011 · Cited by 70
Optimal estimation of three-dimensional rotation and reliability evaluation
Ohta, N., & Kanatani, K. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055666 · Cited by 65
Pattabiraman, B., Patwary, M. M. A., Gebremedhin, A. H., Liao, W., & Choudhary, A. (2015) · Internet Mathematics · doi:10.1080/15427951.2014.986778 · Cited by 58
Robust Fitting in Computer Vision: Easy or Hard?
Chin, T.-J., Cai, Z., & Neumann, F. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01258-8_43 · Cited by 54
3DMatch: Learning the Matching of Local 3D Geometry in Range Scans.Preprint
Zeng, A., Song, S., Nießner, M., Fisher, M., & Xiao, J. (2016) · arXiv (Cornell University) · Cited by 53
Projection Methods in Conic Optimization
Henrion, D., & Malick, J. (2011) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4614-0769-0_20 · Cited by 51
Duality-based verification techniques for 2D SLAM
Carlone, L., & Dellaert, F. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139835 · Cited by 49
Self-citationOutlier-Robust Spatial Perception: Hardness, General-Purpose Algorithms, and Guarantees
Tzoumas, V., Antonante, P., & Carlone, L. (2019) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros40897.2019.8968174 · Cited by 47
Self-citationRobust Fitting in Computer Vision: Easy or Hard?
Chin, T.-J., Cai, Z., & Neumann, F. (2019) · International Journal of Computer Vision · doi:10.1007/s11263-019-01207-y · Cited by 46
Deterministic Approximate Methods for Maximum Consensus Robust Fitting
Le, H., Chin, T.-J., Eriksson, A. P., Do, T.-T., & Suter, D. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2939307 · Cited by 45
A Practical Maximum Clique Algorithm for Matching with Pairwise ConstraintsPreprint
Parra, Á., Chin, T.-J., Neumann, F., Friedrich, T., & Katzmann, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.01534 · Cited by 41
A note on probably certifiably correct algorithms
Bandeira, A. S. (2016) · Comptes Rendus Mathématique · doi:10.1016/j.crma.2015.11.009 · Cited by 38
Consensus Maximization with Linear Matrix Inequality Constraints
Speciale, P., Paudel, D. P., Oswald, M. R., Kroeger, T., Gool, L. V., & Pollefeys, M. (2017) · 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.2017.536 · Cited by 38
Did You Miss the Sign? A False Negative Alarm System for Traffic Sign Detectors
Rahman, Q. M., Sünderhauf, N., & Dayoub, F. (2019) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros40897.2019.8968525 · Cited by 38
Globally Optimal Inlier Set Maximization with Unknown Rotation and Focal Length
Bazin, J., Seo, Y., Hartley, R. I., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10605-2_52 · Cited by 35
Optimal Estimation of Three - Dimensional Rotation and Reliability Evaluation
Ohta, N., & Kanatani, K. (1998) · Cited by 30
Efficient Algorithms for Maximum Consensus Robust Fitting
Wen, F., Ying, R., Gong, Z., & Liu, P. (2019) · IEEE Transactions on Robotics · doi:10.1109/tro.2019.2943061 · Cited by 19
Optimal Relative Pose with Unknown Correspondences
Fredriksson, J., Larsson, V., Olsson, C., et al. (2016) · 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.2016.191 · Cited by 17
A Semidefinite Relaxation-Based Algorithm for Robust Attitude Estimation
Ahmed, S., Kerrigan, E. C., & Jaimoukha, I. M. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2198820 · Cited by 15
Nonparametric Continuous Sensor RegistrationPreprint
Clark, W., Ghaffari, M., & Bloch, A. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.04286 · Cited by 15
Agarwal, S., Shree, V., & Chakravorty, S. (2017) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2017.7989746 · Cited by 14
Minimizing a sum of clipped convex functions
Barratt, S. T., Angeris, G., & Boyd, S. (2020) · Optimization Letters · doi:10.1007/s11590-020-01565-4 · Cited by 11
Cited by
Du, G., Wang, K., Lian, S., & Zhao, K. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09888-5 · Cited by 475
PointDSC: Robust Point Cloud Registration using Deep Spatial Consistency
Bai, X., Luo, Z., Zhou, L., Chen, H., Li, L., Hu, Z., Fu, H., & Tai, C.-L. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01560 · Cited by 366
Fast and Robust Iterative Closest Point
Zhang, J., Yao, Y., & Deng, B. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3054619 · Cited by 343
CT-ICP: Real-time Elastic LiDAR Odometry with Loop Closure
Dellenbach, P., Deschaud, J.-E., Jacquet, B., & Goulette, F. (2022) · 2022 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra46639.2022.9811849 · Cited by 280
GeoTransformer: Fast and Robust Point Cloud Registration With Geometric Transformer
Qin, Z., Yu, H., Wang, C., Guo, Y., Peng, Y., Ilic, S., Hu, D., & Xu, K. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3259038 · Cited by 279
Metadata
- Authors
- Yang, H., Shi, J., & Carlone, L.
- Venue
- IEEE Transactions on Robotics
- Published
- 2021-04
- Volume
- 37
- Issue
- 2
- Pages
- 314-333
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W3111598592
- Cited by
- 895
- References
- 105
- FWCI
- 57.82
- 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.