mlsanityData to 7 Oct 2026

Power Variable Projection for Initialization-Free Large-Scale Bundle Adjustment

arXiv 2405.05079 ↗First posted 8 May 2024cs.CVcited by 9

Not on the map. Why?

Abstract (arXiv)

Most Bundle Adjustment (BA) solvers like the Levenberg-Marquardt algorithm require a good initialization. Instead, initialization-free BA remains a largely uncharted territory. The under-explored Variable Projection algorithm (VarPro) exhibits a wide convergence basin even without initialization. Coupled with object space error formulation, recent works have shown its ability to solve small-scale initialization-free bundle adjustment problem. To make such initialization-free BA approaches scalable, we introduce Power Variable Projection (PoVar), extending a recent inverse expansion method based on power series. Importantly, we link the power series expansion to Riemannian manifold optimization. This projective framework is crucial to solve large-scale bundle adjustment problems without initialization. Using the real-world BAL dataset, we experimentally demonstrate that our solver achieves state-of-the-art results in terms of speed and accuracy. To our knowledge, this work is the first to address the scalability of BA without initialization opening new venues for initialization-free structure-from-motion.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 5 of its 27 references that are in the map. First posted on arXiv 8 May 2024.

Builds on

5 of 27 references.

References · 5

  1. 2020Stochastic Bundle Adjustment for Efficient and Scalable 3D Reconstructioncited by 16
  2. 2021MegBA: A GPU-Based Distributed Library for Large-Scale Bundle Adjustmentcited by 13
  3. 2021Square Root Bundle Adjustment for Large-Scale Reconstructioncited by 12
  4. 2023A Game of Bundle Adjustment -- Learning Efficient Convergencecited by 4
  5. 2021Multidirectional Conjugate Gradients for Scalable Bundle Adjustmentcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 4.

9 papers.