high performance computing on graphics processing units: hgpu.org

In this paper, we propose a real-time stereo matching method based on adaptive window, aiming at the trade-off between accuracy and efficiency in current local stereo matching, Considering that the Census transform has good adaptability to image amplitude distortion, but may introduce matching ambiguities in regions with noise or similar local structures, we combine the Census transform with AD (absolute differences) for matching cost initialization, and adopt an iterative cost aggregation method based on ESAW (exponential step adaptive weight), in order to improve the parallelism and execution efficiency. Furthermore, in disparity refinement stage, we build adaptive window based on pixel’s color similarity and Euclidean distance for each unreliable point. and classify the unreliable points as "occlusion" and "mismatch", so different refinement strategies could be taken for different classifications. Finally the proposed method is optimized with CUDA (compute unified device architecture) and evaluated on graphic processor. The experiment results show that the proposed method is the most accurate one compared with real-time stereo matching methods listed on the Middlebury stereo benchmark.