Accurately tuned search space in a feature based stereo matching

Computations in a feature based stereo matching which is basically used for depth extraction are generally very high. These computations essentially include feature extraction and matching which feature matching is usually higher. For a feature-based stereo matching, we accurately tune the search space based on some stereo imaging parameters like the focal length with pixels scale, the displacement of features and the maximum disparity. We show that results of previous matches can be used to narrow down the search space to find current match. We use directional derivative of disparity as a temporary concept to tune the search space accurately. Then we develop a fast feature based stereo algorithm based on the proposed search space tuning and non-horizontal thinned edge points as feature. The execution time of the proposed algorithm is lower than other methods. Moreover the matching rate is also higher.

[1]  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).

[2]  Karim Faez,et al.  Effective Parameters in Search Space Reduction Used in a Fast Edge-based Stereo Matching , 2005, J. Circuits Syst. Comput..

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

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

[5]  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).