Feature Based Color Stereo Matching Algorithm Using Restricted Search

  • Hajar Sadeghi
  • Payman Moallem
  • S. Amirhassan Monadjemi
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 27)


The reconstruction of a dynamic complex 3D scene from multiple images is a fundamental problem in the field of computer vision. Given a set of images of a 3D scene, in order to recover the lost third dimension, depth, it is necessary to extract the relationship between images through their correspondence. Reduction of the search region in stereo correspondence can increase the performances of the matching process in both execution time and accuracy. In this study we employ edge-based stereo matching and hierarchical multiresolution techniques as fast and reliable methods, in which some matching constraints such as epipolar line, disparity limit, ordering, and limit of directional derivative of disparity are satisfied as well. The proposed algorithm has two stages: feature extraction and feature matching. We use color stereo images to increase the accuracy and link detected feature points into chains. Then the matching process is completed by comparing some of the feature points from different chains. We apply this new algorithm on some color stereo images and compare the results with those of gray level stereo images. The comparison suggests that the accuracy of our proposed method is increased around 20–55%.


Feature Point Stereo Match Epipolar Line Stereo Correspondence Stereo Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Cabani I, Toulminet G, Bensrhair A (2006) A fast and self-adaptive color stereo vision matching; a first step for road obstacle detection. In: IEEE intelligent vehicles symposium. Tokyo, Japan, pp 58–63Google Scholar
  2. 2.
    Hua X, Yokomichi M, Kono M (2005) Stereo correspondence using color based on competitive-cooperative neural networks. Parallel and Distributed Computing, Applications and Technologies, 10.1109/PDCAT.2005.227, pp 856–860Google Scholar
  3. 3.
    Koschan A (1993) What is new in computational stereo since 1989: a survey on current stereo papers. Technical Report 93-22, Technical University of BerlinGoogle Scholar
  4. 4.
    Moallem P, Ashorian M, Mirzaeian B, Ataei M (2006) A novel fast feature based stereo matching algorithm with low invalid matching. WSEAS T Comput 5(3):469–477Google Scholar
  5. 5.
    Moallem P, Faez K, Haddadnia J (2002) Fast edge-based stereo matching algorithms through search space reduction. IEICE T Inf Syst E85-D(11-20021101):1859–1871Google Scholar
  6. 6.
    Moallem P, Faez K (2005) Effective parameters in search space reduction used in a fast edge-based stereo matching. J Circuit Syst Comput 14(2):249–266CrossRefGoogle Scholar
  7. 7.
    Tang B, Ait-Boudaoud D, Matuszewski BJ, Shark LK (2006) An efficient feature based matching algorithm for stereo images. In: Proceedings of the geometric modeling and imaging—new trends (GMAI’06), pp 195–202Google Scholar
  8. 8.
    Yang Q, Wang L, Yang R, Stewenius H, Nister D (2006) Stereo matching with color-weighted correlation, hierarchical belief propagation and occlusion handling. In: Computer Society conference on computer vision and pattern recognition—Volume 2 (CVPR’06), pp 2347–2354Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Hajar Sadeghi
    • 1
  • Payman Moallem
    • 1
  • S. Amirhassan Monadjemi
    • 1
  1. 1.Faculty of Engineering, University of IsfahanIsfahanIran

Personalised recommendations