Practical robust two-view translation estimation

Outliers pose a problem in all real structure from motion systems. Due to the use of automatic matching methods one has to expect that a (sometimes very large) portion of the detected correspondences can be incorrect. In this paper we propose a method that estimates the relative translation between two cameras and simultaneously maximizes the number of inlier correspondences. Traditionally, outlier removal tasks have been addressed using RANSAC approaches. However, these are random in nature and offer no guarantees of finding a good solution. If the amount of mismatches is large, the approach becomes costly because of the need to evaluate a large number of random samples. In contrast, our approach is based on the branch and bound methodology which guarantees that an optimal solution will be found. While most optimal methods trade speed for optimality, the proposed algorithm has competitive running times on problem sizes well beyond what is common in practice. Experiments on both real and synthetic data show that the method outperforms state-of-the-art alternatives, including RANSAC, in terms of solution quality. In addition, the approach is shown to be faster than RANSAC in settings with a large amount of outliers.

[1]  Richard I. Hartley,et al.  Multiple-View Geometry Under the {$L_\infty$}-Norm , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Johan Fredriksson,et al.  Fast and Reliable Two-View Translation Estimation , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Richard I. Hartley,et al.  Global Optimization through Rotation Space Search , 2009, International Journal of Computer Vision.

[4]  Carsten Rother,et al.  Linear Multi View Reconstruction and Camera Recovery Using a Reference Plane , 2002, International Journal of Computer Vision.

[5]  Fredrik Kahl,et al.  Two View Geometry Estimation with Outliers , 2009, BMVC.

[6]  Marc Pollefeys,et al.  A Minimal Case Solution to the Calibrated Relative Pose Problem for the Case of Two Known Orientation Angles , 2010, ECCV.

[7]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[8]  Thomas M. Breuel,et al.  Fast recognition using adaptive subdivisions of transformation space , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[9]  Stergios I. Roumeliotis,et al.  Two Efficient Solutions for Visual Odometry Using Directional Correspondence , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[11]  R. Hartley,et al.  Multiple-View Geometry under the L 1-Norm , 2007 .

[12]  Carl Olsson,et al.  Branch-and-Bound Methods for Euclidean Registration Problems , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Jiaolong Yang,et al.  Optimal Essential Matrix Estimation via Inlier-Set Maximization , 2014, ECCV.

[14]  NistérDavid An Efficient Solution to the Five-Point Relative Pose Problem , 2004 .

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

[16]  Thomas M. Breuel,et al.  Implementation techniques for geometric branch-and-bound matching methods , 2003, Comput. Vis. Image Underst..

[17]  David Nistér,et al.  An efficient solution to the five-point relative pose problem , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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