Two methods for automatic 3D reconstruction from long un-calibrated sequences

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

Abstract

This paper presents two methods for automatic 3D reconstruction: the one is a quantitative measure for frame grouping over long un-calibrated sequences, and the other is 3D reconstruction algorithm based on projective invariance. The first method evaluates the duration of corresponding points over sequence, the homography error, and the distribution of correspondences in the image. By making efficient bundles, we can overcome the limitation of the factorization, which is the assumption that all correspondences must remain in all views. In addition, we use collinearity among invariant properties in projective space to refine the projective matrix. That means any points located on the 2D imaged line must lie on the reconstructed projective line. Therefore, we regard the points unsatisfying collinearity as outliers, which are caused by a false feature tracking. After fitting a new 3D line from projective points, we iteratively obtain more precise projective matrix by using the points that are the orthogonal projection of outliers onto the line. Experimental results showed our methods can recover efficiently 3D structure from un-calibrated sequences. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Jeong, Y. Y., Seok, B. R., Hwang, Y. H., & Hong, H. K. (2004). Two methods for automatic 3D reconstruction from long un-calibrated sequences. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3177, 377–383. https://doi.org/10.1007/978-3-540-28651-6_55

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