By Topic

Reconstruction from six-point sequences

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 $13
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

2 Author(s)
R. I. Hartley ; G.E. Corp. Res. & Dev., Niskayuna, NY, USA ; N. Y. Dano

An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras and points first pointed out by Carlsson and Weinshall. The current implementation avoids the weakness inherent in previous implementations of this method in which numerical accuracy is compromised by the distortion of image point error distributions under projective transformation. It is shown in this paper that one may compute the dual fundamental matrix by minimizing a cost function giving a first-order approximation to geometric distance error in the original untransformed image measurements. This is done by a modification of a standard near-optimal method for computing the fundamental matrix. Subsequently, the error measurements are adjusted optimally to conform with exact imaging geometry by application of the triangulation method of Hartley-Sturm

Published in:

Computer Vision and Pattern Recognition, 2000. Proceedings. IEEE Conference on  (Volume:2 )

Date of Conference: