Share Email Print

Proceedings Paper

Fast algorithm for obtaining dense depth maps for high-speed navigation
Author(s): Payman Khalili; Ramesh C. Jain
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Typical stereo algorithms produce sparse depth maps. The depth points often lie on object boundaries and thus obstacles cannot be distinguished from holes. Surface reconstruction algorithms work poorly with such sparse and irregularly spaced data points. We present an algorithm which uses intensity images and a sparse depth map to produce a depth map which can be used for navigation. Our approach is based on an intensity image segmentation algorithm followed by local surface fitting. The algorithm is fast and thus suitable for high speed navigation. Results using laboratoty images are presented.

Paper Details

Date Published: 1 March 1991
PDF: 12 pages
Proc. SPIE 1388, Mobile Robots V, (1 March 1991); doi: 10.1117/12.25469
Show Author Affiliations
Payman Khalili, Univ. of Michigan (United States)
Ramesh C. Jain, Univ. of Michigan (United States)

Published in SPIE Proceedings Vol. 1388:
Mobile Robots V
Wendell H. Chun; William J. Wolfe, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?