ANSAC: Adaptive Non-minimal Sample and Consensus

While RANSAC-based methods are robust to incorrect image correspondences (outliers), their hypothesis generators are not robust to correct image correspondences (inliers) with positional error (noise). This slows down their convergence because hypotheses drawn from a minimal set of noisy inliers can deviate significantly from the optimal model. This work addresses this problem by introducing ANSAC, a RANSAC-based estimator that accounts for noise by adaptively using more than the minimal number of correspondences required to generate a hypothesis. ANSAC estimates the inlier ratio (the fraction of correct correspondences) of several ranked subsets of candidate correspondences and generates hypotheses from them. Its hypothesis-generation mechanism prioritizes the use of subsets with high inlier ratio to generate high-quality hypotheses. ANSAC uses an early termination criterion that keeps track of the inlier ratio history and terminates when it has not changed significantly for a period of time. The experiments show that ANSAC finds good homography and fundamental matrix estimates in a few iterations, consistently outperforming state-of-the-art methods.

[1]  Luc Van Gool,et al.  Combined Depth and Outlier Estimation in Multi-View Stereo , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[2]  Andrew Zisserman,et al.  Three things everyone should know to improve object retrieval , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Jan-Michael Frahm,et al.  RECON: Scale-adaptive robust estimation via Residual Consensus , 2011, 2011 International Conference on Computer Vision.

[4]  Jiri Matas,et al.  Randomized RANSAC with sequential probability ratio test , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[5]  Matthew Turk,et al.  EVSAC: Accelerating Hypotheses Generation by Modeling Matching Scores with Extreme Value Theory , 2013, 2013 IEEE International Conference on Computer Vision.

[6]  Cordelia Schmid,et al.  A Comparison of Affine Region Detectors , 2005, International Journal of Computer Vision.

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

[8]  David W. Murray,et al.  Guided-MLESAC: faster image transform estimation by using matching priors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Richard Szeliski,et al.  Building Rome in a day , 2009, ICCV.

[10]  Sudeep Sarkar,et al.  Hop-Diffusion Monte Carlo for Epipolar Geometry Estimation between Very Wide-Baseline Images , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Matthew Turk,et al.  SWIGS: A Swift Guided Sampling Method , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

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

[13]  Jan-Michael Frahm,et al.  Building Rome on a Cloudless Day , 2010, ECCV.

[14]  Hanqing Lu,et al.  Fast and Accurate Image Matching with Cascade Hashing for 3D Reconstruction , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[15]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[16]  Wei Zhang,et al.  Image Based Localization in Urban Environments , 2006, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06).

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

[18]  David P. Capel An Effective Bail-out Test for RANSAC Consensus Scoring , 2005, BMVC.

[19]  Pascal Fua,et al.  Worldwide Pose Estimation Using 3D Point Clouds , 2012, ECCV.

[20]  Ilan Shimshoni,et al.  Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Torsten Sattler,et al.  Fast image-based localization using direct 2D-to-3D matching , 2011, 2011 International Conference on Computer Vision.

[22]  Tobias Höllerer,et al.  Theia: A Fast and Scalable Structure-from-Motion Library , 2015, ACM Multimedia.

[23]  Jan-Michael Frahm,et al.  USAC: A Universal Framework for Random Sample Consensus , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Jiri Matas,et al.  Randomized RANSAC with Td, d test , 2004, Image Vis. Comput..

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

[26]  Dieter Fox,et al.  Bayesian Filtering for Location Estimation , 2003, IEEE Pervasive Comput..

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

[28]  Richard Szeliski,et al.  Multi-image matching using multi-scale oriented patches , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[29]  Andrew Owens,et al.  Discrete-continuous optimization for large-scale structure from motion , 2011, CVPR 2011.

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

[31]  Johannes Gehrke,et al.  MatchMiner: Efficient Spanning Structure Mining in Large Image Collections , 2012, ECCV.

[32]  C. Strecha,et al.  Wide-baseline stereo from multiple views: A probabilistic account , 2004, CVPR 2004.