A Fast Stereo Matching Algorithm Based on Fixed-Window

Abstract

This paper presents a fast local stereo algorithm that suitable to real time applications. Thanks to the techniques like Box-filtering, fixed-window-based stereo matching algorithms can be really fast, but perform not well in some areas, i.e. the repetitive pattern and low texture areas. In order to improve the reliability of fixed-window algorithm and keep the algorithms speed, the proposed approach can deal with the repetitive pattern and low texture areas at a small computational cost. Experimental results show that the proposed approach provides a big improvement in accuracy compare to fixed-window algorithm, and the speed of the algorithm is still fast.