A dynamic programming approach to maximizing tracks for structure from motion

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dynamic programming to maximize the lengths of putative keypoint tracks. By efficiently discarding poor correspondences while maintaining the largest possible set of inliers, it ultimately provides a robust and accurate scene reconstruction. Traditional outlier detection strategies, such as RANSAC and its derivatives, cannot handle high dimensional problems such as structure from motion over long image sequences. We prove that, given an estimate of the camera pose at a given frame, the outlier detection is optimal and runs in low order polynomial time. The algorithm is applied on-line, processing each frame in sequential order. Results are presented on several indoor and outdoor video sequences processed both with and without the proposed optimization. The improvement in average reprojection errors demonstrates its effectiveness. © Springer-Verlag 2010.

Cite

CITATION STYLE

APA

Mooser, J., You, S., Neumann, U., Grasset, R., & Billinghurst, M. (2010). A dynamic programming approach to maximizing tracks for structure from motion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5995 LNCS, pp. 1–10). https://doi.org/10.1007/978-3-642-12304-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free