Graph Cuts for Energy Minimization

People

Yuri Boykov (Western Ontario)
Junhwan Kim (Samsung)
Vladimir Kolmogorov (University College London)
Olga Veksler (Western Ontario)
Ramin Zabih (Cornell)

Selected Papers Clustering
Spatially Coherent Clustering with Graph Cuts (Zabih and Kolmogorov, CVPR '04)

Energy Minimization
What Energy Functions can be Minimized via Graph Cuts? (Kolmogorov and Zabih, ECCV '02/PAMI '04)

Recognition
Spatially Coherent Matching and Bayesian Recognition
(Boykov and Huttenlocher, CVPR '99)

Stereo and Motion
Visual Correspondence using Energy Minimization and Mutual Information (Kim, Kolmogorov and Zabih, ICCV '03)
Fast Approximate Energy Minimization via Graph Cuts (Boykov, Veksler and Zabih, PAMI '01)
Computing Visual Correspondence with Occlusions using Graph Cuts
(Kolmogorov and Zabih, ICCV '01)

Markov Random Fields with Efficient Approximations
(Boykov, Veksler and Zabih, CVPR '98)

Multi-camera stereo
Generalized Multi-Camera Scene Reconstruction via Graph Cuts (Kolmogorov, Zabih and Gortler, EMMCVPR '03)
Multi-Camera Scene Reconstruction via Graph Cuts (Kolmogorov and Zabih, ICCV '03)

Segmentation
Computing Geodesics and Minimal Surfaces via Graph Cuts (Boykov and Kolmogorov, ICCV '03)

Flow algorithms
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision (Boykov and Kolmogorov, EMMCVPR '01/PAMI '04)

Talks Graph Cut Algorithms for Computer Vision and Medical Imaging (Ramin Zabih, Cornell CS Colloquium, February 2005))
Software Software Library (by Vladimir Kolmogorov)
Results Some examples (by Yuri Boykov)
Middlebury Stereo Evaluation Page
Meetings CMU Aladdin Center Probe on graph cuts (2003)
ICCV Workshop on Graph Algorithms in Computer Vision (1999)