Provably-convergent iterative methods for projective structure from motion
Provably-convergent iterative methods for projective structure from motion
- Neue Suche nach: Mahamud, S.
- Neue Suche nach: Hebert, M.
- Neue Suche nach: Omori, Y.
- Neue Suche nach: Ponce, J.
- Neue Suche nach: Mahamud, S.
- Neue Suche nach: Hebert, M.
- Neue Suche nach: Omori, Y.
- Neue Suche nach: Ponce, J.
The estimation of the projective structure of a scene from image correspondences can be formulated as the minimization of the mean-squared distance between predicted and observed image points with respect to the projection matrices, the scene point positions, and their depths. Since these unknowns are not independent, constraints must be chosen to ensure that the optimization process. is well posed. This paper examines three plausible choices, and shows that the first one leads to the Sturm-Triggs projective factorization algorithm, while the other two lead to new provably-convergent approaches. Experiments with synthetic and real data are used to compare the proposed techniques to the Sturm-Triggs algorithm and bundle adjustment.
Dokumentinformationen
Provably-convergent iterative methods for projective structure from motion
2001-01-01
905572 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Ähnliche Titel
Provably-Convergent Iterative Methods for Projective Structure from Motion
| British Library Conference Proceedings | 2001
Provably Convergent Methods for the Linear and Nonlinear Shape from Shading Problem
| British Library Online Contents | 1998
Particle-SfT: A Provably-Convergent, Fast Shape-from-Template Algorithm
| British Library Online Contents | 2017
Provably Convergent Multifidelity Optimization Algorithm Not Requiring High-Fidelity Derivatives
| Online Contents | 2012