Fundamental Matrix Computation: Theory and Practice

この論文をさがす

抄録

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.

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ