Bundle adjustment

From Wikipedia, the free encyclopedia
Jump to: navigation, search
A sparse matrix obtained when solving a modestly sized bundle adjustment problem. This is the sparsity pattern of a 992×992 normal equations (i.e. approximate Hessian) matrix. Black regions correspond to nonzero blocks.

Given a set of images depicting a number of 3D points from different viewpoints, bundle adjustment can be defined as the problem of simultaneously refining the 3D coordinates describing the scene geometry as well as the parameters of the relative motion and the optical characteristics of the camera(s) employed to acquire the images, according to an optimality criterion involving the corresponding image projections of all points.

Bundle adjustment is almost always used as the last step of every feature-based 3D reconstruction algorithm. It amounts to an optimization problem on the 3D structure and viewing parameters (i.e., camera pose and possibly intrinsic calibration and radial distortion), to obtain a reconstruction which is optimal under certain assumptions regarding the noise pertaining to the observed image features: If the image error is zero-mean Gaussian, then bundle adjustment is the Maximum Likelihood Estimator. Its name refers to the bundles of light rays originating from each 3D feature and converging on each camera's optical center, which are adjusted optimally with respect to both the structure and viewing parameters (similarity in meaning to categorical bundle seems a pure coincidence). Bundle adjustment was originally conceived in the field of photogrammetry during the 1950s and has increasingly been used by computer vision researchers during recent years.

Bundle adjustment boils down to minimizing the reprojection error between the image locations of observed and predicted image points, which is expressed as the sum of squares of a large number of nonlinear, real-valued functions. Thus, the minimization is achieved using nonlinear least-squares algorithms. Of these, Levenberg–Marquardt has proven to be one of the most successful due to its ease of implementation and its use of an effective damping strategy that lends it the ability to converge quickly from a wide range of initial guesses. By iteratively linearizing the function to be minimized in the neighborhood of the current estimate, the Levenberg–Marquardt algorithm involves the solution of linear systems known as the normal equations. When solving the minimization problems arising in the framework of bundle adjustment, the normal equations have a sparse block structure owing to the lack of interaction among parameters for different 3D points and cameras. This can be exploited to gain tremendous computational benefits by employing a sparse variant of the Levenberg–Marquardt algorithm which explicitly takes advantage of the normal equations zeros pattern, avoiding storing and operating on zero elements.

Mathematical definition[edit]

Bundle adjustment amounts to jointly refining a set of initial camera and structure parameter estimates for finding the set of parameters that most accurately predict the locations of the observed points in the set of available images. More formally, assume that n 3D points are seen in m views and let \mathbf{x}_{ij} be the projection of the ith point on image j. Let \displaystyle v_{ij} denote the binary variables that equal 1 if point i is visible in image j and 0 otherwise. Assume also that each camera j is parameterized by a vector \mathbf{a}_j and each 3D point i by a vector \mathbf{b}_i. Bundle adjustment minimizes the total reprojection error with respect to all 3D point and camera parameters, specifically


\min_{\mathbf{a}_j, \, \mathbf{b}_i} \displaystyle\sum_{i=1}^{n} \; \displaystyle\sum_{j=1}^{m} \; v_{ij} \, d(\mathbf{Q}(\mathbf{a}_j, \, \mathbf{b}_i), \; \mathbf{x}_{ij})^2,

where \mathbf{Q}(\mathbf{a}_j, \, \mathbf{b}_i) is the predicted projection of point i on image j and d(\mathbf{x}, \, \mathbf{y}) denotes the Euclidean distance between the image points represented by vectors \mathbf{x} and \mathbf{y}. Clearly, bundle adjustment is by definition tolerant to missing image projections and minimizes a physically meaningful criterion.

Software[edit]

  • sba: A Generic Sparse Bundle Adjustment C/C++ Package Based on the Levenberg–Marquardt Algorithm (C, Matlab). GPL.
  • cvsba: An OpenCV wrapper for sba library (C++). GPL.
  • ssba: Simple Sparse Bundle Adjustment package based on the Levenberg–Marquardt Algorithm (C). LGPL.
  • OpenCV: Computer Vision library in the contrib module. BSD license.
  • mcba: Multi-Core Bundle Adjustment (CPU/GPU). GPL3.
  • libdogleg: General-purpose sparse non-linear least squares solver, based on Powell's dogleg method. LGPL.
  • ceres-solver: A Nonlinear Least Squares Minimizer. BSD license.
  • G20: Generalized Graph Optimizer (C) - sparse solver for graph based non-linear error functions. LGPL.
  • DGAP: The program DGAP implement the photogrammetric method of bundle adjustment invented by Helmut Schmid and Duane Brown. GPL.

See also[edit]

References[edit]

  • B. Triggs; P. McLauchlan and R. Hartley and A. Fitzgibbon (1999). "ICCV '99: Proceedings of the International Workshop on Vision Algorithms". Springer-Verlag. pp. 298–372. doi:10.1007/3-540-44480-7_21. ISBN 3-540-67973-1.  |chapter= ignored (help)
  • M.I.A. Lourakis and A.A. Argyros (2009). "SBA: A Software Package for Generic Sparse Bundle Adjustment". ACM Transactions on Mathematical Software (ACM) 36 (1): 1–30. doi:10.1145/1486525.1486527. 
  • R.I. Hartley and A. Zisserman (2004). Multiple View Geometry in computer vision (2nd ed.). Cambridge University Press. ISBN 0-521-54051-8. 

External links[edit]