F. Besse, C. Rother, A. Fitzgibbon, and J. Kautz, PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation, Proc. BMVC, pp.132-133, 2012.

S. Birchfield and C. Tomasi, A pixel dissimilarity measure that is insensitive to image sampling, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.20, issue.4, pp.401-406, 1998.
DOI : 10.1109/34.677269

M. Bleyer and M. Gelautz, Simple but effective tree structures for dynamic programming-based stereo matching, Proc. VISAPP, pp.415-422, 2008.

Y. Boykov, O. Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.11, pp.1222-1239, 2001.
DOI : 10.1109/34.969114

Q. Chen and V. Koltun, Fast MRF Optimization with Application to Depth Reconstruction, 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp.3914-3921, 2014.
DOI : 10.1109/CVPR.2014.500

A. Drory, C. Haubold, S. Avidan, and F. A. Hamprecht, Semi-Global Matching: A Principled Derivation in Terms of Message Passing, Pattern Recognition, pp.43-53, 2014.
DOI : 10.1007/978-3-319-11752-2_4

P. Felzenszwalb and D. Huttenlocher, Efficient belief propagation for early vision, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004., pp.41-54, 2006.
DOI : 10.1109/CVPR.2004.1315041

P. Fua, A parallel stereo algorithm that produces dense depth maps and preserves image features. Machine Vision and Applications, pp.35-49, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00075191

A. Geiger, M. Roser, and R. Urtasun, Efficient Large-Scale Stereo Matching, Lecture Notes in Comput. Sci., volume, pp.25-38, 2011.
DOI : 10.1007/BFb0014497

R. I. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision, p.521623049, 2000.
DOI : 10.1017/CBO9780511811685

S. Hermann and R. Klette, Iterative Semi-Global Matching for Robust Driver Assistance Systems, In Lecture Notes in Comput. Sci. LNCS, vol.7726, pp.465-478, 2013.
DOI : 10.1007/978-3-642-37431-9_36

H. Hirschmüller, Stereo Processing by Semiglobal Matching and Mutual Information, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.2, pp.328-369, 2008.
DOI : 10.1109/TPAMI.2007.1166

H. Hirschmüller and D. Scharstein, Evaluation of Stereo Matching Costs on Images with Radiometric Differences, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.9, pp.1582-1599, 2009.
DOI : 10.1109/TPAMI.2008.221

V. Kolmogorov, Convergent Tree-Reweighted Message Passing for Energy Minimization, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.10, pp.1568-1583, 2006.
DOI : 10.1109/TPAMI.2006.200

V. Kolmogorov and R. Zabih, Computing visual correspondence with occlusions using graph cuts, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, pp.508-515, 2001.
DOI : 10.1109/ICCV.2001.937668

N. Komodakis, G. Tziritas, and N. Paragios, Fast, Approximately Optimal Solutions for Single and Dynamic MRFs, 2007 IEEE Conference on Computer Vision and Pattern Recognition, 2007.
DOI : 10.1109/CVPR.2007.383095

Y. Ohta and T. Kanade, Stereo by Two-level Dynamic Programming, International Joint Conference on Artificial Intelligence, pp.1120-1126, 1985.

J. Pearl, Probabilistic Reasoning in Intelligent Systems, 1988.

C. Rhemann, A. Hosni, M. Bleyer, C. Rother, and M. Gelautz, Fast cost-volume filtering for visual correspondence and beyond, CVPR 2011, pp.3017-3024, 2011.
DOI : 10.1109/CVPR.2011.5995372

D. Scharstein and R. Szeliski, A taxonomy and evaluation of dense two-frame stereo correspondence algorithms, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001), pp.7-42, 2002.
DOI : 10.1109/SMBV.2001.988771

D. Scharstein, H. Hirschmüller, Y. Kitajima, K. Krathwohl, N. Ne?i´cne?i´c et al., High-Resolution Stereo Datasets with Subpixel-Accurate Ground Truth, Pattern Recognition, pp.31-42, 2014.
DOI : 10.1007/978-3-319-11752-2_3

S. Sinha, D. Scharstein, and R. Szeliski, Efficient High-Resolution Stereo Matching Using Local Plane Sweeps, 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp.1582-1589, 2013.
DOI : 10.1109/CVPR.2014.205

C. Strecha, W. Von-hansen, L. Van-gool, P. Fua, and U. Thoennessen, On benchmarking camera calibration and multi-view stereo for high resolution imagery, 2008 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2008.
DOI : 10.1109/CVPR.2008.4587706

R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov et al., A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.6, pp.1068-1080, 2008.
DOI : 10.1109/TPAMI.2007.70844

M. F. Tappen and W. T. Freeman, Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters, Proceedings Ninth IEEE International Conference on Computer Vision, 2003.
DOI : 10.1109/ICCV.2003.1238444

J. Cech and R. ?ára, Efficient Sampling of Disparity Space for Fast And Accurate Matching, 2007 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2007.
DOI : 10.1109/CVPR.2007.383355

O. Veksler, Stereo Correspondence by Dynamic Programming on a Tree, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), pp.384-390, 2005.
DOI : 10.1109/CVPR.2005.334

R. Zabih and J. Woodfill, Non-parametric local transforms for computing visual correspondence, Proc. ECCV, pp.151-158, 1994.
DOI : 10.1007/BFb0028345

K. Zhu, P. D. Angelo, and M. Butenuth, Evaluation of stereo matching costs on close range, aerial and satellite images, Proc. ICPRAM, pp.379-385, 2012.