Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Revisiting Robust Model Fitting Using Truncated Loss (2008.01574v2)

Published 4 Aug 2020 in cs.CV

Abstract: Robust fitting is a fundamental problem in low-level vision, which is typically achieved by maximum consensus (MC) estimators to identify inliers first or by M-estimators directly. While these two methods are discriminately preferred in different applications, truncated loss based M-estimators are similar to MC as they can also identify inliers. This work revisits a formulation that achieves simultaneous inlier identification and model estimation (SIME) using truncated loss. It has a generalized form adapts to both linear and nonlinear residual models. We show that as SIME takes fitting residual into account in finding inliers, its lowest achievable residual in model fitting is lower than that of MC robust fitting. Then, an alternating minimization (AM) algorithm is employed to solve the SIME formulation. Meanwhile, a semidefinite relaxation (SDR) embedded AM algorithm is developed in order to ease the high nonconvexity of the SIME formulation. Furthermore, the new algorithms are applied to various 2D/3D registration problems. Experimental results show that the new algorithms significantly outperform RANSAC and deterministic approximate MC methods at high outlier ratios. Besides, in rotation and Euclidean registration problems, the new algorithms also compare favorably with state-of-the-art registration methods, especially in high noise and outliers. Code is available at \textit{https://github.com/FWen/mcme.git}.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (57)
  1. T. J. Chin and D. Suter, “The maximum consensus problem: recent algorithmic advances,” Synthesis Lectures on Computer Vision (Eds. Gerard Medioni and Sven Dickinson), Morgan and Claypool Publishers, San Rafael, CA, USA, Feb 2017.
  2. P. Meer, “Robust techniques for computer vision,” in G. Medioni and S. B. Kang eds.: Emerging topics in computer vision. Prentice Hall, pp. 107–190, 2004.
  3. D. Martinec and T. Pajdla, “Robust rotation and translation estimation in multiview reconstruction,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2007.
  4. M. Brown and D. G. Lowe, “Automatic panoramic image stitching using invariant features,” Int. J. Computer Vision, vol. 74, no. 1, pp. 59–73, 2007.
  5. 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.
  6. O. Chum, J. Matas, and J. Kittler, “Locally optimized ransac,” in DAGM, Springer, 2003.
  7. B. J. Tordoff and D. W. Murray, “Guided-mlesac: Faster image transform estimation by using matching priors,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1523–1535, 2005.
  8. O. Chum and J. Matas, “Matching with PROSAC–Progressive sample consensus,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), Jun. 2005, pp. 220–226.
  9. S. Choi, T. Kim, and W. Yu, “Performance evaluation of RANSAC family,” in British Machine Vision Conference (BMVC), 2009.
  10. K. Lebeda, J. Matas, and O. Chum, “Fixing the locally optimized ransac full experimental evaluation,” in British Machine Vision Conference, 2012, pp. 1–11.
  11. H. Li, “Consensus set maximization with guaranteed global optimality for robust geometry estimation,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2009, pp. 1074–1080.
  12. Y. Zheng, S. Sugimoto, and M. Okutomi, “Deterministically maximizing feasible subsystem for robust model fitting with unit norm constraint,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2011, pp. 1825–1832.
  13. 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.
  14. T. J. Chin, P. Purkait, A. Eriksson, and D. Suter, “Efficient globally optimal consensus maximisation with tree search,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2015, pp. 2413–2421.
  15. O. Enqvist, E. Ask, F. Kahl, and K. Astrom, “Robust fitting for multiple view geometry,” in European Conference on Computer Vision, 2012, pp. 738–751.
  16. C. Olsson, O. Enqvist, and F. Kahl, “A polynomial-time bound for matching and registration with outliers,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2008, pp. 1–8.
  17. C. Olsson, A. P. Eriksson, and R. Hartley, “Outlier removal using duality,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 1450–1457, 2010.
  18. P. Purkait, C. Zach, and A. Eriksson, “Maximum consensus parameter estimation by reweighted L1 methods,” in Int. Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, 2018, pp. 312–32.
  19. F. Wen, R. Ying, Z. Gong, and P. Liu, “Efficient algorithms for maximum consensus robust fitting,” IEEE Trans. Robotics, vol. 36, no. 1, pp. 92–106, Feb. 2020.
  20. H. Le, T. J. Chin, and D. Suter, “An exact penalty method for locally convergent maximum consensus,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2017, pp. 1888–1896.
  21. H. Le, T. J. Chin, A. Eriksson, and D. Suter, “Deterministic approximate methods for maximum consensus robust fitting,” IEEE Trans. Pattern Analysis and Machine Intelligence, 2019.
  22. K. Sim and R. Hartley, “Removing outliers using the l-infinity norm,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2006, pp. 485–494.
  23. Y. Seo, H. Lee, and S. W. Lee, “Outlier removal by convex optimization for l-infinity approaches,” in Pacific Rim Symposium on Advances in Image and Video Technology (PSIVT), 2009.
  24. S. Poljak, F. Rendl, and H. Wolkowicz, “A recipe for semidefinite relaxation for (0, 1)-quadratic programming,” Journal of Global Optimization, vol. 7, no. 1, pp. 51–73, 1995.
  25. S. Burer and R. D. C. Monteiro, “A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,” Mathematical Programming, vol. 95, no. 2, pp. 329–357, 2003.
  26. Z. Zhang, “Determining the epipolar geometry and its uncertainty: A review,” Int. J. of Computer Vision, vol. 27, no. 2, pp. 161–195, 1998.
  27. P. H. S. Torr and A. Zisserman, “MLESAC: A new robust estimator with application to estimating image geometry,” Comput. Vis. Image Understand., vol. 78, no. 1, pp. 138–156, 2000.
  28. K. Aftab and R. Hartley, “Convergence of iteratively re-weighted least squares to robust m-estimators,” in IEEE Winter Conf. on Applications of Computer Vision, 2015, pp. 480–487.
  29. H. Yang, P. Antonante, V. Tzoumas, and L. Carlone, “Graduated nonconvexity for robust spatial perception: From non-minimal solvers to global outlier rejection,” IEEE Robotics and Automation Letters, 2020.
  30. Q. Y. Zhou, J. Park, and V. Koltun, “Fast global registration,” in European Conf. on Computer Vision (ECCV), pp. 766–782, 2016.
  31. H. Yang and L. Carlone, “A quaternion-based certifiably optimal solution to the Wahba problem with outliers,” in IEEE Int. Conf. Computer Vision (ICCV), 2019.
  32. G. Pataki, “On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues,” Mathematics of Operations Research, vol. 23, pp. 339–358, 1998.
  33. N. Boumal, V. Voroninski, and A. Bandeira, “The non-convex Burer-Monteiro approach works on smooth semidefinite programs,” in Advances in Neural Information Processing Systems, 2016, pp. 2757–2765,.
  34. S. Homer and M. Peinado, “Design and performance of parallel and distributed approximation algorithm for the maxcut,” J. of Parallel and Distributed Computing, vol. 46, pp. 48–61, 1997.
  35. R. Hartley and A. Zisserman. Multiple View Geometry in Computer Vision. Cambridge university press, 2003.
  36. Q. Ke and T. Kanade, “Quasiconvex optimization for robust geometric reconstruction,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 10, pp. 1834–1847, 2007.
  37. F. Kahl and R. Hartley, “Multiple view geometry under the ℓ∞subscriptℓ\ell_{\infty}roman_ℓ start_POSTSUBSCRIPT ∞ end_POSTSUBSCRIPT-norm,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 9, pp. 1603–1617, 2008.
  38. Y. Seo and R. Hartley, “A fast method to minimize ℓ∞subscriptℓ\ell_{\infty}roman_ℓ start_POSTSUBSCRIPT ∞ end_POSTSUBSCRIPT error norm for geometric vision problems,” in IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2007.
  39. O. Enqvist, E. Ask, F. Kahl, and K. Åström, “Robust fitting for multiple view geometry,” in Proc. Eur. Conf. Comput. Vision, 2012, pp. 738–751.
  40. G. Wahba, “A least squares estimate of satellite attitude,” SIAM review, vol. 7, no. 3, pp. 409–409, 1965.
  41. J.-C. Bazin, Y. Seo, R. Hartley, and M. Pollefeys, “Globally optimal inlier set maximization with unknown rotation and focal length,” in European Conf. on Computer Vision (ECCV), pp. 803–817, 2014.
  42. R. I. Hartley and F. Kahl, “Global optimization through rotation space search,” Int. J. of Computer Vision, vol. 82, no. 1, pp. 64–79, 2009.
  43. J. P. Iglesias, C. Olsson, and F. Kahl, “Global optimality for point set registration using semidefinite programming,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 2020.
  44. J.-C. Bazin, Y. Seo, and M. Pollefeys, “Globally optimal consensus set maximization through rotation search,” in Asian Conference on Computer Vision, 2012, pp. 539–551.
  45. M. D. Shuster, “A survey of attitude representations,” Journal of the Astronautical Sciences, vol. 41, no. 4, pp. 439–517, 1993.
  46. A. Vedaldi and B. Fulkerson, “Vlfeat: An open and portable library of computer vision algorithms,” in ACM Int. Conf. on Multimedia, 2010, pp. 1469–1472.
  47. R. Mur-Artal, J. M. M. Montiel, and J. D. Tardos, “Orb-slam: a versatile and accurate monocular slam system,” IEEE Trans. on Robotics, vol. 31, no. 5, pp. 1147–1163, 2015.
  48. A. P. Bustos and T. J. Chin, “Guaranteed outlier removal for point cloud registration with correspondences,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 40, no. 12, pp. 2868–2882, 2017.
  49. H. Yang, J. Shi, and L. Carlone, “Teaser: Fast and certifiable point cloud registration,” IEEE Trans. Robotics, 2020.
  50. MOSEK ApS. The MOSEK optimization toolbox for MATLAB manual. Version 8.1., 2017.
  51. B. Curless and M. Levoy, “A volumetric method for building complex models from range images,” in SIGGRAPH, pp. 303–312, 1996.
  52. M. Schmidt. minFunc: unconstrained differentiable multivariate optimization in Matlab. 2005.
  53. 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.
  54. D. M. Rosen, L. Carlone, A. S. Bandeira, and J. J. Leonard, “SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group,” The Int. J. of Robotics Research, vol. 38, no. 2-3, pp. 95–125, 2019.
  55. R. Raguram, O. Chum, M. Pollefeys, J. Matas, and J.-M. Frahm, “USAC: a universal framework for random sample consensus,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 35, no. 8, pp. 2022–2038, 2012.
  56. D. Barath, J. Matas, and J. Noskova, “Magsac: marginalizing sample consensus,” in CVPR, 2019, pp. 10197–10205.
  57. M. J. Black and A. Rangarajan, “On the unification of line processes, outlier rejection, and robust statistics with applications in early vision,” Int. J. of Computer Vision, vol. 19, no. 1, pp. 57–91, 1996.

Summary

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

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