Share Email Print

Proceedings Paper

Dynamic RANSAC
Author(s): W. F. Sze; W. K. Tang; Y. S. Hung
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 18 January 2006
PDF: 11 pages
Proc. SPIE 6066, Vision Geometry XIV, 60660H (18 January 2006); doi: 10.1117/12.642764
Show Author Affiliations
W. F. Sze, The Univ. of Hong Kong (Hong Kong China)
W. K. Tang, The Univ. of Hong Kong (Hong Kong China)
Y. S. Hung, The Univ. of Hong Kong (Hong Kong China)

Published in SPIE Proceedings Vol. 6066:
Vision Geometry XIV
Longin Jan Latecki; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top