E. Boros and P. L. Hammer, Pseudo-Boolean optimization, Discrete Applied Mathematics, vol.123, issue.1-3, pp.155-225, 2002.
DOI : 10.1016/S0166-218X(01)00341-9
URL : https://hal.archives-ouvertes.fr/hal-01150533

Y. Boykov and M. Jolly, Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, pp.105-112, 2001.
DOI : 10.1109/ICCV.2001.937505

Y. Boykov and V. Kolmogorov, An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.9, pp.1124-1137, 2004.
DOI : 10.1109/TPAMI.2004.60

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6806

P. F. Felzenszwalb and D. P. 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.261-268, 2004.
DOI : 10.1109/CVPR.2004.1315041

D. Freedman and P. Drineas, Energy Minimization via Graph Cuts: Settling What is Possible, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), pp.939-946, 2005.
DOI : 10.1109/CVPR.2005.143

H. Ishikawa, Exact optimization for markov random fields with convex priors, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.10, pp.1333-1336, 2003.
DOI : 10.1109/TPAMI.2003.1233908

O. Juan and Y. Boykov, Active Graph Cuts, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Volume 1 (CVPR'06), pp.1023-1029, 2006.
DOI : 10.1109/CVPR.2006.47

P. Kohli, M. P. Kumar, and P. H. Torr, P 3 & beyond: Solving energies with higher order cliques, CVPR, 2007.
DOI : 10.1109/cvpr.2007.383204
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.2624

P. Kohli and P. H. Torr, Effciently solving dynamic Markov random fields using graph cuts, ICCV, pp.922-929, 2005.

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 C. Rother, Minimizing non-submodular functions with graph cuts: a review, PAMI, vol.29, issue.2, 2007.

V. Kolmogorov and R. Zabih, What energy functions can be minimized via graph cuts? PAMI, pp.147-159, 2004.

N. Komodakis, N. Paragios, and G. Tziritas, MRF Optimization via Dual Decomposition: Message-Passing Revisited, 2007 IEEE 11th International Conference on Computer Vision, 2007.
DOI : 10.1109/ICCV.2007.4408890
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.3345

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

I. Kovtun, Partial Optimal Labeling Search for a NP-Hard Subclass of (max,+) Problems, DAGM Symposium, pp.402-409, 2003.
DOI : 10.1007/978-3-540-45243-0_52

I. Kovtun, Image segmentation based on sufficient conditions for optimality in NP-complete classes of structural labeling problems, IRTC ITS Nat. Academy of Science Ukraine, 2004.

J. Pearl, Probabilistic reasoning in intelligent systems: Networks of plausible inference, 1998.

C. Rother, S. Kumar, V. Kolmogorov, and A. Blake, Digital Tapestry, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), pp.589-596, 2005.
DOI : 10.1109/CVPR.2005.130

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. Schlesinger and B. Flach, Transforming an arbitrary minsum problem into a binary one, 2006.

J. Shotton, J. M. Winn, C. Rother, and A. Criminisi, TextonBoost: Joint Appearance, Shape and Context Modeling for Multi-class Object Recognition and Segmentation, ECCV, pp.1-15, 2006.
DOI : 10.1007/11744023_1

R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov et al., A Comparative Study of Energy Minimization Methods for Markov Random Fields, ECCV, pp.16-29, 2006.
DOI : 10.1007/3-540-47977-5_58

M. J. Wainwright, T. Jaakkola, and A. S. Willsky, MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming, Zalesky. Efficient determination of Gibbs estimators with submodular energy functions, pp.3697-3717, 2003.
DOI : 10.1109/TIT.2005.856938
URL : http://www.ai.mit.edu/people/tommi/papers/WaiJaaWil_TRMAP_arxiv.pdf