Some Improvements on two Autocalibration Algorithms based on the Fundamental Matrix

  1. (PDF, 664 KB)
AuthorSearch for: ; Search for:
ConferenceIn the International Conference on Pattern Recognition (ICPR 200), August 2002.
AbstractAutocalibration algorithms based on the fundamental matrix must solve the problem of finding the global minimum of a cost function which has many local minima. We describe a new method of achieving this goal, which uses a stochastic optimization approach taken from the field of evolutionary algorithms. In theory, approaches that use the fundamental matrix for autocalibration are inferior to those based on a projective reconstruction. We argue that in practice if we use this new stochastic optimization approach this is not true. When autocalibrating focal length and aspect ratio both methods achieve comparable results. We demonstrate this experimentally using published image sequences for which the ground truth is known.
Publication date
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number45859
NPARC number5765689
Export citationExport as RIS
Report a correctionReport a correction
Record identifiere17a4812-97e1-4631-8263-ae16447b6b56
Record created2009-03-29
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: