%0 Conference Paper
%B Computer Vision, Graphics Image Processing, 2008. ICVGIP '08. Sixth Indian Conference on
%D 2008
%T A Scalable Projective Bundle Adjustment Algorithm using the L infinity Norm
%A Mitra, K.
%A Chellapa, Rama
%K adjustment
%K algorithm;structure
%K bundle
%K complexity;convex
%K complexity;iteration
%K error;scalable
%K estimation;
%K estimation;cameras;computational
%K L_{infin}
%K method;large
%K methods;parameter
%K norm;camera;computational
%K OPTIMIZATION
%K parameter
%K problem;memory
%K problem;projection
%K problem;reprojection
%K programming;image
%K projective
%K reconstruction;iterative
%K reconstruction;quasiconvex
%K requirement;motion
%K scale
%X 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)), where m is the number of cameras and n is the number of structure points. The sparse version of bundle adjustment has a computational complexity of O(m^{3}+mn) per iteration and memory requirement of O(mn). Here we propose an algorithm that has a computational complexity of O(mn(radicm+radicn)) per iteration and memory requirement of O(max(m,n)). The proposed algorithm is based on minimizing the L_{infin} 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 quasi-convex 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.
%B Computer Vision, Graphics Image Processing, 2008. ICVGIP '08. Sixth Indian Conference on
%P 79 - 86
%8 2008/12//
%G eng
%R 10.1109/ICVGIP.2008.51