Abstract
We propose a new approach to stereo matching for obstacle detection in the autonomous navigation framework. An accurate but slow reconstruction of the 3D scene is not needed; rather, it is more important to have a fast localization of the obstacles to avoid them. All the methods in the literature, based on a punctual stereo matching, are ineffective in realistic contexts because they are either computationally too expensive, or unable to deal with the presence of uniform patterns, or of perturbations between the left and right images. Our idea is to face the stereo matching problem as a matching between homologous regions. The stereo images are represented as graphs and a graph matching is computed to find homologous regions. Our method is strongly robust in a realistic environment, requires little parameter tuning, and is adequately fast, as experimentally demonstrated in a comparison with the best algorithms in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
De Souza, G.N., Kak, A.C.: Vision for Mobile Robot Navigation: A Survey. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(2), 237–267 (2002)
Bertozzi, M., Broggi, A., Fascioli, A.: Vision-based intelligent vehicles: State of the art and perspectives. Robotics and Autonomous Systems 32, 1–16 (2000)
Kastrinaki, V., Zervakis, M., Kalaitzakis, K.: A survey of video processing techniques for traffic applications. Image and Vision Computing 21, 359–381 (2003)
Scharstein, D., Szeliski, R.: A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. International Journal of Computer Vision 47(1), 7–42 (2002)
Zhang, C.: A Survey on Stereo Vision for Mobile Robots. Technical report, Dept. of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, 15213, USA (2002)
Kanade, T., Okutomi, M.: A stereo matching algorithm with an adaptive window: Theory and experiment. IEEE Transaction on Pattern Analysis and Machine Intelligence 16(9), 920–932 (1994)
Fusiello, A., Roberto, V.: Efficient stereo with multiple windowing. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Puerto Rico, pp. 858–863. IEEE Computer Society Press, Los Alamitos (1997)
Veksler, O.: Stereo matching by compact windows via minimum ratio cycle. In: Proceedings of the International Conference on Computer Vision, Vancouver, Canada, vol. I, pp. 540–547 (2001)
Marr, D., Poggio, T.A.: Cooperative computation of stereo disparity. Science 194(4262), 283–287 (1976)
Zitnick, C.L., Kanade, T.: A cooperative algorithm for stereo matching and occlusion detection. IEEE Transaction on Pattern Analysis and Machine Intelligence 22(7), 675–684 (2000)
Geiger, D., Ladendorf, B., Yuille, A.: Occlusions and binocular stereo. International Journal of Computer Vision 14, 211–226 (1995)
Roy, S.: Stereo without epipolar lines: A maximum-flow formulation. International Journal of Computer Vision 34(2/3), 1–15 (1999)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transaction on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Marr, D., Poggio, T.A.: A computational theory of human stereo vision. RoyalP B(204), 301–328 (1979)
Grimson, W.E.L.: A computer implementation of a theory of human stereo vision. Royal B(292), 217–253 (1981)
Candocia, F., Adjouadi, M.: A similarity measure for stereo feature matching. IEEE Transaction on Image Processing 6, 1460–1464 (1997)
Tao, H., Sawhney, H.S.: Global matching criterion and color segmentation based stereo. In: WACV 2000, pp. 246–253 (2000)
Scharstein, D., Szeliski, R.: High-accuracy stereo depth maps using structured light. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Madison, WI, vol. 1, pp. 195–202 (2003)
Baier, H., Lucchesi, C.L.: Matching Algorithms for Bipartite Graphs. Technical Report DCC-03/93, DCC-IMECC-UNICAMP, Brazil (1993)
Kuhn, H.W.: The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly 2, 83–97 (1955)
Konolige, K.: (2006) Web site. http://www.ai.sri.com/software/SVS
Konolige, K.: Small vision systems: hardware and implementation. In: Intl. Symp. On Robotics Research, pp. 111–116 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Foggia, P., Jolion, JM., Limongiello, A., Vento, M. (2007). Stereo Vision for Obstacle Detection: A Graph-Based Approach. In: Escolano, F., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2007. Lecture Notes in Computer Science, vol 4538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72903-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-72903-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72902-0
Online ISBN: 978-3-540-72903-7
eBook Packages: Computer ScienceComputer Science (R0)