[1] [1] SCHARSTEIN D,SZELISKI R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms[J]. International Journal of Computer Vision,2002,47(1-3):7-42.

[2] [2] XIE SH R. Novel stereo matching algorithm based on pair-wise DNA alignment algorithm in bioinformatics and its implementation[J]. Opt. Precision Eng .,2007,15(1):106-111. (in Chinese)

[3] [3] WANG X,MA Y,YANG J,et al.. Implementation and improvement of area-based stereo matching algorithm[J]. Opt. Precision Eng.,2008,16(10):2002-2007. (in Chinese)

[4] [4] SUN J,ZHENG N N,SHUM H Y. Stereo matching using belief propagation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2003,25(7):1-14.

[5] [5] YIN CH L,XIANG CH B,SONG J ZH,et al.. Fast stereo matching algorithm based on adaptive window and graph cuts[J]. Opt. Precision Eng.,2008,16(6):1017-1121. (in Chinese)

[6] [6] BOYKOV Y,VEKSLER O,ZABIH R. Fast approximate energy minimization via graph cuts[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2001,23(11):1222-1239.

[7] [7] ZHOU X ZH,WEN G J,WANG R SH. Fast stereo matching using adaptive window[J].Chinese Journal of Computers,2006,29(3):473-479. (in Chinese)

[8] [8] VEKSLER O. Fast variable window for stereo correspondence using intergral image[C]. IEEE Computer Society Conference on Computer Vision and Pattern Recognition,Madison,WI,USA,2003:556-561.

[9] [9] BIRCHFIELD S,TOMASI C. Depth discontinuities by pixel-to-pixel stereo[J]. International Journal of Computer Vision,1999,35(3):269-293.

[10] [10] FORSTMANN S,THURING S,KAUNOU Y,et al.. Real-time stereo by using dynamic programming[C]. IEEE Computer Society Conference on Computer Vision and Pattern Recognition,Washington,DC,USA,2004:29-36.

[11] [11] KIM J C,LEE K M,CHOI B T,et al.. A dense stereo matching using two-pass dynamic programming with GGCPS[C]. IEEE Computer Society Conference on Computer Vision and Pattern Recognition,San Diego,CA,USA,2005:1075-1082