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 -