• DocumentCode
    1316177
  • Title

    In defense of the eight-point algorithm

  • Author

    Hartley, Richard I.

  • Author_Institution
    Corp. Res. & Dev., Gen. Electr. Co., Schenectady, NY, USA
  • Volume
    19
  • Issue
    6
  • fYear
    1997
  • fDate
    6/1/1997 12:00:00 AM
  • Firstpage
    580
  • Lastpage
    593
  • Abstract
    The fundamental matrix is a basic tool in the analysis of scenes taken with two uncalibrated cameras, and the eight-point algorithm is a frequently cited method for computing the fundamental matrix from a set of eight or more point matches. It has the advantage of simplicity of implementation. The prevailing view is, however, that it is extremely susceptible to noise and hence virtually useless for most purposes. This paper challenges that view, by showing that by preceding the algorithm with a very simple normalization (translation and scaling) of the coordinates of the matched points, results are obtained comparable with the best iterative algorithms. This improved performance is justified by theory and verified by extensive experiments on real images
  • Keywords
    matrix algebra; noise; stereo image processing; eight-point algorithm; fundamental matrix; noise susceptibility; normalization; stereo images; uncalibrated cameras; Algorithm design and analysis; Cameras; Computer vision; Equations; Helium; Image reconstruction; Iterative algorithms; Layout; Least squares methods; Stereo vision;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/34.601246
  • Filename
    601246