Dynamic RANSAC

W. F. Sze; W. K. Tang; Y. S. Hung

doi:10.1117/12.642764

18 January 2006 Dynamic RANSAC

W. F. Sze, W. K. Tang, Y. S. Hung

Proceedings Volume 6066, Vision Geometry XIV; 60660H (2006) https://doi.org/10.1117/12.642764
Event: Electronic Imaging 2006, 2006, San Jose, California, United States

Abstract

In this paper, the classical RANSAC approach is considered for robust matching to remove mismatches (outliers) in a list of putative correspondences. We will examine the justification for using the minimal size of sample set in a RANSAC trial and propose that the size of the sample set should be varied dynamically depending on the noise and data set. Using larger sample set will not increase the number of iterations dramatically but it can provide a more reliable solution. A new adjusting factor is added into the original RANSAC sampling equation such that the equation can model the noisy world better. In the proposed method, the noise variances, percentage of outliers and number of iterations are all estimated iteratively. Experimental results show that the estimated parameters are close to the ground truth. The modification can also be applied to any sampling consensus methods extended from RANSAC.

Citation Download Citation

W. F. Sze, W. K. Tang, and Y. S. Hung "Dynamic RANSAC", Proc. SPIE 6066, Vision Geometry XIV, 60660H (18 January 2006); https://doi.org/10.1117/12.642764

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available