1J. Cech, R. Sara. Efficient sampling of disparity space for fast and accurate matching [C]. IEEE Proceedings of the Second International ISPRS Workshop (BenGOS 2007), Minneapolis, MN, USA, June 23, 2007. 1-8.
2P. F. Felzenszwalb, R. Zabih. Dynamic programming and graph cut algorithms in computer vision [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011, 33 (4): 721-740.
3R. Szelisk, I. R. Zabih. An experimental comparison of stereo algorithms [C]. Proceedings of the International Workshop on Vision Algorithms: Theory and Practice, 2000. 1883:1-19.
4M. Bleyer, M. Gelautz. Graph-cut-based stereo matching using image segmentation with symmetrical treatment of occlusions [J]. Signal Processing : Image Communication, 2007, 22 (2) : 127-143.
5T. H. Cormen, C. E. Leiserson, R. L. Rivest et al.. Introduction to Algorithms (2nd Ed. ) [M]. MIT Press, 2001. 348-352.
6D. Scharstein, R. Szeliski. A taxonomy and evaluation of dense two frame stereo correspondence algorithms [J]. InternationalJ. Computer Vision, 2002, 47(1-3): 7-42.
7V. Kolmogorov, R. Zabih. Multi-camera scene reconstruction via graph cuts [ C]. Proceedings of the Seventh European Conference on Computer Vision (ECCV 2002), 2002, 3:82-96.
8C. M. Bishop. Pattern Recognition and Machine Learning (Information Science and Statistics)[M]. Springer, 2006.
9J. D. Lafferty, A. McCallum, F. C. N. Pereira. Conditional random fields- probabilistic models for segmenting and labeling sequence data[C]. Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), 2001. 282-289.
