skip to main content
10.1145/1523103.1523188acmconferencesArticle/Chapter ViewAbstractPublication Pagesicac3Conference Proceedingsconference-collections
research-article

Real-world examples for constraining epipoles using point-line correspondences: self-contained benchmarks for epipole computation

Authors Info & Claims
Published:23 January 2009Publication History

ABSTRACT

Epipoles are important geometric entities of epipolar geometry, which are defined as the image of the camera center of one view in the other view. Many different algorithms in computer vision rely on the computation of epipoles, thereby giving rise to the need for efficient methods for computation of epipoles. In response to this need, different methods for either constraining or locating epipoles have been devised.

This paper exploits a special kind of correspondences across two views in order to propose a novel approach for both constraining and computation of epipoles depending on the number of correspondences. The most important property of this kind of correspondence, called point-line correspondence, is that it can be used directly for constraining the position of epipoles as soon as it is identified, eliminating the need for further processing. Unfortunately, this significant advantage has been obtained at a high cost: rarity of the desired correspondences. In order to dim this latter point, however, the paper also considers an important application of the proposed method, which is the generation of self-contained benchmarks for epipole computation. By self-contained it is meant that no information in addition to the images themselves, should be provided.

References

  1. Chen, Z., Pears, N., McDermid, J. and Heseltine, T. 2003. Epipole Estimation under Pure Camera Translation. In Proceedings of the 7th Digital Image Computing: Techniques and Applications, pp. 849--858, Sydney, Australia.Google ScholarGoogle Scholar
  2. Faugeras, O., Luong, Q.-T. and Papadopoulo, T. 2001. The Geometry of Multiple Images: The Laws That Govern the Formation of Multiple Images of a Scene and Some of Their Applications. The MIT Press, Cambridge, Massachusetts, London. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Hartley, R. I. and Zisserman, A. 2004. Multiple View Geometry in Computer Vision. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Luong, Q.-T. and Faugeras, O. 1994. On the direct determination of epipoles: a case study in algebraic methods for geometric problems. In Proceedings of the 12th IAPR International Conference on Computer Vision and Image Processing, pp. 243--247. IEEE Press, Jerusalem.Google ScholarGoogle Scholar
  5. Migita, T. and Shakunaga, T. 2006. One-Dimensional Search for Reliable Epipole Estimation, In Chang, L.-W, Lie, W.-N., Chiang, R. (Eds.): Pacific Rim Symposium on Image and Video Technology 2006, LNCS, vol. 4319, pp. 1215--1224, Springer-Verlag, Berlin Heidelberg. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Nistér, D. and Schaffalitzky, F. 2004. What do four points in two calibrated images tell us about the epipoles?. In Proceedings of the 8th European Conference on Computer Vision, Volume 2, pp. 41--57, Prague, Czech Republic.Google ScholarGoogle Scholar
  7. Sagüés, C., Murillo, A. C., Escudero, F. and Guerrero, J. J. 2006. From lines to epipoles through planes in two views, Pattern Recognition, Vol. 39(3), pp. 384--393. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Real-world examples for constraining epipoles using point-line correspondences: self-contained benchmarks for epipole computation

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ICAC3 '09: Proceedings of the International Conference on Advances in Computing, Communication and Control
          January 2009
          707 pages
          ISBN:9781605583518
          DOI:10.1145/1523103

          Copyright © 2009 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 23 January 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
        • Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader