Optimal two-view planar scene triangulation

Kenichi Kanatani, Hirotaka Niitsuma

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

5 Citations (Scopus)

Abstract

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages242-253
Number of pages12
Volume6493 LNCS
EditionPART 2
DOIs
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

Other10th Asian Conference on Computer Vision, ACCV 2010
CountryNew Zealand
CityQueenstown
Period11/8/1011/12/10

Fingerprint

Homography
Triangulation
Correspondence
Camera
Cameras
3D Image
Computing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kanatani, K., & Niitsuma, H. (2011). Optimal two-view planar scene triangulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 6493 LNCS, pp. 242-253). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6493 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-19309-5_19

Optimal two-view planar scene triangulation. / Kanatani, Kenichi; Niitsuma, Hirotaka.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6493 LNCS PART 2. ed. 2011. p. 242-253 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6493 LNCS, No. PART 2).

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

Kanatani, K & Niitsuma, H 2011, Optimal two-view planar scene triangulation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 6493 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 6493 LNCS, pp. 242-253, 10th Asian Conference on Computer Vision, ACCV 2010, Queenstown, New Zealand, 11/8/10. https://doi.org/10.1007/978-3-642-19309-5_19
Kanatani K, Niitsuma H. Optimal two-view planar scene triangulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 6493 LNCS. 2011. p. 242-253. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-642-19309-5_19
Kanatani, Kenichi ; Niitsuma, Hirotaka. / Optimal two-view planar scene triangulation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6493 LNCS PART 2. ed. 2011. pp. 242-253 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{29af7c3fe3b44955b536c5fd26e0b05d,
title = "Optimal two-view planar scene triangulation",
abstract = "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.",
author = "Kenichi Kanatani and Hirotaka Niitsuma",
year = "2011",
doi = "10.1007/978-3-642-19309-5_19",
language = "English",
isbn = "9783642193088",
volume = "6493 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "242--253",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - Optimal two-view planar scene triangulation

AU - Kanatani, Kenichi

AU - Niitsuma, Hirotaka

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79952513498&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952513498&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-19309-5_19

DO - 10.1007/978-3-642-19309-5_19

M3 - Conference contribution

SN - 9783642193088

VL - 6493 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 242

EP - 253

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -