Jump to content

Eight-point algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by KYN (talk | contribs) at 21:53, 18 August 2007 (Beginning). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The eight-point algorithm is an algorithm used in computer vision to estimate the essential matrix or the fundamental matrix related to a stereo camera pair from a set of corresponding image points. It was introduced by Longuet-Higgins in 1981 for the case of the essential matrix. In theory, this algorithm can be used also for the fundamental matrix, but in practice the #normalized eight-point algorithm, described by Hartley 1997, is better suited for this case.

The algorithm has its name from the fact that both the essential matrix and the fundamental matrix can be estimated using this algorithm from a set of eight (or more) corresponding image points. However, it is possible to used variations of the algorithm to do estimation based on only seven corresponding points.

The basic algorithm

The eight-point algorithm is here described for the case of estimating the essential matrix .

The normalized eight-point algorithm

The seven-point algorithm

References