ML Anthology

Visibility Based Preconditioning for Bundle Adjustment

Avanish Kushal, Sameer Agarwal
CVPR 2012 pp. 1442-1449
doi:10.1109/CVPR.2012.6247832 /cvpr/2012/kushal2012cvpr-visibility/

Abstract

We present Visibility Based Preconditioning (VBP) a new technique for efficiently solving the linear least squares problems that arise in bundle adjustment (Triggs et al., 1999). Using the camera-point visibility structure of the scene, we describe the construction of two preconditioners. These preconditioners when combined with an inexact step Levenberg-Marquardt algorithm (Wright and Holt, 1985) offer state of the art performance on the BAL data set (Agarwal et al., 2010), with 3-5× reduction in execution time over currently available methods while delivering comparable or better solution quality.

CVPR Semantic Scholar

Cite

Text

Kushal and Agarwal. "Visibility Based Preconditioning for Bundle Adjustment." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012. doi:10.1109/CVPR.2012.6247832

Markdown

[Kushal and Agarwal. "Visibility Based Preconditioning for Bundle Adjustment." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012.](https://mlanthology.org/cvpr/2012/kushal2012cvpr-visibility/) doi:10.1109/CVPR.2012.6247832

BibTeX

@inproceedings{kushal2012cvpr-visibility,
  title     = {{Visibility Based Preconditioning for Bundle Adjustment}},
  author    = {Kushal, Avanish and Agarwal, Sameer},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2012},
  pages     = {1442-1449},
  doi       = {10.1109/CVPR.2012.6247832},
  url       = {https://mlanthology.org/cvpr/2012/kushal2012cvpr-visibility/}
}