EVSAC: Accelerating Hypotheses Generation by Modeling Matching Scores with Extreme Value Theory

Victor Fragoso, Pradeep Sen, Sergio Rodriguez, Matthew Turk; The IEEE International Conference on Computer Vision (ICCV), 2013, pp. 2472-2479

Abstract


Algorithms based on RANSAC that estimate models using feature correspondences between images can slow down tremendously when the percentage of correct correspondences (inliers) is small. In this paper, we present a probabilistic parametric model that allows us to assign confidence values for each matching correspondence and therefore accelerates the generation of hypothesis models for RANSAC under these conditions. Our framework leverages Extreme Value Theory to accurately model the statistics of matching scores produced by a nearest-neighbor feature matcher. Using a new algorithm based on this model, we are able to estimate accurate hypotheses with RANSAC at low inlier ratios significantly faster than previous stateof-the-art approaches, while still performing comparably when the number of inliers is large. We present results of homography and fundamental matrix estimation experiments for both SIFT and SURF matches that demonstrate that our method leads to accurate and fast model estimations.

Related Material


[pdf]
[bibtex]
@InProceedings{Fragoso_2013_ICCV,
author = {Fragoso, Victor and Sen, Pradeep and Rodriguez, Sergio and Turk, Matthew},
title = {EVSAC: Accelerating Hypotheses Generation by Modeling Matching Scores with Extreme Value Theory},
booktitle = {The IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2013}
}