Optimal two-view planar scene triangulation

Kenichi Kanatani, Hirotaka Niitsuma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)


We present a new algorithm for optimally computing from point correspondences over two images their 3-D positions when 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 determined by the plane and camera parameters. In the latter, we show how the homography is optimally estimated by iteratively using the triangulation procedure.

Original languageEnglish
Title of host publicationComputer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers
Number of pages12
EditionPART 2
Publication statusPublished - Mar 16 2011
Event10th Asian Conference on Computer Vision, ACCV 2010 - Queenstown, New Zealand
Duration: Nov 8 2010Nov 12 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6493 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other10th Asian Conference on Computer Vision, ACCV 2010
Country/TerritoryNew Zealand

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Optimal two-view planar scene triangulation'. Together they form a unique fingerprint.

Cite this