Abstract

The stereo matching problem takes two images captured by nearby cameras and attempts to recover quantitative disparity information. Most of the existing stereo matching algorithms find it difficult to estimate disparity in the occlusion, discontinuities and textureless regions in the images. In the last few decades, a number of stereo matching methods have been proposed to overcome some of these problems. In the same line of thought, the authors propose a new feature‐based stereo matching method, which consists of four basic steps – feature‐based stereo correspondence, two‐pass cost aggregation, disparity computation using winner‐takes‐all selection and finally, the disparity refinement. In the proposed method, local features of Gabor wavelet in spatial domain are used for matching cost computation and subsequently a cost aggregation step is implemented by combined use of the Kuwahara filter and the median filter. Experimental results on the Middlebury benchmark database shows that the proposed method outperforms many existing local stereo matching methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call