Stereo matching via selective multiple windows

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

• Type: Journal
• Year: 2007
• Where: JEI
• Authors: Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mihai Nadin
• Keywords: Algorithm, JEI 2007, Multiple Window Correlation, Multiple Windows