Comparing the mean field method and belief propagation for approximate inference in MRFs, Weiss Y. To appear in Saad and Opper (ed) Advanced Mean Field Methods. MIT Press. (gzipped postscript 89K)

Program information: MaxFlow-v3.01.zip, C/C++ source, Ver. 3.01, 2010/01

Reference papers: Boykov-Kolmogorov algorithm, B-K algorithm Yuri Boykov and Vladimir Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1124-1137, 2004.

Implementated methods: Graph Cut

Multi-Label Optimization

Program information: gco-v3.0.zip, C/C++ source with Matlab wrapper, Ver. 3.0, 2010/08

Reference papers:

Y. Boykov, O. Veksler, R. Zabin, "Fast Approximate Energy Minimization via Graph Cuts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, 2001.

Yuri Boykov and Vladimir Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1124-1137, 2004.

Andrew Delong · Anton Osokin · Hossam N. Isack · Yuri Boykov, "Fast Approximate Energy Minimization with Label Costs" International Journal of Computer Vision, 2011.

Vladimir Kolmogorov, Ramin Zabih, "What Energy Functions Can Be Minimized via Graph Cuts?" IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147-158, 2004.

Program information:MRF16.zip: C/C++ , Ver. 1.6, 2006

Reference papers:A Comparative Study of Energy Minimization Methods for Markov Random Fields R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. In Ninth European Conference on Computer Vision(ECCV 2006), volume 2, pages 19-26, Graz, Austria, May 2006.

Markov Random FieldIntroduction/Tutorial
Applications
Algorithm (Energy Minimization)
Graph Cut
ICM
Belief Propagation
Library/Open Source
Graph Cut Optimization
Books

## Table of Contents

Introduction/TutorialApplications## Algorithm (Energy Minimization)

## Graph Cut

## ICM

Belief PropagationLibrary/Open SourceGraph Cut OptimizationMax-Flow/Min-CutProgram information: MaxFlow-v3.01.zip,C/C++ source, Ver. 3.01, 2010/01Reference papers: Boykov-Kolmogorov algorithm, B-K algorithm Yuri Boykov and Vladimir Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision,"IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1124-1137, 2004.Implementated methods:Graph CutMulti-Label OptimizationProgram information:gco-v3.0.zip, C/C++ source with Matlab wrapper, Ver. 3.0, 2010/08Reference papers:Y. Boykov, O. Veksler, R. Zabin, "Fast Approximate Energy Minimization via Graph Cuts,"IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, 2001.Yuri Boykov and Vladimir Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision,"IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1124-1137, 2004.Andrew Delong · Anton Osokin · Hossam N. Isack · Yuri Boykov, "Fast Approximate Energy Minimization with Label Costs"International Journal of Computer Vision, 2011.Vladimir Kolmogorov, Ramin Zabih, "What Energy Functions Can Be Minimized via Graph Cuts?"IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147-158, 2004.Implementated methods:Graph CutProgram information:MRF16.zip: C/C++ , Ver. 1.6, 2006Reference papers:A Comparative Study of Energy Minimization Methods for Markov Random Fields R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. InNinth European Conference on Computer Vision(ECCV 2006), volume 2, pages 19-26, Graz, Austria, May 2006.Implementated methods:ICM, Graph Cut, Max-Product Belief Propagation## Books