Gauge independence in optimization algorithms for 3D vision

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

Abstract

We attack the problem of coordinate frame dependence and gauge freedoms in structure-from-motion. We are able to formulate a bundle adjustment algorithm whose results are independent of both the coordinate frame chosen to represent the scene and the ordering of the images. This method is more efficient that existing approaches to the problem in photogrammetry. We demonstrate that to achieve coordinate frame independent results, (i) Rotations should be represented by quaternions or local rotation parameters, not angles, and (ii) the translation vector describing the camera/ scene motion should be represented in scene 3D coordinates, not camera 3D coordinates, two representations which are normally treated as interchangeable. The algorithm allows 3D point and line features to be reconstructed. Implementation is via the efficient recursive partitioning algorithm common in photogrammetry. Results are presented demonstrating the advantages of the new method in terms of the stability of the bundle adjustment iterations.

Cite

CITATION STYLE

APA

McLauchlan, P. F. (2000). Gauge independence in optimization algorithms for 3D vision. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1883, pp. 183–199). Springer Verlag. https://doi.org/10.1007/3-540-44480-7_12

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