Probabilistic analysis of incremental light bundle adjustment

This paper presents a probabilistic analysis of the recently introduced incremental light bundle adjustment method (iLBA) [6]. In iLBA, the observed 3D points are algebraically eliminated, resulting in a cost function with only the camera poses as variables, and an incremental smoothing technique is applied for efficiently processing incoming images. While we have already showed that compared to conventional bundle adjustment (BA), iLBA yields a significant improvement in computational complexity with similar levels of accuracy, the probabilistic properties of iLBA have not been analyzed thus far. In this paper we consider the probability distribution that corresponds to the iLBA cost function, and analyze how well it represents the true density of the camera poses given the image measurements. The latter can be exactly calculated in bundle adjustment (BA) by marginalizing out the 3D points from the joint distribution of camera poses and 3D points. We present a theoretical analysis of the differences in the way that LBA and BA use measurement information. Using indoor and outdoor datasets we show that the first two moments of the iLBA and the true probability distributions are very similar in practice.

[1]  Jan-Michael Frahm,et al.  Relative Bundle Adjustment Based on Trifocal Constraints , 2010, ECCV Workshops.

[2]  Frank Dellaert,et al.  iSAM: Incremental Smoothing and Mapping , 2008, IEEE Transactions on Robotics.

[3]  Ehud Rivlin,et al.  Real-Time Vision-Aided Localization and Navigation Based on Three-View Geometry , 2012, IEEE Transactions on Aerospace and Electronic Systems.

[4]  Steven M. Seitz,et al.  Photo tourism: exploring photo collections in 3D , 2006, ACM Trans. Graph..

[5]  Frank Dellaert,et al.  iSAM2: Incremental smoothing and mapping using the Bayes tree , 2012, Int. J. Robotics Res..

[6]  Ehud Rivlin,et al.  Navigation Performance Enhancement using Online Mosaicking , 2010 .

[7]  Frank Dellaert,et al.  Incremental Light Bundle Adjustment , 2012, BMVC.

[8]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[9]  Richard Szeliski,et al.  Skeletal graphs for efficient structure from motion , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Frank Dellaert,et al.  Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing , 2006, Int. J. Robotics Res..

[11]  Frank Dellaert,et al.  The Bayes Tree: An Algorithmic Foundation for Probabilistic Robot Mapping , 2010, WAFR.

[12]  Kurt Konolige,et al.  Sparse Sparse Bundle Adjustment , 2010, BMVC.

[13]  S. Shankar Sastry,et al.  Two-View Multibody Structure from Motion , 2005, International Journal of Computer Vision.

[14]  Jennifer A. Scott,et al.  Algorithm 891: A Fortran virtual memory system , 2009, TOMS.

[15]  Manolis I. A. Lourakis,et al.  SBA: A software package for generic sparse bundle adjustment , 2009, TOMS.

[16]  Frank Dellaert,et al.  Out-of-Core Bundle Adjustment for Large-Scale 3D Reconstruction , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[17]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[18]  Kurt Konolige,et al.  FrameSLAM: From Bundle Adjustment to Real-Time Visual Mapping , 2008, IEEE Transactions on Robotics.

[19]  Pedro E. López-de-Teruel,et al.  Reduced epipolar cost for accelerated incremental SfM , 2011, CVPR 2011.

[20]  V. Indelman Bundle adjustment without iterative structure estimation and its application to navigation , 2012, Proceedings of the 2012 IEEE/ION Position, Location and Navigation Symposium.