Skip to main content

Automatic Computation of Fundamental Matrix Based on Voting

  • Conference paper
  • First Online:
Smart Multimedia (ICSM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11010))

Included in the following conference series:

  • 1184 Accesses

Abstract

To reconstruct point geometry from multiple images, a new method to compute the fundamental matrix is proposed in this paper. This method uses a new selection method for fundamental matrix under the RANSAC (Random Sample And Consensus) framework. It makes good use of some low quality fundamental matrices to fuse a better quality fundamental matrix. At first, some fundamental matrices are computed as candidates in a few iterations. Then some of the best candidates are chosen based on voting the epipoles of their fundamental matrices to fuse a better fundamental matrix. The fusion can be simple mean or weighted summation of fundamental matrices from the first step. This selection method leads to better result such as more inliers or less projective errors. Our experiments prove and validate this new method of composed fundamental matrix computation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ben-Artzi, G., Halperin, T., Werman, M., Peleg, S.: Two points fundamental matrix. arXiv preprint arXiv:1604.04848, April 2016

  2. Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  3. Kukelova, Z., Bujnak, M., Pajdla, T.: Polynomial eigenvalue solutions to the 5-pt and 6-pt relative pose problems, pp. 1–10 (2008)

    Google Scholar 

  4. Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91–110 (2004)

    Article  MathSciNet  Google Scholar 

  5. Nister, D.: An efficient solution to the five-point relative pose problem. IEEE Trans. Pattern Anal. Mach. Intell. 26(6), 756–777 (2004)

    Article  Google Scholar 

  6. Nister, D., Hartley, R.I., Henrik, S.: Using Galois theory to prove structure from motion algorithms are optimal. In: 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1–8. IEEE (2007)

    Google Scholar 

  7. Stewenius, H., Engels, C., Nistèr, D.: Recent developments on direct relative orientation. ISPRS J. Photogramm. Remote Sens. 60(4), 284–294 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuedong Yuan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, X., Yuan, X. (2018). Automatic Computation of Fundamental Matrix Based on Voting. In: Basu, A., Berretti, S. (eds) Smart Multimedia. ICSM 2018. Lecture Notes in Computer Science(), vol 11010. Springer, Cham. https://doi.org/10.1007/978-3-030-04375-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04375-9_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04374-2

  • Online ISBN: 978-3-030-04375-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics