Outliers Elimination Based Ransac for Fundamental Matrix Estimation

To accelerate the RANSAC process for fundamental matrix estimation, two special modifications about RANSAC are proposed. Firstly, in the verification stage, not the correspondences are used to verify the hypothesis but the singular values of estimated fundamental matrix are directly used to evaluate the effectiveness of the matrix. Secondly, after getting a plausible estimation, the obvious outliers are eliminated from the correspondences set. This process can enhance the inliers' ratio in the remaining correspondences set, which will accelerate the sample progress. We call our method as outlier elimination based RANSAC (OE-RANSAC). Experimental results both from synthetic and real data have testified the efficiency of OE-RANSAC.

[1]  Paul A. Beardsley,et al.  Navigation using Affine Structure from Motion , 1994, ECCV.

[2]  Richard I. Hartley,et al.  Critical Configurations for Projective Reconstruction from Multiple Views , 2005, International Journal of Computer Vision.

[3]  Sami S. Brandt,et al.  Theorems and algorithms for multiple view geometry with applications to electron tomography , 2002 .

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

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

[6]  Philip H. S. Torr,et al.  Outlier detection and motion segmentation , 1993, Other Conferences.

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

[8]  Richard I. Hartley,et al.  In Defense of the Eight-Point Algorithm , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  H. C. Longuet-Higgins,et al.  A computer algorithm for reconstructing a scene from two projections , 1981, Nature.

[10]  Peter J. Rousseeuw,et al.  Robust Regression and Outlier Detection , 2005, Wiley Series in Probability and Statistics.

[11]  Richard I. Hartley,et al.  In defence of the 8-point algorithm , 1995, Proceedings of IEEE International Conference on Computer Vision.

[12]  Cordelia Schmid,et al.  A Performance Evaluation of Local Descriptors , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  David Nistér,et al.  An efficient solution to the five-point relative pose problem , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[14]  Steven Mills,et al.  Fast RANSAC Hypothesis Generation for Essential Matrix Estimation , 2011, 2011 International Conference on Digital Image Computing: Techniques and Applications.

[15]  Philip H. S. Torr,et al.  The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix , 1997, International Journal of Computer Vision.

[16]  Luc Van Gool,et al.  Speeded-Up Robust Features (SURF) , 2008, Comput. Vis. Image Underst..

[17]  O. Faugeras.  Three-dimensional computer vision: a geometric viewpoint , 1993 .

[18]  Zhengyou Zhang,et al.  Determining the Epipolar Geometry and its Uncertainty: A Review , 1998, International Journal of Computer Vision.

[19]  Olivier D. Faugeras,et al.  The fundamental matrix: Theory, algorithms, and stability analysis , 2004, International Journal of Computer Vision.