Multicore bundle adjustment
Changchang Wu, Sameer Agarwal, Brian Curless et al. · 2011
We present the design and implementation of new inexact Newton type Bundle Adjustment algorithms that exploit hardware parallelism for efficiently solving large scale 3D scene reconstruction problems. We explore the use of multicore CPU as well as multicore GPUs for this purpose. We show that overcoming the severe memory and bandwidth limitations of current generation GPUs not only leads to more space efficient algorithms, but also to surprising savings in runtime. Our CPU based system is up to ten times and our GPU based system is up to thirty times faster than the current state of the art methods, while maintaining comparable convergence behavior. The code and additional results are available at http://grail.cs.washington.edu/projects/mcba.
Cited by 807 works. doi:10.1109/cvpr.2011.5995552
Authors
References
- Numerical optimization
- Bundle Adjustment — A Modern Synthesis
- The Design and Implementation of FFTW3
- Numerical linear algebra
- Numerical Linear Algebra
- Algorithm 887
- Building Rome in a day
- Implementing sparse matrix-vector multiplication on throughput-oriented processors
- Building Rome in a day
- Building Rome on a Cloudless Day