Procedings of the British Machine Vision Conference 2010 2010
DOI: 10.5244/c.24.42
|View full text |Cite
|
Sign up to set email alerts
|

BetaSAC: A New Conditional Sampling For RANSAC

Abstract: We present a new strategy for RANSAC sampling named BetaSAC, in reference to the beta distribution. Our proposed sampler builds a hypothesis set incrementally, selecting data points conditional on the previous data selected for the set. Such a sampling is shown to provide more suitable samples in terms of inlier ratio but also of consistency and potential to lead to an accurate parameters estimation. The algorithm is presented as a general framework, easily implemented and able to exploit any kind of prior inf… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Because the value selected for n is high to avoid mismatching, the RANSAC algorithm is time consuming [ 63 ] and has a high computational complexity when coupled with the SIFT algorithm [ 65 ]. In addition, as RANSAC is a non-deterministic algorithm [ 66 , 67 ], it does not guarantee the return of an optimal solution [ 68 ], resulting in different results for different runs [ 69 ]. Furthermore, when computed with few SIFT-derived keypoints, it can be sensitive to initial conditions [ 70 ].…”
Section: Methodsmentioning
confidence: 99%
“…Because the value selected for n is high to avoid mismatching, the RANSAC algorithm is time consuming [ 63 ] and has a high computational complexity when coupled with the SIFT algorithm [ 65 ]. In addition, as RANSAC is a non-deterministic algorithm [ 66 , 67 ], it does not guarantee the return of an optimal solution [ 68 ], resulting in different results for different runs [ 69 ]. Furthermore, when computed with few SIFT-derived keypoints, it can be sensitive to initial conditions [ 70 ].…”
Section: Methodsmentioning
confidence: 99%
“…However, the texture of a SIFT feature is susceptible to the change of viewpoint and illumination. In BaySAC & SimSAC [8] and BetaSAC [9], the false matches are identified according to the verification of the historical samples. However, inaccurate historical samples would lead to wrong identification results.…”
Section: Introductionmentioning
confidence: 99%
“…Different approaches have been proposed to enhance RANSAC by improving the cost function [11,29] and the sampling strategy [3,4,13,15,18,19,23,25], or to deal with degenerate configurations [5,8] and allow faster model checks [14,20,22], but also other similar approaches exist [6,24,31].…”
Section: Introductionmentioning
confidence: 99%