This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Estimating the Fundamental Matrix via Constrained Least-Squares: A Convex Approach
March 2002 (vol. 24 no. 3)
pp. 397-401

In this paper, a new method for the estimation of the fundamental matrix from point correspondences is presented. The minimization of the algebraic error is performed while taking explicitly into account the rank-two constraint on the fundamental matrix. It is shown how this nonconvex optimization problem can be solved avoiding local minima by using recently developed convexification techniques. The obtained estimate of the fundamental matrix turns out to be more accurate than the one provided by the linear criterion, where the rank constraint of the matrix is imposed after its computation by setting the smallest singular value to zero. This suggests that the proposed estimate can be used to initialize nonlinear criteria, such as the distance to epipolar lines and the gradient criterion, in order to obtain a more accurate estimate of the fundamental matrix.

[1] S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory. Philadelphia: SIAM, 1994.
[2] G. Chesi, A. Tesi, A. Vicino, and R. Genesio, “A Convex Approach to a Class of Minimum Norm Problems,” Robustness in Identification and Control, A. Garulli, A. Tesi, and A. Vicino, eds., pp. 359-372, London: Springer-Verlag, 1999.
[3] R. Deriche, Z. Zhang, Q.-T. Luong, and O. Faugeras, “Robust Recovery of the Epipolar Geometry for an Uncalibrated Stereo Rig,” Proc. Third European Conf. Computer Vision, 1994.
[4] O.D. Faugeras, Three-Dimensional Computer Vision: A Geometric Viewpoint.Cambridge, Mass.: MIT Press, 1993.
[5] O. Faugeras, “Stratification of 3-D Vision: Projective, Affine, and Metric Representations,” J. Optical Soc. Am. A, vol. 12, no. 3, pp. 465-484, 1995.
[6] R.I. Hartley, “In Defense of the 8-Point Algorithm,” Proc. Fifth Int'l Conf. Computer Vision, pp. 1,064-1,070, June 1995.
[7] R. Hartley, “Minimizing Algebraic Error in Geometric Estimation Problem,” Proc. Sixth Int'l Conf. Computer Vision, pp. 469-476, 1998.
[8] Q.-T. Luong and O. Faugeras, “The Fundamental Matrix: Theory, Algorithms, and Stability Analysis,” Int'l J. Computer Vision, vol. 17, no. 1, pp. 43-76, 1996.
[9] Q.-T. Luong and O. Faugeras, “Camera Calibration, Scene Motion and Structure Recovery from Point Correspondences and Fundamental Matrices,” Int'l J. Computer Vision, vol. 22, no. 3, pp. 261-289, 1997.
[10] Y. Nesterov and A. Nemirovsky, Interior Point Polynomial Methods in Convex Programming: Theory and Applications. Philadelphia: SIAM, 1993.
[11] P. Torr and D. Murray, “The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix,” Int'l J. Computer Vision, vol. 3, no. 24, pp. 271-300, 1997.
[12] P. Torr and A. Zisserman, “Performance Characterizaton of Fundamental Matrix Estimation under Image Degradation,” Machine Vision and Applications, vol. 9, pp. 321-333, 1997.
[13] Z. Zhang, “Determining the Epipolar Geometry and Its Uncertainty—A Review,” Int'l J. Computer Vision, vol. 27, no. 2, pp. 161-195, 1998.

Index Terms:
stereo vision, fundamental matrix, convex optimization, linear matrix inequality
Citation:
G. Chesi, A. Garulli, A. Vicino, R. Cipolla, "Estimating the Fundamental Matrix via Constrained Least-Squares: A Convex Approach," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 3, pp. 397-401, March 2002, doi:10.1109/34.990139
Usage of this product signifies your acceptance of the Terms of Use.