Bundle Adjustment in the Large

We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We explore the use of Conjugate Gradients for calculating the Newton step and its performance

as a function of some simple and computationally efficient preconditioners. We show that the common Schur complement trick is not limited to factorization-based methods and that it can be interpreted as a form of preconditioning. Using photos from a street-side dataset and several community photo collections, we generate a variety of bundle adjustment problems and use them to evaluate the performance of six different bundle adjustment algorithms. Our experiments show that truncated Newton methods, when paired with relatively simple preconditioners, offer state of the art performance for large-scale bundle adjustment. The code, test problems and detailed performance data are available

at http://grail.cs.washington.edu/projects/bal.

Agarwal-ECCV10.pdf
PDF file

In  Eleventh European Conference on Computer Vision (ECCV 2010)

Publisher  Springer Verlag
All copyrights reserved by Springer 2010.

Details

TypeInproceedings
> Publications > Bundle Adjustment in the Large