mlsanityData to 14 Oct 2026

RANSAC Scoring Functions: Analysis and Reality Check

arXiv 2512.19850 ↗First posted 22 Dec 2025cs.CV stat.APcited by 3

Not on the map. Why?

Abstract (arXiv)

We revisit the problem of assigning a score (a quality of fit) to candidate geometric models -- one of the key components of RANSAC for robust geometric fitting. In a non-robust setting, the ``gold standard'' scoring function, known as the geometric error, follows from a probabilistic model with Gaussian noises. We extend it to spherical noises. In a robust setting, we consider a mixture with uniformly distributed outliers and show that a threshold-based parameterization leads to a unified view of likelihood-based and robust M-estimators and associated local optimization schemes. Next we analyze MAGSAC++ which stands out for two reasons. First, it achieves the best results according to existing benchmarks. Second, it makes quite different modeling assumptions and derivation steps. We discovered, however that the derivation does not correspond to sound principles and the resulting score function is in fact numerically equivalent to a simple Gaussian-uniform likelihood, a basic model within the proposed framework. Finally, we propose an experimental methodology for evaluating scoring functions: assuming either a large validation set, or a small random validation set in expectation. We find that all scoring functions, including using a learned inlier distribution, perform identically. In particular, MAGSAC++ score is found to be neither better performing than simple contenders nor less sensitive to the choice of the threshold hyperparameter. Our theoretical and experimental analysis thus comprehensively revisit the state-of-the-art, which is critical for any future research seeking to improve the methods or apply them to other robust fitting problems.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 15 of its 43 references that are in the map. First posted on arXiv 22 Dec 2025.

Builds on

15 of 43 references.

References · 15

  1. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
  2. 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,320
  3. 2016DSAC - Differentiable RANSAC for Camera Localizationcited by 266
  4. 2017HPatches: A benchmark and evaluation of handcrafted and learned local descriptorscited by 264
  5. 2020Image Matching across Wide Baselines: From Paper to Practicecited by 225
  6. 2019MAGSAC++, a fast, reliable and accurate robust estimatorcited by 161
  7. 2018MAGSAC: marginalizing sample consensuscited by 123
  8. 2022LaMAR: Benchmarking Localization and Mapping for Augmented Realitycited by 100
  9. 2021VSAC: Efficient and Accurate Estimator for H and Fcited by 17
  10. 2023A Large Scale Homography Benchmarkcited by 15
  11. 2023Two-View Geometry Scoring Without Correspondencescited by 11
  12. 2024Revisiting Sampson Approximations for Geometric Estimation Problemscited by 6
3 more
  1. 2025Less Biased Noise Scale Estimation for Threshold-Robust RANSACcited by 4
  2. 2017Accurate Motion Estimation through Random Sample Aggregated Consensuscited by 2
  3. 2023Sparse resultant based minimal solvers in computer vision and their connection with the action matrixcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.