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

USACv20: robust essential, fundamental and homography matrix estimation (2104.05044v1)

Published 11 Apr 2021 in cs.CV

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Maksym Ivashechkin (11 papers)
  2. Daniel Barath (71 papers)
  3. Jiri Matas (133 papers)
Citations (4)

Summary

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