Less Biased Noise Scale Estimation for Threshold-Robust RANSAC

Johan Edstedt
3/17/2025
cs.CV

Official code: Parskatt/simfitpp (20 stars, MIT, last commit 2025-06-09).

Abstract

The gold-standard for robustly estimating relative pose through image matching is RANSAC. While RANSAC is powerful, it requires setting the inlier threshold that determines whether the error of a correspondence under an estimated model is sufficiently small to be included in its consensus set. Setting this threshold is typically done by hand, and is difficult to tune without an access to ground truth data. Thus, a method capable of automatically determining the optimal threshold would be desirable. In this paper we revisit inlier noise scale estimation, which is an attractive approach as the inlier noise scale is linear to the optimal threshold. We revisit the noise scale estimation method SIMFIT and find bias in the estimate of the noise scale. In particular, we fix underestimates from using the same data for fitting the model as estimating the inlier noise, and from not taking the threshold itself into account. Secondly, since the optimal threshold within a scene is approximately constant we propose a multi-pair extension of SIMFIT++, by filtering of estimates, which improves results. Our approach yields robust performance across a range of thresholds, shown in Figure 1. Code is available at https://github.com/Parskatt/simfitpp

View on arXivView PDF

Code Implementations(1)

Parskatt/simfitppOfficial100%
MIT
200Shell, PythonApr 2, 20251 years agoMIT

Similar Papers

Cite this paper

@article{edstedt2025less,
  title  = {Less Biased Noise Scale Estimation for Threshold-Robust RANSAC},
  author = {Johan Edstedt},
  year   = {2025},
  eprint = {2503.13433},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.13433v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.13433.svg)](https://codeofpaper.com/paper/2503.13433)

Discussion