Abstract A wide range of low level vision problems have been for-mulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest en-ergy configuration). Perhaps the most successful example is stereo vision. For the stereo problem, it has been shown thatfinding the global optimum is NP hard but good results have been obtained using a number of approximate optimizationalgorithms.