Issue No. 03 - March (2002 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.990139
<p>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.</p>
stereo vision, fundamental matrix, convex optimization, linear matrix inequality
A. Garulli, A. Vicino, R. Cipolla and G. Chesi, "Estimating the Fundamental Matrix via Constrained Least-Squares: A Convex Approach," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 24, no. , pp. 397-401, 2002.