Share Email Print

Journal of Electronic Imaging

Stereo matching via selective multiple windows
Author(s): Satyajit Adhyapak; Nasser Kehtarnavaz; Mihai Nadin
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window correlation algorithm for stereo matching is presented which addresses the problems associated with a fixed window size. The developed algorithm differs from the previous multiple window algorithms by introducing a reliability test to select the most reliable window among multiple windows of increasing sizes. This ensures that at least one window is large enough to cover a region of adequate intensity variations while at the same time small enough to cover a constant depth region. A recursive computation procedure is also used to allow a computationally efficient implementation of the algorithm. The outcome obtained from a standard set of images with known disparity maps shows that the generated disparity maps are more accurate as compared to two popular stereo matching local algorithms.

Paper Details

Date Published: 1 January 2007
PDF: 14 pages
J. Electron. Imag. 16(1) 013012 doi: 10.1117/1.2711817
Published in: Journal of Electronic Imaging Volume 16, Issue 1
Show Author Affiliations
Satyajit Adhyapak, The Univ. of Texas at Dallas (United States)
Nasser Kehtarnavaz, The Univ. of Texas at Dallas (United States)
Mihai Nadin, The Univ. of Texas at Dallas (United States)

© SPIE. Terms of Use
Back to Top