TY - GEN
T1 - Resultant Based Incremental Recovery of Camera Pose from Pairwise Matches
AU - Kasten, Yoni
AU - Galun, Meirav
AU - Basri, Ronen
N1 - Supported by the Minerva foundation withfunding from the Federal German Ministry for Education and Research.
PY - 2019
Y1 - 2019
N2 - Incremental (online) structure from motion pipelines seek to recover the camera matrix associated with an image I-n given n-1 images, I-1, ..., In-1, whose camera matrices have already been recovered. In this paper, we introduce a novel solution to the six-point online algorithm to recover the exterior parameters associated with I-n. Our algorithm uses just six corresponding pairs of 2D points, extracted each from I-n and from any of the preceding n - 1 images, allowing the recovery of the full six degrees of freedom of the n'th camera, and unlike common methods, does not require tracking feature points in three or more images. Our novel solution is based on constructing a Dixon resultant, yielding a solution method that is both efficient and accurate compared to existing solutions. We further use Bernstein's theorem to prove a tight bound on the number of complex solutions. Our experiments demonstrate the utility of our approach.
AB - Incremental (online) structure from motion pipelines seek to recover the camera matrix associated with an image I-n given n-1 images, I-1, ..., In-1, whose camera matrices have already been recovered. In this paper, we introduce a novel solution to the six-point online algorithm to recover the exterior parameters associated with I-n. Our algorithm uses just six corresponding pairs of 2D points, extracted each from I-n and from any of the preceding n - 1 images, allowing the recovery of the full six degrees of freedom of the n'th camera, and unlike common methods, does not require tracking feature points in three or more images. Our novel solution is based on constructing a Dixon resultant, yielding a solution method that is both efficient and accurate compared to existing solutions. We further use Bernstein's theorem to prove a tight bound on the number of complex solutions. Our experiments demonstrate the utility of our approach.
UR - http://www.scopus.com/inward/record.url?scp=85063572660&partnerID=8YFLogxK
U2 - 10.1109/WACV.2019.00120
DO - 10.1109/WACV.2019.00120
M3 - منشور من مؤتمر
T3 - Proceedings - 2019 IEEE Winter Conference on Applications of Computer Vision, WACV 2019
SP - 1080
EP - 1088
BT - 2019 IEEE Winter Conference on Applications of Computer Vision
PB - IEEE Computer Society
T2 - 19th IEEE Winter Conference on Applications of Computer Vision (WACV)
Y2 - 7 January 2019 through 11 January 2019
ER -