The Robotics Institute

Carnegie Mellon Robotics Institute

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

The authors introduce a novel pixel-based (iconic) algorithm that estimates depth and depth uncertainty at each pixel and incrementally refines these estimates over time. They 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. They 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 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.

Notes

Associated Center(s) / Consortia: Vision and Autonomous Systems Center

Text Reference

L. Matthies, R. Szeliski, and Takeo Kanade, "Incremental Estimation of Dense Depth Maps from Image Sequences," Proceedings of Computer Vision and Pattern Recognition (CVPR '98), June, 1988, pp. 366-374.

BibTeX Reference

@inproceedings{Kanade_1988_2431,
   author = "L. Matthies and R. Szeliski and Takeo Kanade",
   title = "Incremental Estimation of Dense Depth Maps from Image Sequences",
   booktitle = "Proceedings of Computer Vision and Pattern Recognition (CVPR '98)",
   pages = "366-374",
   month = "June",
   year = "1988",
}

The Robotics Institute

Menu