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 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 242-253 |
| Number of pages | 12 |
| Volume | 6493 LNCS |
| Edition | PART 2 |
| DOIs | |
| Publication status | Published - 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) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 10th Asian Conference on Computer Vision, ACCV 2010 |
|---|---|
| Country | New Zealand |
| City | Queenstown |
| Period | 11/8/10 → 11/12/10 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
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 proceeding › Conference contribution
}
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 -