Fundamental Matrix Computation: Theory and Practice
Access this Article
Search this Article
We classify and review existing algorithms for computing the fundamental matrix from point correspondences and propose new effective schemes: 7-parameter Levenberg-Marquardt (LM) search, EFNS, and EFNS-based bundle adjustment. Doing experimental comparison, we show that EFNS and the 7-parameter LM search exhibit the best performance and that additional bundle adjustment does not increase the accuracy to any noticeable degree.
- Memoirs of the Faculty of Engineering, Okayama University
Memoirs of the Faculty of Engineering, Okayama University 42(1), 18-35, 2008-01
Faculty of Engineering, Okayama University