mlsanityData to 7 Oct 2026

USACv20: robust essential, fundamental and homography matrix estimation

arXiv 2104.05044 ↗First posted 11 Apr 2021cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

We review the most recent RANSAC-like hypothesize-and-verify robust estimators. The best performing ones are combined to create a state-of-the-art version of the Universal Sample Consensus (USAC) algorithm. A recent objective is to implement a modular and optimized framework, making future RANSAC modules easy to be included. The proposed method, USACv20, is tested on eight publicly available real-world datasets, estimating homographies, fundamental and essential matrices. On average, USACv20 leads to the most geometrically accurate models and it is the fastest in comparison to the state-of-the-art robust estimators. All reported properties improved performance of original USAC algorithm significantly. The pipeline will be made available after publication.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 46 references that are in the map. First posted on arXiv 11 Apr 2021.

Builds on

6 of 46 references.

References · 6

  1. 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 983
  2. 2017Graph-Cut RANSACcited by 133
  3. 2018MAGSAC: marginalizing sample consensuscited by 122
  4. 2015MODS: Fast and Robust Method for Two-View Matchingcited by 26
  5. 2019An Evaluation of Feature Matchers for Fundamental Matrix Estimationcited by 18
  6. 2019Progressive NAPSAC: sampling from gradually growing neighborhoodscited by 16

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.