Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Incremental Estimation of Dense Depth Maps from Image Sequences

Larry Matthies, Richard Szeliski, and Takeo Kanade

Abstract

Kalman filtering has recently been proposed as a mechanism for obtaining on-line estimates of depth from motion sequences. Previous applications of Kalman filtering to depth from motion have been limited to estimating depth at the location of a sparse set of features. In this paper, we introduce a new, pixel-based (iconic) algorithm that estimates depth and depth uncertainty at each pixel and incrementally refines these estimates over time. We describe the algorithm for translations parallel to the image plane and contrast its formulation and performance to that of a feature-based Kalman filtering algorithm. We compare the performance of the two approaches by analyzing their theoretical convergence rates, by conducting quantitative experiments with images of a flat poster, and by conducting qualitative experiments with images of a realistic outdoor scene model. The results show that the new method is an effective way to extract depth from lateral camera translations and suggest that it will play an important role in low-level vision.

Details

Publication typeInproceedings
Published inIEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'88)
Pages366-374
AddressAnn Arbor, Michigan
PublisherIEEE Computer Society Press
> Publications > Incremental Estimation of Dense Depth Maps from Image Sequences