Graph cut as an optimization technique

Back when I was studying at UPMC, I was asked to wrote a survey on optimization technique using graph cuts. This survey focus on certain problems expressed as Markov Random Fields (MRF) and show different algorithms that you can choose from depending on the number of classes in your problem, the regularity term of your model and the complexity.

Unfortunately, it is only available in French. You can find it here.