Optimal two-view planar scene triangulation

Kenichi Kanatani; Hirotaka Niitsuma

doi:10.1007/978-3-642-19309-5_19

Optimal two-view planar scene triangulation

Kenichi Kanatani, Hirotaka Niitsuma

Graduate School of Natural Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Computer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers
Pages	242-253
Number of pages	12
Edition	PART 2
DOIs	https://doi.org/10.1007/978-3-642-19309-5_19
Publication status	Published - Mar 16 2011
Event	10th Asian Conference on Computer Vision, ACCV 2010 - Queenstown, New Zealand Duration: Nov 8 2010 → Nov 12 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	6493 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th Asian Conference on Computer Vision, ACCV 2010
Country	New Zealand
City	Queenstown
Period	11/8/10 → 11/12/10

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

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

Cite this

Kanatani, K., & Niitsuma, H. (2011). Optimal two-view planar scene triangulation. In Computer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers (PART 2 ed., 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.

Computer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers. 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 proceeding › Conference contribution

Kanatani, K & Niitsuma, H 2011, Optimal two-view planar scene triangulation. in Computer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers. PART 2 edn, 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 Computer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers. PART 2 ed. 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

@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",

month = mar,

day = "16",

doi = "10.1007/978-3-642-19309-5_19",

language = "English",

isbn = "9783642193088",

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 = "Computer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers",

edition = "PART 2",

note = "10th Asian Conference on Computer Vision, ACCV 2010 ; Conference date: 08-11-2010 Through 12-11-2010",

}

TY - GEN

T1 - Optimal two-view planar scene triangulation

AU - Kanatani, Kenichi

AU - Niitsuma, Hirotaka

PY - 2011/3/16

Y1 - 2011/3/16

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

AN - SCOPUS:79952513498

SN - 9783642193088

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

SP - 242

EP - 253

BT - Computer Vision, ACCV 2010 - 10th Asian Conference on Computer Vision, Revised Selected Papers

T2 - 10th Asian Conference on Computer Vision, ACCV 2010

Y2 - 8 November 2010 through 12 November 2010

ER -