Fast and precise weak-perspective factorization

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

Abstract

We address the problem of moving object reconstruction. Several methods have been published in the past 20 years including stereo reconstruction as well as multi-view factorization methods. In general, reconstruction algorithms estimate the 3D structure of the object and the camera parameters in a non-optimal way and then a nonlinear optimization method refines the estimated camera parameters and 3D object coordinates. In this paper, an adjustment method is proposed which is the fast version of the well-known down-hill alternation method. The novelty which yields the high speed of the algorithm is that the steps of the alternation give optimal solution to the subproblems by closed-form formulas. The proposed algorithm is discussed here and it is compared to the widely used bundle adjustment method. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Hajder, L., Pernek, Á., & Kazó, C. (2007). Fast and precise weak-perspective factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4673 LNCS, pp. 498–505). Springer Verlag. https://doi.org/10.1007/978-3-540-74272-2_62

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