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...

Full description

Saved in:
Bibliographic Details
Published in:Signal, image and video processing image and video processing, 2017-02, Vol.11 (2), p.267-274
Main Authors: El Jaafari, Ilyas, El Ansari, Mohamed, Koutti, Lahcen
Format: Article
Language:English
Subjects:
Algorithms
Computer Imaging
Computer Science
Computer vision
Dynamic programming
Image Processing and Computer Vision
Matching
Multimedia Information Systems
Original Paper
Pattern Recognition and Graphics
Roads
Signal,Image and Speech Processing
Vision
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1863-1703
1863-1711
DOI:10.1007/s11760-016-0932-3