A Scalable Projective Bundle Adjustment Algorithm using the L∞ Norm ∗
Kaushik Mitra, Rama Chellappa · 2008
The traditional bundle adjustment algorithm for structure from motion problem has a computational complexity of O((m + n) 3 ) per iteration and memory requirement of O(mn(m+n)) ,w herem is the numberof camerasand n is thenumberofstructurepoints. Thesparseversion ofbundle adjustmenthas a computationalcomplexity of O(m 3 +mn) per iteration and memory requirement of O(mn) .H ere we propose an algorithm that has a computational complexity of O(mn( √ m + √ n)) per iteration and memory requirement of O(max(m, n)). The proposed algorithm is based on minimizing the L∞ norm of reprojection error. It alternately estimates the camera and structure parameters, thus reducing the potentially large scale optimization problem to many small scale subproblems each of which is a quasiconvex optimization problem and hence can be solved globally. Experiments using synthetic and real data show that the proposed algorithm gives good performance in terms of minimizing the reprojection error and also has a good convergence rate.