Distributed Bundle Adjustment Based on Penalty Function Method

Bundle Adjustment (BA) aims to estimate the camera poses and build maps utilizing the nonlinear optimization algorithm. The update step of the optimization is obtained by solving a linear system, which is the bottleneck of the BA efficiency. Many works perform bundle adjustment in a distributed manner to reduce the computational cost of solving the linear system and achieve outstanding performance. However, the distributed methods implement the constrained optimization method that involves the computation of the Lagrange multiplier, causing extra overhead. To improve the efficiency of BA, we propose a novel distributed algorithm based on the penalty method, dubbed PenBA, that formulates an unconstrained problem and hence saves the computation of extra variables. To solve the unconstrained linear system with low cost, we design a novel <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/><bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">distributed Preconditioned Conjugate Gradient (PCG)</b><italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> which has complexity bounded by hyper-parameters. It can be proved that, given the parameter update strategy of the optimization method, the penalty linear system can be solved with fast convergence. Experimental results in the BAL dataset illustrate that our penalty method outperforms the Lagrange multiplier method and conventional BA. Compared with the most accurate conventional PCG-based BA solver, PenBA decreases the objective values by 3.8<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\%$</tex-math></inline-formula>, the time per iteration by 17<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\%$</tex-math></inline-formula> and the maximum memory consumption by 24<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\%$</tex-math></inline-formula>. Experimental results in the SfM and SLAM datasets prove that PenBA applies to both computer vision and robotics contexts.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2025-04-08
DOI
https://doi.org/10.1109/lra.2025.3558702
Citations
1
Primary Topic
Satellite Image Processing and Photogrammetry
Type
article
Field-Weighted Citation Impact
1.15
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Bundle Adjustment Based on Penalty Function Method

Qixuan Sun, Jiamao Li, Dongchen Zhu, Xiaolin Zhang et al.
1 citations
IEEE Robotics and Automation Letters
Satellite Image Processing and Photogrammetry
1.15
article

Distributed Bundle Adjustment Based on Penalty Function Method

Qixuan Sun, Jiamao Li, Dongchen Zhu, Xiaolin Zhang, Lei Wang, Guanghui Zhang
article en
1 citations

Abstract

Bundle Adjustment (BA) aims to estimate the camera poses and build maps utilizing the nonlinear optimization algorithm. The update step of the optimization is obtained by solving a linear system, which is the bottleneck of the BA efficiency. Many works perform bundle adjustment in a distributed manner to reduce the computational cost of solving the linear system and achieve outstanding performance. However, the distributed methods implement the constrained optimization method that involves the computation of the Lagrange multiplier, causing extra overhead. To improve the efficiency of BA, we propose a novel distributed algorithm based on the penalty method, dubbed PenBA, that formulates an unconstrained problem and hence saves the computation of extra variables. To solve the unconstrained linear system with low cost, we design a novel <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/><bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">distributed Preconditioned Conjugate Gradient (PCG)</b><italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> which has complexity bounded by hyper-parameters. It can be proved that, given the parameter update strategy of the optimization method, the penalty linear system can be solved with fast convergence. Experimental results in the BAL dataset illustrate that our penalty method outperforms the Lagrange multiplier method and conventional BA. Compared with the most accurate conventional PCG-based BA solver, PenBA decreases the objective values by 3.8<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\%$</tex-math></inline-formula>, the time per iteration by 17<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\%$</tex-math></inline-formula> and the maximum memory consumption by 24<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\%$</tex-math></inline-formula>. Experimental results in the SfM and SLAM datasets prove that PenBA applies to both computer vision and robotics contexts.

IEEE Robotics and Automation LettersVol. 10(6)
State Key Laboratory of Transducer Technology (CN), Shanghai Institute of Microsystem and Information Technology (CN)
Reduced inequalities
Openalex Percentile: Top 25%
Satellite Image Processing and Photogrammetry
1.15
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.