2[1]Okutomi M and Kanade T, A multiple-baseline stereo [A]. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition[C], Osaka, Japan, 1991:63-69.
3[2]Kanada T and Okutomi M, A stereo matching algorithm with an adptive window: theory and experiment [J]. IEEE Transactions on Pattern Analysis and machine Intelligence, 1994, 16(9): 920-932.
4[3]Lew M S and Huang T S, Learning and feature selection in stereo matching [J]. IEEE Transaction on Pattern Analysis and machine Intelligence, 1994, 16(9): 869-881.
5[4]Hu X and Ahuja N, matching point features with ordered geometric, rigidity, and disparity constrains [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1994, 16(10): 1041-1049.
6[5]Chen Y S, Hung Y H and Fuh C S, Fast block matching algorithm based on the winner-update strategy [J]. IEEE Transactions on Image Processing, 2001, 10(8): 1212-1222.
7[6]Okutomi M, Kanade T, A locally adaptive window for signal matching [A]. In: Proceedings of the Third International Conference on Computer Vision [C], Osaka, Japan, 1990: 190-199.
8[7]Atallah M J, Faster image template matching in the sum of the absolute value of differences measure [J]. IEEE Trans. on Image Processing, 2001,10(4): 659-663.
9[8]Brunig M, Niehsen W, Fast full-search block matching [J]. IEEE Trans. on Circuits and Systems for Video Technology, 2001,11(2): 241-247.
10[9]Kweon J J, Kang K and Kim S D, A stereo matching algorithm using line segment features [A]. In: Fourth IEEE Region 10 International Conference, TENCON '89 [C], Bombay, India, 1989:589-592.
