Effective Parameters in Search Space Reduction Used in a Fast Edge-based Stereo Matching

Reduction of search region in stereo correspondence can increase performances of the matching process, in the context of execution time and accuracy. For an edge-based stereo matching, we establish relationships between the search space and the parameters like relative displacement of edges, disparity under consideration, image resolution, CCD (Charge-Coupled Device) dimension and focal length of the stereo system. Then, we propose a novel matching strategy for the edge-based stereo. Afterward, we develop a fast edge-based stereo algorithm with combination of the obtained matching strategy and a multiresolution technique using Haar wavelet. Considering the conventional multiresolution technique using Haar wavelet, the execution times of our proposed method are decreased between 26% to 47% in the feature matching stage. Moreover, the execution time of the overall algorithms (including feature extraction and feature matching) is decreased between 15% to 20%. Theoretical investigation and experimental results show that our algorithm has a very good performance; therefore this new algorithm is very suitable for fast edge-based stereo applications like stereo robot vision.

[1]  J P Frisby,et al.  PMF: A Stereo Correspondence Algorithm Using a Disparity Gradient Limit , 1985, Perception.

[2]  Charles V. Stewart,et al.  Geometric constraints and stereo disparity computation , 1996, International Journal of Computer Vision.

[3]  Joachim M. Buhmann,et al.  Real-time phase-based stereo for a mobile robot , 1996, Proceedings of the First Euromicro Workshop on Advanced Mobile Robots (EUROBOT '96).

[4]  Karim Faez,et al.  Fast Edge-Based Stereo Matching Algorithms through Search Space Reduction , 2002 .

[5]  Karim Faez,et al.  Fast edge-based stereo matching algorithm based on search space reduction , 2002, Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing.

[6]  Shuichi Tanaka,et al.  A rule-based approach to binocular stereopsis , 1988 .

[7]  Karim Faez,et al.  Reduction of the search space region in the edge based stereo correspondence , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[8]  Karim Faez,et al.  Search Space Reduction in the Edge Based Stereo Correspondence , 2001, VMV.

[9]  Wolfgang Ponweiser,et al.  RobVision: vision based navigation for mobile robots , 2001, Conference Documentation International Conference on Multisensor Fusion and Integration for Intelligent Systems. MFI 2001 (Cat. No.01TH8590).

[10]  Jukka Heikkonen,et al.  Multi-resolution matching of uncalibrated images utilizing epipolar geometry and its uncertainty , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[11]  J. Mayhew,et al.  Disparity Gradient, Lipschitz Continuity, and Computing Binocular Correspondences , 1985 .

[12]  John Riley,et al.  Exploiting Walsh-based attributes to stereo vision , 1996, IEEE Trans. Signal Process..

[13]  Charles V. Stewart,et al.  On the derivation of geometric constraints in stereo , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Yoshiaki Shirai,et al.  Three-Dimensional Computer Vision , 1987, Symbolic Computation.

[15]  Herbert Jahn.  Parallel epipolar stereo matching , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

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

[17]  Wilfried Brauer,et al.  Intensity- and Gradient-Based Stereo Matching Using Hierarchical Gaussian Basis Functions , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Ze-Nian Li,et al.  Analysis of disparity gradient based cooperative stereo , 1996, IEEE Trans. Image Process..

[19]  B. Julesz,et al.  A disparity gradient limit for binocular fusion. , 1980, Science.