Optimal two-view planar scene triangulation

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

We present a new algorithm for optimally computing from point correspondences over two images their 3-D positions using the knowledge that they are constrained to be on a planar surface. We consider two cases: the case in which the plane and camera parameters are known and the case in which they are not. In the former, we show how observed point correspondences are optimally corrected so that they are compatible with the homography between the two images. In the latter, we show how the homography is optimally estimated by iteratively using the triangulation procedure. Although the accuracy improvement over existing methods is very small, our algorithm has a theoretical merit of computing an exact maximum likelihood solution. © 2011 Information Processing Society of Japan.

Cite

CITATION STYLE

APA

Kanatani, K., & Niitsuma, H. (2011). Optimal two-view planar scene triangulation. IPSJ Transactions on Computer Vision and Applications, 3, 67–79. https://doi.org/10.2197/ipsjtcva.3.67

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free