By Topic

Why not use the levenberg-marquardt method for fundamental matrix estimation?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chen, P. ; Sch. of Inf. Sci. & Technol., Sun Yat-sen Univ., Guangzhou, China

The estimation of a fundamental matrix between two views is of great interest for a number of computer vision and robotics tasks. There exist well-known algorithms for this problem: such as normalised eight-point algorithm, fundamental numerical scheme (FNS), extended FNS (EFNS), and heteroscedastic errors-in-variable (HEIV). The Levenberg-Marquardt (LM) method can also be employed to estimate a fundamental matrix; however, for some unknown reason, it was unfairly treated in the literature so that it was reported to have inferior performance. In this study, the authors concentrate on the application of the LM method for fundamental matrix estimation. Particularly, a new Gauss-Newton approximation of the Hessian matrix is presented, when the Sampson error is minimised; and the rank-two constraint of a fundamental matrix is automatically enforced by revitalising a particular parameterisation. An evaluation of algorithms is presented, showing the advantage of these two techniques.

Published in:

Computer Vision, IET  (Volume:4 ,  Issue: 4 )