Robust obstacle detection based on dense disparity maps

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Obstacle detection is an important component for many autonomous vehicle navigation systems. Several methods have been proposed using various active sensors such as radar, sonar and laser range finders. Vision based techniques have the advantage of relatively low cost and provide a large amount of information about the environment around an intelligent vehicle. This paper deals with the development of an accurate and efficient vision based obstacle detection method that relies on dense disparity estimation between a pair of stereo images. Firstly, the problem of disparity estimation is formulated as that of minimizing a quadratic objective function under various convex constraints arising from prior knowledge. Then, the resulting convex optimization problem is solved via a parallel block iterative algorithm which can be efficiently implemented on parallel computing architectures. Finally, we detect obstacles from the computed depth map by performing an object segmentation based on a surface orientation criterion. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Miled, W., Pesquet, J. C., & Parent, M. (2007). Robust obstacle detection based on dense disparity maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4739 LNCS, pp. 1142–1150). Springer Verlag. https://doi.org/10.1007/978-3-540-75867-9_143

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free