Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

CLIPPER+: A Fast Maximal Clique Algorithm for Robust Global Registration (2402.15464v1)

Published 23 Feb 2024 in cs.RO and cs.CV

Abstract: We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by finding its maximum clique. This formulation leads to extreme robustness to outliers; however, finding the maximum clique is an NP-hard problem, and therefore approximation is required in practice for large-size problems. The performance of an approximation algorithm is evaluated by its computational complexity (the lower the runtime, the better) and solution accuracy (how close the solution is to the maximum clique). Accordingly, the main contribution of CLIPPER+ is outperforming the state-of-the-art in accuracy while maintaining a relatively low runtime. CLIPPER+ builds on prior work (CLIPPER [1] and PMC [2]) and prunes the graph by removing vertices that have a small core number and cannot be a part of the maximum clique. This will result in a smaller graph, on which the maximum clique can be estimated considerably faster. We evaluate the performance of CLIPPER+ on standard graph benchmarks, as well as synthetic and real-world point cloud registration problems. These evaluations demonstrate that CLIPPER+ has the highest accuracy and can register point clouds in scenarios where over $99\%$ of associations are outliers. Our code and evaluation benchmarks are released at https://github.com/ariarobotics/clipperp.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. P. C. Lusk, K. Fathian, and J. P. How, “CLIPPER: A graph-theoretic framework for robust data association,” in IEEE Int. Conf. on Robotics and Automation, 2021, pp. 13 828–13 834.
  2. R. A. Rossi, D. F. Gleich, and A. H. Gebremedhin, “Parallel maximum clique algorithms with applications to network analysis,” SIAM Journal on Scientific Computing, vol. 37, no. 5, pp. C589–C616, 2015.
  3. P. Y. Lajoie, B. Ramtoula, Y. Chang, L. Carlone, and G. Beltrame, “DOOR-SLAM: Distributed, online, and outlier resilient slam for robotic teams,” IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 1656–1663, 2020.
  4. J. G. Mangelson, D. Dominic, R. M. Eustice, and R. Vasudevan, “Pairwise consistent measurement set maximization for robust multi-robot map merging,” in IEEE Int. Conf. on Robotics and Automation, 2018, pp. 2916–2923.
  5. J. Ankenbauer, K. Fathian, and J. P. How, “View-invariant localization using semantic objects in changing environments,” arXiv preprint arXiv:2209.14426, 2022.
  6. A. P. Bustos and T.-J. Chin, “Guaranteed outlier removal for point cloud registration with correspondences,” IEEE trans. on pattern analysis & machine intelligence, vol. 40, no. 12, pp. 2868–2882, 2017.
  7. H. Yang, J. Shi, and L. Carlone, “TEASER: Fast and certifiable point cloud registration,” IEEE Transactions on Robotics, vol. 37, no. 2, pp. 314–333, 2020.
  8. Y. Li, L. Gu, and T. Kanade, “Robustly aligning a shape model and its application to car alignment of unknown pose,” IEEE trans. on pattern analysis & machine intelligence, vol. 33, no. 9, pp. 1860–1876, 2011.
  9. 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 comp. vision & pattern recognition, 2017, pp. 652–660.
  10. K. Fathian, K. Khosoussi, Y. Tian, P. Lusk, and J. P. How, “CLEAR: A consistent lifting, embedding, and alignment rectification algorithm for multiview data association,” IEEE Transactions on Robotics, vol. 36, no. 6, pp. 1686–1703, 2020.
  11. P. C. Lusk, K. Fathian, and J. P. How, “MIXER: Multiattribute, multiway fusion of uncertain pairwise affinities,” IEEE Robotics and Automation Letters, vol. 8, no. 5, pp. 2462–2469, 2023.
  12. L. Rakai, H. Song, S. Sun, W. Zhang, and Y. Yang, “Data association in multiple object tracking: A survey of recent techniques,” Expert Systems with Applications, vol. 192, p. 116300, 2022.
  13. P. J. Besl and N. D. McKay, “Method for registration of 3-D shapes,” in Sensor fusion IV: control paradigms and data structures, vol. 1611.   Int. Society for Optics and Photonics, 1992, pp. 586–606.
  14. R. B. Rusu, N. Blodow, and M. Beetz, “Fast point feature histograms (FPFH) for 3D registration,” in IEEE ICRA, 2009, pp. 3212–3217.
  15. A. Zeng, S. Song, M. Nießner, M. Fisher, J. Xiao, and T. Funkhouser, “3DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructions,” in IEEE conf. on comp. vision and pattern recognition, 2017, pp. 1802–1811.
  16. M. A. Fischler and R. C. Bolles, “Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography,” Communications of the ACM, vol. 24, no. 6, pp. 381–395, 1981.
  17. H. Yang, P. Antonante, V. Tzoumas, and L. Carlone, “Graduated non-convexity for robust spatial perception: From non-minimal solvers to global outlier rejection,” IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 1127–1134, 2020.
  18. P. C. Lusk, D. Parikh, and J. P. How, “GraffMatch: Global Matching of 3D Lines and Planes for Wide Baseline LiDAR Registration,” IEEE Robotics and Automation Letters, vol. 8, no. 2, pp. 632–639, 2022.
  19. J. Shi, H. Yang, and L. Carlone, “ROBIN: a graph-theoretic approach to reject outliers in robust estimation using invariants,” in IEEE Int. Conf. on Robotics and Automation, 2021, pp. 13 820–13 827.
  20. G. Izatt, H. Dai, and R. Tedrake, “Globally optimal object pose estimation in point clouds with mixed-integer programming,” in Robotics Research: The 18th Int. Symposium.   Springer, 2020, pp. 695–710.
  21. J. Yang, H. Li, D. Campbell, and Y. Jia, “Go-icp: A globally optimal solution to 3d icp point-set registration,” IEEE Trans. on pattern analysis & machine intelligence, vol. 38, no. 11, pp. 2241–2254, 2015.
  22. T. J. Chin and D. Suter, “The maximum consensus problem: recent algorithmic advances,” Synthesis Lectures on Comp. Vision, vol. 7, no. 2, pp. 1–194, 2017.
  23. D. Barath and J. Matas, “Graph-cut ransac,” in & IEEE conf. on comp. vision and pattern recognition, 2018, pp. 6733–6741.
  24. M. J. Black and A. Rangarajan, “On the unification of line processes, outlier rejection, and robust statistics with applications in early vision,” Int. journal of comp. vision, vol. 19, no. 1, pp. 57–91, 1996.
  25. P. Agarwal, G. D. Tipaldi, L. Spinello, C. Stachniss, and W. Burgard, “Robust map optimization using dynamic covariance scaling,” in IEEE Int. Conf. on Robotics and Automation, 2013, pp. 62–69.
  26. J. L. Schonberger and J.-M. Frahm, “Structure-from-motion revisited,” in IEEE conf. on comp. vision & pattern recognition, 2016, pp. 4104–4113.
  27. R. Raguram, J.-M. Frahm, and M. Pollefeys, “A comparative analysis of ransac techniques leading to adaptive real-time random sample consensus,” in European Conf. on Comp. Vision.   Springer, 2008, pp. 500–513.
  28. T. Bailey, E. M. Nebot, J. Rosenblatt, and H. F. Durrant-Whyte, “Data association for mobile robot navigation: A graph theoretic approach,” in IEEE Int. Conf. on Robotics and Automation, vol. 3, 2000, pp. 2512–2517.
  29. M. Leordeanu and M. Hebert, “A spectral technique for correspondence problems using pairwise constraints,” in IEEE Int. Conf. on Comp. Vision, vol. 2, 2005, pp. 1482–1489.
  30. O. Enqvist, K. Josephson, and F. Kahl, “Optimal correspondences from pairwise constraints,” in IEEE Int. Conf. on Comp. Vision, 2009, pp. 1295–1302.
  31. A. P. Bustos, T.-J. Chin, F. Neumann, T. Friedrich, and M. Katzmann, “A practical maximum clique algorithm for matching with pairwise constraints,” arXiv preprint arXiv:1902.01534, 2019.
  32. X. Zhang, J. Yang, S. Zhang, and Y. Zhang, “3D Registration with Maximal Cliques,” in IEEE/CVF Conf. on Comp. Vision and Pattern Recognition, 2023, pp. 17 745–17 754.
  33. Q. Wu and J.-K. Hao, “A review on algorithms for maximum clique problems,” European Journal of Operational Research, vol. 242, no. 3, pp. 693–709, 2015.
  34. M. Pelillo, “Relaxation labeling networks for the maximum clique problem,” Journal of Artificial Neural Networks, vol. 2, no. 4, pp. 313–328, 1995.
  35. C. Ding, T. Li, and M. I. Jordan, “Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding,” in IEEE Int. Conf. on Data Mining, 2008, pp. 183–192.
  36. T. S. Motzkin and E. G. Straus, “Maxima for graphs and a new proof of a theorem of Turan,” Canadian Journal of Mathematics, vol. 17, pp. 533–540, 1965.
  37. M. T. Belachew and N. Gillis, “Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation,” Journal of Optimization Theory & Applications, vol. 173, no. 1, pp. 279–296, 2017.
  38. V. Batagelj and M. Zaversnik, “An O(m) algorithm for cores decomposition of networks,” arXiv preprint cs/0310049, 2003.
  39. D. P. Bertsekas, “Nonlinear programming,” Journal of the Operational Research Society, vol. 48, no. 3, pp. 334–334, 1997.
  40. J. Shotton, B. Glocker, C. Zach, S. Izadi, A. Criminisi, and A. Fitzgibbon, “Scene coordinate regression forests for camera relocalization in rgb-d images,” in IEEE conf. on comp. vision and pattern recognition, 2013, pp. 2930–2937.
  41. K. S. Arun, T. S. Huang, and S. D. Blostein, “Least-squares fitting of two 3-d point sets,” IEEE Transactions on pattern analysis and machine intelligence, no. 5, pp. 698–700, 1987.
  42. B. Curless and M. Levoy, “A volumetric method for building complex models from range images,” in 23rd annual conf. on comp. graphics and interactive techniques, 1996, pp. 303–312.
  43. J. Xiao, A. Owens, and A. Torralba, “SUN3D: A database of big spaces reconstructed using SfM and object labels,” in IEEE Int. conf. on comp. vision, 2013, pp. 1625–1632.
  44. F. Pomerleau, M. Liu, F. Colas, and R. Siegwart, “Challenging data sets for point cloud registration algorithms,” The Int. Journal of Robotics Research, vol. 31, no. 14, pp. 1705–1711, 2012.
  45. Z. Gojcic, C. Zhou, J. D. Wegner, and W. Andreas, “The perfect match: 3d point cloud matching with smoothed densities,” in Int. conf. on comp. vision and pattern recognition, 2019.
  46. B. Liu and F. Zhang, “Incremental algorithms of the core maintenance problem on edge-weighted graphs,” IEEE Access, vol. 8, pp. 63 872–63 884, 2020.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets