Optimal RANSAC-Towards a Repeatable Algorithm for Finding the Optimal Set

A novel idea on how to make RANSAC repeatable is presented, which will find the optimal set in nearly every run for certain types of applications. The proposed algorithm can be used for such transformations that can be constructed by more than the minimal points required. We give examples on matching of aerial images using the Direct Linear Transformation, which requires at least four points. Moreover, we give examples on how the algorithm can be used for finding a plane in 3D using three points or more. Due to its random nature, standard RANSAC is not always able to find the optimal set even for moderately contaminated sets and it usually performs badly when the number of inliers is less than 50%. However, our algorithm is capable of finding the optimal set for heavily contaminated sets, even for an inlier ratio under 5%. The proposed algorithm is based on several known methods, which we modify in a unique way and together they produce a result that is quite different from what each method can produce on its own.

[1]  Jan-Michael Frahm,et al.  RANSAC for (Quasi-)Degenerate data (QDEGSAC) , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[2]  Jiri Matas,et al.  Locally Optimized RANSAC , 2003, DAGM-Symposium.

[3]  Slawomir J. Nasuto,et al.  NAPSAC: High Noise, High Dimensional Robust Estimation - it's in the Bag , 2002, BMVC.

[4]  Andrew Zisserman,et al.  MLESAC: A New Robust Estimator with Application to Estimating Image Geometry , 2000, Comput. Vis. Image Underst..

[5]  Hrvoje Babic,et al.  Image and Signal Processing and Analysis , 2001 .

[6]  Matthew A. Brown,et al.  Automatic Panoramic Image Stitching using Invariant Features , 2007, International Journal of Computer Vision.

[7]  Jiri Matas,et al.  Optimal Randomized RANSAC , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  O. Chum,et al.  ENHANCING RANSAC BY GENERALIZED MODEL OPTIMIZATION Onďrej Chum, Jǐ , 2003 .

[9]  Richard O. Duda,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[10]  Geoffrey E. Hinton,et al.  Learning Generative Texture Models with extended Fields-of-Experts , 2009, BMVC.

[11]  Carl Olsson,et al.  A polynomial-time bound for matching and registration with outliers , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[12]  B. S. Manjunath,et al.  The multiRANSAC algorithm and its application to detect planar homographies , 2005, IEEE International Conference on Image Processing 2005.

[13]  Fredrik Kahl,et al.  Robust Optimal Pose Estimation , 2008, ECCV.

[14]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[15]  Jiri Matas,et al.  Matching with PROSAC - progressive sample consensus , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[16]  Hongdong Li,et al.  Consensus set maximization with guaranteed global optimality for robust geometry estimation , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[17]  David Nistér,et al.  Preemptive RANSAC for live structure and motion estimation , 2005, Machine Vision and Applications.

[18]  Jan-Michael Frahm,et al.  A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus , 2008, ECCV.

[19]  Filip Malmberg,et al.  Towards User-Guided Quantitative Evaluation of Wrist Fractures in CT Images , 2012, ICCVG.

[20]  Alan Hanjalic,et al.  A Combined RANSAC-Hough Transform Algorithm for Fundamental Matrix Estimation , 2007, BMVC.

[21]  Olaf Hellwich,et al.  Genetic Algorithm SAmple Consensus (GASAC) - A Parallel Strategy for Robust Parameter Estimation , 2006, 2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06).

[22]  Uwe Stilla,et al.  ESTIMATING THE ESSENTIAL MATRIX: GOODSAC VERSUS RANSAC , 2006 .

[23]  Matthijs C. Dorst.  Distinctive Image Features from Scale-Invariant Keypoints , 2011 .

[24]  François Goulette,et al.  Extracting Cylinders in Full 3D Data Using a Random Sampling Method and the Gaussian Image , 2001, VMV.

[25]  Jan-Michael Frahm,et al.  Exploiting uncertainty in random sample consensus , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[26]  Jiri Matas,et al.  Fixing the Locally Optimized RANSAC , 2012, BMVC.

[27]  É. Vincent,et al.  Detecting planar homographies in an image pair , 2001, ISPA 2001. Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis. In conjunction with 23rd International Conference on Information Technology Interfaces (IEEE Cat..

[28]  K. Tanaka,et al.  Incremental RANSAC for online relocation in large dynamic environments , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[29]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[30]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.

[31]  Sunglok Choi,et al.  Performance Evaluation of RANSAC Family , 2009, BMVC.

[32]  Torsten Sattler,et al.  SCRAMSAC: Improving RANSAC's efficiency with a spatial consistency filter , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[33]  Andrew Zisserman,et al.  Multiple View Geometry , 1999 .

[34]  Stefano Soatto,et al.  KALMANSAC: robust filtering by consensus , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.