[2] Scharstein D, Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms[J]. International Journal of Computer Vision, 47, 7-42(2002).
[3] Veksler O. Stereo correspondence by dynamic programming on a tree[C]. //2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), June 20-25, 2005, San Diego, CA, USA., 384-390(2005).
[5] Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using graph cuts[C]. //Proceedings Eighth IEEE International Conference on Computer Vision ICCV 2001, July 7-14, 2001, Vancouver, BC, Canada., 508-515(2001).
[7] Lim J, Kim Y, Lee S. A census transform-based robust stereo matching under radiometric changes[C]. //2016 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA), December 13-16, 2016, Jeju, Korea (South)., 1-4(2016).
[10] Fan H R, Yang F, Pan X R et al. Stereo matching algorithm for improved census transform and gradient fusion[J]. Acta Optica Sinica, 38, 0215006(2018).
[11] Mei X, Sun X, Zhou M C et al. On building an accurate stereo matching system on graphics hardware[C]. //2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops), November 6-13, 2011, Barcelona, Spain., 467-474(2011).
[14] Chang X F, Zhou Z, Wang L et al. Real-time accurate stereo matching using modified two-pass aggregation and winner-take-all guided dynamic programming[C]. //2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission, May 16-19, 2011, Hangzhou, China., 73-79(2011).
[18] Hirschmuller H. Accurate and efficient stereo processing by semi-global matching and mutual information[C]. //2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), June 20-25, 2005, San Diego, CA, USA., 807-814(2005).