A domain reduction algorithm for incremental projective reconstruction

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

Abstract

In this paper we address the problem of recovering the three-dimensional shape of an object and the motion of the camera based on multiple feature correspondences from an image sequence. We present a new incremental projective factorization algorithm using a perspective camera model. The original projective factorization method produces robust results. However, the method can not be applied to real-time applications since it is based on a batch processing pipeline and the size of the data matrix grows with each additional frame. The proposed algorithm obtains an estimate of shape and motion for each additional frame adding a dimension reduction step. A subset of frames is selected analyzing the contribution of frames to the reconstruction quality. The main advantage of the novel algorithm is the reduction of the computational cost while keeping the robustness of the original method. Experiments with synthetic and real images illustrate the accuracy and performance of the new algorithm. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Lemuz-López, R., & Arias-Estrada, M. (2006). A domain reduction algorithm for incremental projective reconstruction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4292 LNCS-II, pp. 564–575). Springer Verlag. https://doi.org/10.1007/11919629_57

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