Fast edge-based stereo matching approach for road applications

Several vision-based road applications use stereo vision algorithms, and they generally must be fast to be applied in real time. The main problem in stereo vision is the stereo matching problem, which consists in finding correspondences between two stereo images. In this paper, we present a new fast edge-based stereo matching approach devoted to road applications. Two passes of the dynamic programming algorithm are applied to estimate the final disparity map. The matching results of the first pass are only exploited to compute an initial disparity map (IDM). The so-called guiding edge points (GEPs) together with disparity ranges, i.e., possible matches, are derived from the IDM. In the second pass, the disparity ranges are used to reduce the search space as well as the mismatches and the GEPs to control and guide the matching process to the optimal solution. The proposed method has been tested on both real and virtual stereo images, it has been compared to a recently proposed method, and the results are satisfactory.

[1]  U. Raghavendra,et al.  Anchor-diagonal-based shape adaptive local support region for efficient stereo matching , 2015, Signal Image Video Process..

[2]  Ze-Nian Li Stereo Correspondence Based on Line Matching in Hough Space Using Dynamic Programming , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[3]  Narendra Ahuja,et al.  A constant-space belief propagation algorithm for stereo matching , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Ruigang Yang,et al.  How Far Can We Go with Local Optimization in Real-Time Stereo Matching , 2006, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06).

[6]  George Bebis,et al.  Temporal consistent fast stereo matching for advanced driver assistance systems (ADAS) , 2010, 2010 IEEE Intelligent Vehicles Symposium.

[7]  Jonas Witt,et al.  Sparse stereo by edge-based search using dynamic programming , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).

[8]  Olga Veksler,et al.  Stereo correspondence by dynamic programming on a tree , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[9]  Maximilian Buder Dense real-time stereo matching using memory efficient semi-global-matching variant based on FPGAs , 2012, Real-Time Image and Video Processing.

[10]  Kwanghoon Sohn,et al.  Disparity search range estimation based on dense stereo matching , 2013, 2013 IEEE 8th Conference on Industrial Electronics and Applications (ICIEA).

[11]  George Bebis,et al.  Fast spatio-temporal stereo for intelligent transportation systems , 2012, Pattern Analysis and Applications.

[12]  Alfred Schmitt,et al.  Real-Time Stereo by using Dynamic Programming , 2003, 2004 Conference on Computer Vision and Pattern Recognition Workshop.

[13]  Heiko Hirschmüller,et al.  Stereo Processing by Semiglobal Matching and Mutual Information , 2008, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  David J. Kriegman,et al.  Moving in stereo: Efficient structure and motion using lines , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[15]  George Bebis,et al.  A real-time spatio-temporal stereo matching for road applications , 2011, 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[16]  Abder Koukam,et al.  A voting stereo matching method for real-time obstacle detection , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[17]  Jake K. Aggarwal,et al.  Structure from stereo-a review , 1989, IEEE Trans. Syst. Man Cybern..

[18]  Miao Liao,et al.  High-Quality Real-Time Stereo Using Adaptive Cost Aggregation and Dynamic Programming , 2006, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06).

[19]  Dah-Jye Lee,et al.  Review of stereo vision algorithms and their suitability for resource-limited systems , 2013, Journal of Real-Time Image Processing.

[20]  Sehoon Yea,et al.  Disparity search range estimation: Enforcing temporal consistency , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[21]  Antonio M. López,et al.  Embedded Real-time Stereo Estimation via Semi-Global Matching on the GPU , 2016, ICCS.

[22]  Jean-Philippe Tarel,et al.  Real time obstacle detection in stereovision on non flat road geometry through "v-disparity" representation , 2002, Intelligent Vehicle Symposium, 2002. IEEE.

[23]  José Muñoz,et al.  A dense disparity map of stereo images , 1997, Pattern Recognit. Lett..

[24]  Wen Gao,et al.  Local Stereo Matching with Improved Matching Cost and Disparity Refinement , 2014, IEEE MultiMedia.

[25]  Abdelaziz Bensrhair,et al.  Temporal consistent real-time stereo for intelligent vehicles , 2010, Pattern Recognit. Lett..

[26]  Yi Deng,et al.  A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming , 2006, ECCV.

[27]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[28]  Olga Veksler,et al.  Fast variable window for stereo correspondence using integral images , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[29]  Darius Burschka,et al.  Advances in Computational Stereo , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[30]  Ramakant Nevatia,et al.  Segment-based stereo matching , 1985, Comput. Vis. Graph. Image Process..

[31]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[32]  Ming Zhu,et al.  Obstacle detection in single images with deep neural networks , 2016, Signal Image Video Process..

[33]  Francisco Madrigal,et al.  Improving multiple pedestrians tracking with semantic information , 2014 .

[34]  Mohamed El Ansari,et al.  Traffic sign detection and recognition based on random forests , 2016, Appl. Soft Comput..

[35]  Martin A. Fischler,et al.  Computational Stereo , 1982, CSUR.

[36]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.

[37]  Minglun Gong,et al.  Fast Unambiguous Stereo Matching Using Reliability-Based Dynamic Programming , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[38]  Lisa M. Brown,et al.  A survey of image registration techniques , 1992, CSUR.

[39]  Andreas Klaus,et al.  Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure , 2006, 18th International Conference on Pattern Recognition (ICPR'06).