# Bundle adjustment

Jump to navigation Jump to search
A sparse matrix obtained when solving a modestly sized bundle adjustment problem. This is the arrowhead sparsity pattern of a 992×992 normal-equation (i.e. approximate Hessian) matrix. Black regions correspond to nonzero blocks.

In photogrammetry and computer stereo vision, bundle adjustment is simultaneous refining of the 3D coordinates describing the scene geometry, the parameters of the relative motion, and the optical characteristics of the camera(s) employed to acquire the images, given a set of images depicting a number of 3D points from different viewpoints. Its name refers to the geometrical bundles of light rays originating from each 3D feature and converging on each camera's optical center, which are adjusted optimally according to an optimality criterion involving the corresponding image projections of all points.

## Uses

Bundle adjustment is almost always[citation needed] 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[1] image features: If the image error is zero-mean Gaussian, then bundle adjustment is the Maximum Likelihood Estimator.[2]: 2  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.[2]: 2

## General approach

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 termed 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.[2]: 3

## Mathematical definition

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,[3] assume that ${\displaystyle n}$ 3D points are seen in ${\displaystyle m}$ views and let ${\displaystyle \mathbf {x} _{ij}}$ be the projection of the ${\displaystyle i}$th point on image ${\displaystyle j}$. Let ${\displaystyle \displaystyle v_{ij}}$ denote the binary variables that equal 1 if point ${\displaystyle i}$ is visible in image ${\displaystyle j}$ and 0 otherwise. Assume also that each camera ${\displaystyle j}$ is parameterized by a vector ${\displaystyle \mathbf {a} _{j}}$ and each 3D point ${\displaystyle i}$ by a vector ${\displaystyle \mathbf {b} _{i}}$. Bundle adjustment minimizes the total reprojection error with respect to all 3D point and camera parameters, specifically

${\displaystyle \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 ${\displaystyle \mathbf {Q} (\mathbf {a} _{j},\,\mathbf {b} _{i})}$ is the predicted projection of point ${\displaystyle i}$ on image ${\displaystyle j}$ and ${\displaystyle d(\mathbf {x} ,\,\mathbf {y} )}$ denotes the Euclidean distance between the image points represented by vectors ${\displaystyle \mathbf {x} }$ and ${\displaystyle \mathbf {y} }$. Because the minimum is computed over many points and many images, bundle adjustment is by definition tolerant to missing image projections, and if the distance metric is chosen reasonably (e.g., Euclidean distance), bundle adjustment will also minimize a physically meaningful criterion.

## References

1. ^ B. Triggs; P. McLauchlan; R. Hartley; A. Fitzgibbon (1999). "Bundle Adjustment — A Modern Synthesis" (PDF). 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.
2. ^ a b c M.I.A. Lourakis and A.A. Argyros (2009). "SBA: A Software Package for Generic Sparse Bundle Adjustment" (PDF). ACM Transactions on Mathematical Software. 36 (1): 1–30. doi:10.1145/1486525.1486527. S2CID 474253.
3. ^ R.I. Hartley and A. Zisserman (2004). Multiple View Geometry in computer vision (2nd ed.). Cambridge University Press. ISBN 978-0-521-54051-3.