SearcharxivSearch

arXiv · 1111.1400

Student's T Robust Bundle Adjustment Algorithm

Abstract

Bundle adjustment (BA) is the problem of refining a visual reconstruction to produce better structure and viewing parameter estimates. This problem is often formulated as a nonlinear least squares problem, where data arises from interest point matching. Mismatched interest points cause serious problems in this approach, as a single mismatch will affect the entire reconstruction. In this paper, we propose a novel robust Student's t BA algorithm (RST-BA). We model reprojection errors using the heavy tailed Student's t-distribution, and use an implicit trust region method to compute the maximum a posteriori (MAP) estimate of the camera and viewing parameters in this model. The resulting algorithm exploits the sparse structure essential for reconstructing multi-image scenarios, has the same time complexity as standard L2 bundle adjustment (L2-BA), and can be implemented with minimal changes to the standard least squares framework. We show that the RST-BA is more accurate than either L2-BA or L2-BA with a sigma-edit rule for outlier removal for a range of simulated error generation scenarios. The new method has also been used to reconstruct lunar topography using data from the NASA Apollo 15 orbiter, and we present visual and quantitative comparisons of RST-BA and L2-BA methods for this application. In particular, using the RST-BA algorithm we were able to reconstruct a DEM from unprocessed data with many outliers and no ground control points, which was not possible with the L2-BA method.

Explore related subjects

Keep this discovery

BibTeXRIS

Aleksandr Y. Aravkin, Michael Styer, Zachary Moratto, Ara Nefian, Michael Broxton. 2011-11-06. Student's T Robust Bundle Adjustment Algorithm. https://arxiv.org/abs/1111.1400

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO