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

A Subspace-Constrained Tyler's Estimator and its Applications to Structure from Motion (2404.11590v2)

Published 17 Apr 2024 in cs.CV

Abstract: We present the subspace-constrained Tyler's estimator (STE) designed for recovering a low-dimensional subspace within a dataset that may be highly corrupted with outliers. STE is a fusion of the Tyler's M-estimator (TME) and a variant of the fast median subspace. Our theoretical analysis suggests that, under a common inlier-outlier model, STE can effectively recover the underlying subspace, even when it contains a smaller fraction of inliers relative to other methods in the field of robust subspace recovery. We apply STE in the context of Structure from Motion (SfM) in two ways: for robust estimation of the fundamental matrix and for the removal of outlying cameras, enhancing the robustness of the SfM pipeline. Numerical experiments confirm the state-of-the-art performance of our method in these applications. This research makes significant contributions to the field of robust subspace recovery, particularly in the context of computer vision and 3D reconstruction.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Larry P. Ammann. Robust singular value decompositions: A new approach to projection pursuit. Journal of the American Statistical Association, 88(422):pp. 505–514, 1993.
  2. MAGSAC: marginalizing sample consensus. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 10197–10205, 2019.
  3. A singular value thresholding algorithm for matrix completion. SIAM Journal on optimization, 20(4):1956–1982, 2010.
  4. Thresholding based outlier robust PCA. In Conference on Learning Theory, pages 593–628. PMLR, 2017.
  5. Vartan Choulakian. L1subscript𝐿1{L}_{1}italic_L start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT-norm projection pursuit principal component analysis. Computational Statistics & Data Analysis, 50(6):1441–1451, 2006.
  6. Locally optimized RANSAC. In Pattern Recognition: 25th DAGM Symposium, Magdeburg, Germany, September 10-12, 2003. Proceedings 25, pages 236–243. Springer, 2003.
  7. Two-view geometry estimation unaffected by a dominant plane. In 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), pages 772–779. IEEE, 2005.
  8. Robustly learning a gaussian: Getting optimal error, efficiently. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, page 2683–2702, USA, 2018. Society for Industrial and Applied Mathematics.
  9. R1-PCA: rotational invariant L1subscript𝐿1{L}_{1}italic_L start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT-norm principal component analysis for robust subspace factorization. In ICML ’06: Proceedings of the 23rd international conference on Machine learning, pages 281–288, New York, NY, USA, 2006. ACM.
  10. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6):381–395, 1981.
  11. A generalization of Tyler’s M-estimators to the case of incomplete data. Computational Statistics & Data Analysis, 54(2):374–393, 2010.
  12. RANSAC for (quasi-) degenerate data (QDEGSAC). In 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06), pages 453–460. IEEE, 2006.
  13. Rigorous guarantees for Tyler’s M-estimator via quantum expansion. In Conference on Learning Theory, pages 1601–1632. PMLR, 2020.
  14. A projection pursuit algorithm for exploratory data analysis. IEEE Transactions on Computers, C-23(9):881–890, 1974.
  15. Robust sparse covariance estimation by thresholding Tyler’s M-estimator. The Annals of Statistics, 48(1):86 – 110, 2020.
  16. Algorithms and hardness for robust subspace recovery. In Conference on Learning Theory, pages 354–375. PMLR, 2013.
  17. Multiple view geometry in computer vision. Cambridge university press, 2003.
  18. Image matching across wide baselines: From paper to practice. International Journal of Computer Vision, 129(2):517–547, 2021.
  19. Essential matrix estimation using convex relaxations in orthogonal space. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 17142–17152, 2023.
  20. Algebraic characterization of essential matrices and their averaging in multiview settings. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 5895–5903, 2019a.
  21. Gpsfm: Global projective sfm using algebraic constraints on multi-view fundamental matrices. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3264–3272, 2019b.
  22. Maximum likelihood estimation for the wrapped Cauchy distribution. Journal of Applied Statistics, 15(2):247–254, 1988.
  23. Nojun Kwak. Principal component analysis based on L1subscript𝐿1{L}_{1}italic_L start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT-norm maximization. IEEE transactions on pattern analysis and machine intelligence, 30(9):1672–1680, 2008.
  24. Fast, robust and non-convex subspace recovery. Information and Inference: A Journal of the IMA, 7(2):277–336, 2018a.
  25. An overview of robust subspace recovery. Proceedings of the IEEE, 106(8):1380–1410, 2018b.
  26. lpsubscript𝑙𝑝l_{p}italic_l start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT-recovery of the most significant subspace among multiple subspaces with outliers. Constr. Approx., 40(3):329–385, 2014.
  27. Robust computation of linear models by convex relaxation. Found. Comput. Math., 15(2):363–410, 2015.
  28. Theoretical guarantees for the subspace-constrained Tyler’s estimator, 2024.
  29. Projection-pursuit approach to robust dispersion matrices and principal components: primary theory and monte carlo. Journal of the American Statistical Association, 80(391):759–766, 1985.
  30. David G. Lowe. Distinctive image features from scale-invariant keypoints. International journal of computer vision, 60:91–110, 2004.
  31. Robust estimation of multivariate location and scatter. Wiley StatsRef: Statistics Reference Online, pages 1–12, 2014.
  32. Robust subspace recovery with adversarial outliers, 2019.
  33. A well-tempered landscape for non-convex robust subspace recovery. J. Mach. Learn. Res., 20(1):1348–1406, 2019.
  34. Stochastic and private nonconvex outlier-robust PCAs. In Proceedings of Mathematical and Scientific Machine Learning, pages 173–188. PMLR, 2022.
  35. Two proposals for robust PCA using semidefinite programming. Electronic Journal of Statistics, 5(none):1123 – 1160, 2011.
  36. Robust camera location estimation by convex programming. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 2674–2683, 2015.
  37. USAC: A universal framework for random sample consensus. IEEE transactions on pattern analysis and machine intelligence, 35(8):2022–2038, 2012.
  38. Robust statistics. John Wiley & Sons Hoboken, NJ, USA, 2009.
  39. A new rank constraint on multi-view fundamental matrices, and its application to camera location recovery. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 4798–4806, 2017.
  40. Scalable cluster-consistency statistics for robust multi-object matching. In International Conference on 3D Vision, 3DV 2021, London, United Kingdom, December 1-3, 2021, pages 352–360. IEEE, 2021.
  41. Photo tourism: exploring photo collections in 3d. In ACM siggraph 2006 papers, pages 835–846. Association for Computing Machinery, 2006.
  42. Weighted low-rank approximations. In Proceedings of the 20th international conference on machine learning (ICML-03), pages 720–727, 2003.
  43. Resilience: A criterion for learning in the presence of arbitrary outliers. In 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA, pages 45:1–45:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
  44. Guided sampling and consensus for motion estimation. In Computer Vision—ECCV 2002: 7th European Conference on Computer Vision Copenhagen, Denmark, May 28–31, 2002 Proceedings, Part I 7, pages 82–96. Springer, 2002.
  45. MLESAC: A new robust estimator with application to estimating image geometry. Computer vision and image understanding, 78(1):138–156, 2000.
  46. David E. Tyler. Statistical analysis for the angular central gaussian distribution on the sphere. Biometrika, 74(3):579–589, 1987a.
  47. David E. Tyler. A distribution-free m-estimator of multivariate scatter. The Annals of Statistics, pages 234–251, 1987b.
  48. Robust global translations with 1dsfm. In Computer Vision–ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part III 13, pages 61–75. Springer, 2014.
  49. Robust PCA via outlier pursuit. Advances in neural information processing systems, 23, 2010.
  50. Teng Zhang. Robust subspace recovery by Tyler’s M-estimator. Information and Inference: A Journal of the IMA, 5(1):1–21, 2016.
  51. A novel M-estimator for robust PCA. The Journal of Machine Learning Research, 15(1):749–808, 2014.
Citations (2)
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