Fetching the paper…
Reading the bibliography…
We propose the first fast and certifiable algorithm for the registration of two sets of 3D points in the presence of large amounts of outlier correspondences.
1903
Earlier work this paper cites.
1903
Earlier work this paper cites.
S. Jegelka and J. Bilmes, “Submodularity beyond submodular energies: Coupling edges in graph cuts,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) . IEEE, 2011, pp. 1897–1904
1904
Earlier work this paper cites.
1905
Earlier work this paper cites.
1909
Earlier work this paper cites.
G. Wahba, “A least squares estimate of satellite attitude,” SIAM review , vol. 7, no. 3, pp. 409–409, 1965
1965
Earlier work this paper cites.
P. Schonemann, “A generalized solution of the orthogonal procrustes problem,” Psychometrika , vol. 31, pp. 1–10, 1966
1966
Earlier work this paper cites.
D. Bertsekas, “Control of uncertain systems with a set-membership description of the uncertainty,” Ph.D. dissertation, Massachusetts Institute of Technology, 1971
1971
Earlier work this paper cites.
C. Bron and J. Kerbosch, “Algorithm 457: finding all cliques of an undirected graph,” Communications of the ACM , vol. 16, no. 9, pp. 575–577, 1973
1973
Earlier work this paper cites.
M. Fischler and R. Bolles, “Random sample consensus: a paradigm for model fitting with application to image analysis and automated cartography,” Commun. ACM , vol. 24, pp. 381–395, 1981
1981
Earlier work this paper cites.
B. K. P. Horn, “Closed-form solution of absolute orientation using unit quaternions,” J. Opt. Soc. Amer. , vol. 4, no. 4, pp. 629–642, Apr 1987
1987
Earlier work this paper cites.
K. Arun, T. Huang, and S. Blostein, “Least-squares fitting of two 3-D point sets,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 9, no. 5, pp. 698–700, sept. 1987
1987
Earlier work this paper cites.
F. L. Markley, “Attitude determination using vector observations and the singular value decomposition,” The Journal of the Astronautical Sciences , vol. 36, no. 3, pp. 245–258, 1988
1988
Earlier work this paper cites.
N. J. Higham, “Computing a nearest symmetric positive semidefinite matrix,” Linear algebra and its applications , vol. 103, pp. 103–118, 1988
1988
Earlier work this paper cites.
M. Milanese, Estimation and Prediction in the Presence of Unknown but Bounded Uncertainty: A Survey . Boston, MA: Springer US, 1989, pp. 3–24
1989
Earlier work this paper cites.
P. Meer, D. Mintz, A. Rosenfeld, and D. Y. Kim, “Robust regression methods for computer vision: A review,” Intl. J. of Computer Vision , vol. 6, no. 1, pp. 59–70, Apr 1991
1991
Earlier work this paper cites.
P. J. Besl and N. D. McKay, “A method for registration of 3-D shapes,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 14, no. 2, 1992
1992
Earlier work this paper cites.
G. Blais and M. D. Levine, “Registering multiview range data to create 3d computer objects,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 17, no. 8, pp. 820–824, 1995
1995
Earlier work this paper cites.
M. J. Black and A. Rangarajan, “On the unification of line processes, outlier rejection, and robust statistics with applications in early vision,” Intl. J. of Computer Vision , vol. 19, no. 1, pp. 57–91, 1996
1996
Earlier work this paper cites.
F. Chung, Spectral Graph Theory . American Mathematical Soc., CBMS Regional Conference Series in Mathematics, No. 92, 1996
1996
Earlier work this paper cites.
B. Curless and M. Levoy, “A volumetric method for building complex models from range images,” in SIGGRAPH , 1996, pp. 303–312
1996
Earlier work this paper cites.
H. H. Bauschke and J. M. Borwein, “On projection algorithms for solving convex feasibility problems,” SIAM review , vol. 38, no. 3, pp. 367–426, 1996
1996
Earlier work this paper cites.
N. Ohta and K. Kanatani, “Optimal estimation of three-dimensional rotation and reliability evaluation,” IEICE TRANSACTIONS on Information and Systems , vol. 81, no. 11, pp. 1247–1252, 1998
1998
Earlier work this paper cites.
M. A. Audette, F. P. Ferrie, and T. M. Peters, “An algorithmic overview of surface registration techniques for medical imaging,” Med. Image Anal. , vol. 4, no. 3, pp. 201–217, 2000
2000
Earlier work this paper cites.
R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision . Cambridge University Press, 2000
2000
Earlier work this paper cites.
S. Granger and X. Pennec, “Multi-scale EM-ICP: A fast and robust approach for surface registration,” in European Conf. on Computer Vision (ECCV) , 2002
2002
Earlier work this paper cites.
S. Kaneko, T. Kondo, and A. Miyamoto, “Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation,” Pattern Recognition , vol. 36, no. 9, pp. 2041–2047, 2003
2003
Earlier work this paper cites.
T. M. Breuel, “Implementation techniques for geometric branch-and-bound matching methods,” Comput. Vis. Image Underst. , vol. 90, no. 3, pp. 258–294, 2003
2003
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge University Press, 2004
2004
Earlier work this paper cites.
J. Gower and G. Dijksterhuis, “Procrustes problems,” Procrustes Problems, Oxford Statistical Science Series , vol. 30, 01 2005
2005
Earlier work this paper cites.
D. Chetverikov, D. Stepanov, and P. Krsek, “Robust euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm,” Image and Vision Computing , vol. 23, no. 3, pp. 299–309, 2005
2005
Earlier work this paper cites.
A. Makadia, A. Patterson, and K. Daniilidis, “Fully automatic registration of 3d point clouds,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , vol. 1, 2006, pp. 1297–1304
2006
Earlier work this paper cites.
H. Li and R. Hartley, “The 3D-3D registration problem revisited,” in Intl. Conf. on Computer Vision (ICCV) . IEEE, 2007, pp. 1–8
2007
Earlier work this paper cites.
C. Olsson, O. Enqvist, and F. Kahl, “A polynomial-time bound for matching and registration with outliers,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) . IEEE, 2008, pp. 1–8
2008
Earlier work this paper cites.
OpenMP Architecture Review Board, “OpenMP application program interface version 3.0,” May 2008. [Online]. Available: http://www.openmp.org/mp-documents/spec30.pdf
2008
Earlier work this paper cites.
R. Rusu, N. Blodow, and M. Beetz, “Fast point feature histograms (fpfh) for 3d registration,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) . Citeseer, 2009, pp. 3212–3217
2009
Earlier work this paper cites.
R. Hartley and F. Kahl, “Global optimization through rotation space search,” Intl. J. of Computer Vision , vol. 82, no. 1, pp. 64–79, 2009
2009
Earlier work this paper cites.
C. Olsson, F. Kahl, and M. Oskarsson, “Branch-and-bound methods for euclidean registration problems,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 31, no. 5, pp. 783–794, 2009
2009
Earlier work this paper cites.
O. Enqvist, K. Josephson, and F. Kahl, “Optimal correspondences from pairwise constraints,” in Intl. Conf. on Computer Vision (ICCV) , 2009, pp. 1295–1302
2009
Earlier work this paper cites.
M. Quigley, K. Conley, B. Gerkey, J. Faust, T. Foote, J. Leibs, R. Wheeler, and A. Y. Ng, “Ros: an open-source robot operating system,” in ICRA workshop on open source software , vol. 3, no. 3.2. Kobe, Japan, 2009, p. 5
2009
Earlier work this paper cites.
B. Drost, M. Ulrich, N. Navab, and S. Ilic, “Model globally, match locally: Efficient and robust 3D object recognition,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2010, pp. 998–1005
2010
Earlier work this paper cites.
A. Myronenko and X. Song, “Point set registration: Coherent point drift,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 32, no. 12, pp. 2262–2275, 2010
2010
Cited alongside, same era.
D. Eppstein, M. Löffler, and D. Strash, “Listing all maximal cliques in sparse graphs in near-optimal time,” in International Symposium on Algorithms and Computation . Springer, 2010, pp. 403–414
2010
Cited alongside, same era.
K. Lai, L. Bo, X. Ren, and D. Fox, “A large-scale hierarchical multi-view RGB-D object dataset,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) . IEEE, 2011, pp. 1817–1824
2011
Cited alongside, same era.
B. Jian and B. C. Vemuri, “Robust point set registration using gaussian mixture models,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 33, no. 8, pp. 1633–1645, 2011
2011
Cited alongside, same era.
A. Desai, T. Dreossi, and S. Seshia, “Combining model checking and runtime verification for safe robotics,” in International Conference on Runtime Verification . Springer, 2017, pp. 172–189
2017
Later among the works it cites.
A. Zeng, S. Song, M. Nießner, M. Fisher, J. Xiao, and T. Funkhouser, “3dmatch: Learning the matching of local 3d geometry in range scans,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , vol. 1, no. 2, 2017, p. 4
2017
Later among the works it cites.
J. Briales and J. Gonzalez-Jimenez, “Convex Global 3D Registration with Lagrangian Duality,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2017
2017
Later among the works it cites.
T. J. Chin and D. Suter, “The maximum consensus problem: recent algorithmic advances,” Synthesis Lectures on Computer Vision , vol. 7, no. 2, pp. 1–194, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
P. L. Combettes and J.-C. Pesquet, “Proximal splitting methods in signal processing,” in Fixed-point algorithms for inverse problems in science and engineering . Springer, 2011, pp. 185–212
2011
Cited alongside, same era.
P. Henry, M. Krainin, E. Herbst, X. Ren, and D. Fox, “Rgb-d mapping: Using kinect-style depth cameras for dense 3d modeling of indoor environments,” Intl. J. of Robotics Research , vol. 31, no. 5, pp. 647–663, 2012
2012
Cited alongside, same era.
S. Ahmed, E. C. Kerrigan, and I. M. Jaimoukha, “A semidefinite relaxation-based algorithm for robust attitude estimation,” IEEE Transactions on Signal Processing , vol. 60, no. 8, pp. 3942–3952, 2012
2012
Cited alongside, same era.
J. C. Bazin, Y. Seo, and M. Pollefeys, “Globally optimal consensus set maximization through rotation search,” in Asian Conference on Computer Vision . Springer, 2012, pp. 539–551
2012
Cited alongside, same era.
O. Enqvist, E. Ask, F. Kahl, and K. Åström, “Robust fitting for multiple view geometry,” in European Conf. on Computer Vision (ECCV) . Springer, 2012, pp. 738–751
2012
Cited alongside, same era.
L. Maier-Hein, A. M. Franz, T. R. dos Santos, M. Schmidt, M. Fangerau, H. P. Meinzer, and J. M. Fitzpatrick, “Convergent iterative closest-point algorithm to accomodate anisotropic and inhomogenous localization error,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 34, no. 8, pp. 1520–1532, 2012
2012
Cited alongside, same era.
S. Perera and N. Barnes, “Maximal cliques based rigid body motion segmentation with a rgb-d camera,” in Asian Conf. on Computer Vision (ACCV) . Springer, 2012, pp. 120–133
2012
Cited alongside, same era.
D. Campbell, L. Petersson, L. Kneip, and H. Li, “Globally-optimal inlier set maximisation for simultaneous camera pose and feature correspondence,” in Intl. Conf. on Computer Vision (ICCV) , 2017, pp. 1–10
2017
Later among the works it cites.
G. Izatt, H. Dai, and R. Tedrake, “Globally optimal object pose estimation in point clouds with mixed-integer programming,” in Proc. of the Intl. Symp. of Robotics Research (ISRR) , 2017
2017
Later among the works it cites.
C. R. Qi, H. Su, K. Mo, and L. J. Guibas, “Pointnet: Deep learning on point sets for 3D classification and segmentation,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2017, pp. 652–660
2017
Later among the works it cites.
S. Agarwal, V. Shree, and S. Chakravorty, “RFM-SLAM: Exploiting relative feature measurements to separate orientation and position estimation in slam,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) . IEEE, 2017, pp. 6307–6314
2017
Later among the works it cites.
M. ApS, The MOSEK optimization toolbox for MATLAB manual. Version 8.1. , 2017. [Online]. Available: http://docs.mosek.com/8.1/toolbox/index.html
2017
Later among the works it cites.
P. Speciale, D. P. Paudel, M. R. Oswald, T. Kroeger, L. V. Gool, and M. Pollefeys, “Consensus maximization with linear matrix inequality constraints,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , July 2017, pp. 5048–5056
2017
Later among the works it cites.
P. Marion, P. R. Florence, L. Manuelli, and R. Tedrake, “Label fusion: A pipeline for generating ground truth labels for real rgbd data of cluttered scenes,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) . IEEE, 2018, pp. 1–8
2018
Later among the works it cites.
Á. Parra Bustos and T. J. Chin, “Guaranteed outlier removal for point cloud registration with correspondences,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 40, no. 12, pp. 2868–2882, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
Y. Liu, C. Wang, Z. Song, and M. Wang, “Efficient global point cloud registration by matching rotation invariant features through translation search,” in European Conf. on Computer Vision (ECCV) , September 2018
2018
Later among the works it cites.
P. Jauer, I. Kuhlemann, R. Bruder, A. Schweikard, and F. Ernst, “Efficient registration of high-resolution feature enhanced point clouds,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 41, no. 5, pp. 1102–1115, 2018
2018
Later among the works it cites.
T.-J. Chin, Z. Cai, and F. Neumann, “Robust fitting in computer vision: Easy or hard?” in European Conf. on Computer Vision (ECCV) , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
Z. Gojcic, C. Zhou, J. D. Wegner, and A. Wieser, “The perfect match: 3d point cloud matching with smoothed densities,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2019, pp. 5545–5554
2019
Later among the works it cites.
H. Yang and L. Carlone, “A polynomial-time solution for robust registration with extreme outlier rates,” in Robotics: Science and Systems (RSS) , 2019, (pdf) , (video) , (media) , (media) , (media)
2019
Later among the works it cites.
C. Choy, J. Park, and V. Koltun, “Fully convolutional geometric features,” in Intl. Conf. on Computer Vision (ICCV) , 2019, pp. 8958–8966
2019
Later among the works it cites.
Y. Cheng and J. L. Crassidis, “A total least-squares estimate for attitude determination,” in AIAA Scitech 2019 Forum , 2019, p. 1176
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
F. Wen, R. Ying, Z. Gong, and P. Liu, “Efficient algorithms for maximum consensus robust fitting,” IEEE Trans. Robotics , 2019
2019
Later among the works it cites.
Z. Cai, T.-J. Chin, and V. Koltun, “Consensus maximization tree search revisited,” in Intl. Conf. on Computer Vision (ICCV) , 2019, pp. 1637–1645
2019
Later among the works it cites.
H. M. Le, T.-J. Chin, A. Eriksson, T.-T. Do, and D. Suter, “Deterministic approximate methods for maximum consensus robust fitting,” IEEE Trans. Pattern Anal. Machine Intell. , 2019
2019
Later among the works it cites.
H. M. Le, T.-T. Do, T. Hoang, and N.-M. Cheung, “SDRSAC: Semidefinite-based randomized approach for robust point cloud registration without correspondences,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 124–133
2019
Later among the works it cites.
Y. Wang, Y. Sun, Z. Liu, S. E. Sarma, M. M. Bronstein, and J. M. Solomon, “Dynamic graph CNN for learning on point clouds,” ACM Transactions on Graphics (TOG) , vol. 38, no. 5, p. 146, 2019
2019
Later among the works it cites.
Y. Aoki, H. Goforth, R. A. Srivatsan, and S. Lucey, “Pointnetlk: Robust & efficient point cloud registration using PointNet,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 7163–7172
2019
Later among the works it cites.
Y. Wang and J. M. Solomon, “Deep Closest Point: Learning Representations for Point Cloud Registration,” in Intl. Conf. on Computer Vision (ICCV) , 2019
2019
Later among the works it cites.
——, “PRNet: Self-Supervised Learning for Partial-to-Partial Registration,” in Advances in Neural Information Processing Systems (NIPS) , 2019, pp. 8812–8824
2019
Later among the works it cites.
A. Avetisyan, M. Dahnert, A. Dai, M. Savva, A. X. Chang, and M. Nießner, “Scan2CAD: Learning CAD model alignment in RGB-D scans,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 2614–2623
2019
Later among the works it cites.
A. Avetisyan, A. Dai, and M. Nießner, “End-to-End CAD Model Retrieval and 9DoF Alignment in 3D Scans,” in Intl. Conf. on Computer Vision (ICCV) , 2019
2019
Later among the works it cites.
T.-Y. Liu and H. Jiang, “Minimizing sum of truncated convex functions and its applications,” Journal of Computational and Graphical Statistics , vol. 28, no. 1, pp. 1–10, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
H. Yang and L. Carlone, “One ring to rule them all: Certifiably robust geometric perception with outliers,” in Advances in Neural Information Processing Systems (NIPS) , 2020
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
C. Choy, W. Dong, and V. Koltun, “Deep global registration,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2020
2020
Closest in time.