BetaSAC: A New Conditional Sampling For RANSAC | Zendy

Antoine Méler | Zendy; Marion Decrouez | Zendy; James L. Crowley | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

BetaSAC: A New Conditional Sampling For RANSAC

Author(s) -

Antoine Méler,

Marion Decrouez,

James L. Crowley

Publication year - 2010

Language(s) - English

Resource type - Conference proceedings

DOI - 10.5244/c.24.42

Subject(s) - ransac , sampling (signal processing) , computer science , homography , exploit , consistency (knowledge bases) , set (abstract data type) , sample (material) , data mining , artificial intelligence , pattern recognition (psychology) , algorithm , mathematics , statistics , computer vision , image (mathematics) , chemistry , projective test , computer security , filter (signal processing) , chromatography , projective space , programming language

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 information on the potential of a sample. As with PROSAC, BetaSAC converges towards RANSAC in the worst case. The benefits of the method are demonstrated on the homography estimation problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research