Compact Fundamental Matrix Computation

Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likelihood (ML) principle, minimizing the reprojection error. The rank constraint is incorporated by the EFNS procedure. Although our algorithm produces the same solution as all existing ML-based methods, it is probably the most practical of all, being small and simple. By numerical experiments, we confirm that our algorithm behaves as expected.

• Type: Conference
• Year: 2009
• Where: PSIVT
• Authors: Kenichi Kanatani, Yasuyuki Sugaya
• Keywords: Algorithm, Fundamental Matrix Computation, Multimedia, PSIVT 2009, Strict Maximum Likelihood