Bundle Adjustment

Sunday, 22 January 2012

upload

go to the top
About WN
Contact
Feedback
Privacy Policy
© 2012 World News Inc., all Rights Reserved

Lights Out

Play next
List all Videos
Autoplay
Autorepeat
Shuffle
Replay

clear restore
list images
close sort

Bundle Adjustment

2:23

Kinect Bundle Adjustment

0:40

Triangulation and bundle adjustment

1:06

problem with bundle adjustment

0:43

Triangulation and bundle adjustment

1:06

MVS + BA (CVPR 2008)

1:18

Kinect Visual Odometry Mapping (Video 1) - iC2020

1:44

Structure from Motion with VisualSFM

3:32

3D reconstruction from video

1:22

Inner courtyard 3D reconstruction

7:32

SLAM with the Kinect

0:34

Detection in Complex Objects using Multiple X-ray Views

3:10

Beginning of the London dataset

1:17

Relative SLAM -- Begbroke triple loop sequence

1:37

remove add to playlist video results for: bundle adjustment

Scale Drift-Aware Large Scale Monocular SLAM

2:14

Relative SLAM -- New College Garden sequence

1:20

3D reconstruction of P11 fountain dataset.

0:36

Handyscan 3D MaxSHOT Process Video - OptimumARC 3D

2:03

3D model of office desk from video

0:39

Automatic 3D Modeling

0:36

Covariance Estimation - BMVC 2009 video

1:42

3D Camera Egomotion using Optical flow with a Standard Webcamera

0:54

PTAMM: Museum 04 Stuffed Animals Table 2 Map Creation

4:10

show more results

right|thumb|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. Bundle adjustment was originally conceived in the field of photogrammetry during 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

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 ''i''th 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

sba: A Generic Sparse Bundle Adjustment C/C++ Package Based on the Levenberg–Marquardt Algorithm (C, Matlab)

ssba: Simple Sparse Bundle Adjustment package based on the Levenberg–Marquardt Algorithm (C) with LGPL license.

OpenCv: Computer Vision library in the contrib module.

mcba: Multi-Core Bundle Adjustment (CPU/GPU).

References

External links

B. Triggs, P. McLauchlan, R. Hartley and A. Fitzgibbon, ''Bundle Adjustment — A Modern Synthesis'', Vision Algorithms: Theory and Practice, 1999.

A. Zisserman. Bundle adjustment. CV Online.

Category:Geometry in computer vision Category:Geodesy Category:Photogrammetry Category:Surveying Category:Cartography

de:Bündelblockausgleichung

This text is licensed under the Creative Commons CC-BY-SA License. This text was originally published on Wikipedia and was developed by the Wikipedia community.

Affiliated Video Suggestions

The World News (WN) Network, has created this privacy statement in order to demonstrate our firm commitment to user privacy. The following discloses our information gathering and dissemination practices for wn.com, as well as e-mail newsletters.

1. Personal Information Collection and Use

We do not collect personally identifiable information about you, except when you provide it to us. For example, if you submit an inquiry to us or sign up for our newsletter, you may be asked to provide certain information such as your contact details (name, e-mail address, mailing address, etc.).

When you submit your personally identifiable information through wn.com, you are giving your consent to the collection, use and disclosure of your personal information as set forth in this Privacy Policy. If you would prefer that we not collect any personally identifiable information from you, please do not provide us with any such information. We will not sell or rent your personally identifiable information to third parties without your consent, except as otherwise disclosed in this Privacy Policy.

Except as otherwise disclosed in this Privacy Policy, we will use the information you provide us only for the purpose of responding to your inquiry or in connection with the service for which you provided such information. We may forward your contact information and inquiry to our affiliates and other divisions of our company that we feel can best address your inquiry or provide you with the requested service. We may also use the information you provide in aggregate form for internal business purposes, such as generating statistics and developing marketing plans. We may share or transfer such non-personally identifiable information with or to our affiliates, licensees, agents and partners.

We may retain other companies and individuals to perform functions on our behalf. Such third parties may be provided with access to personally identifiable information needed to perform their functions, but may not use such information for any other purpose.

In addition, we may disclose any information, including personally identifiable information, we deem necessary, in our sole discretion, to comply with any applicable law, regulation, legal proceeding or governmental request.

2. E-mail addresses

We do not want you to receive unwanted e-mail from us. We try to make it easy to opt-out of any service you have asked to receive. If you sign-up to our e-mail newsletters we do not sell, exchange or give your e-mail address to a third party.

E-mail addresses are collected via the wn.com web site. Users have to physically opt-in to receive the wn.com newsletter and a verification e-mail is sent. wn.com is clearly and conspicuously named at the point of

collection.

If you no longer wish to receive our newsletter and promotional communications, you may opt-out of receiving them by following the instructions included in each newsletter or communication or by e-mailing us at michaelw(at)wn.com

The security of your personal information is important to us. We follow generally accepted industry standards to protect the personal information submitted to us, both during registration and once we receive it. No method of transmission over the Internet, or method of electronic storage, is 100 percent secure, however. Therefore, though we strive to use commercially acceptable means to protect your personal information, we cannot guarantee its absolute security.

If we decide to change our e-mail practices, we will post those changes to this privacy statement, the homepage, and other places we think appropriate so that you are aware of what information we collect, how we use it, and under what circumstances, if any, we disclose it.

If we make material changes to our e-mail practices, we will notify you here, by e-mail, and by means of a notice on our home page.

3. Third Party Advertisers

The advertising banners and other forms of advertising appearing on this Web site are sometimes delivered to you, on our behalf, by a third party. In the course of serving advertisements to this site, the third party may place or recognize a unique cookie on your browser. For more information on cookies, you can visit www.cookiecentral.com.

4. Business Transfers

As we continue to develop our business, we might sell certain aspects of our entities or assets. In such transactions, user information, including personally identifiable information, generally is one of the transferred business assets, and by submitting your personal information on Wn.com you agree that your data may be transferred to such parties in these circumstances.

Make changes yourself !