Graph Cuts in Vision and Graphics: Theories and Applications

Combinatorial min-cut algorithms on graphs have emerged as an increaseingly useful tool for problems in vision. Typically, the use of graph-cuts is motivated by one of the following two reasons. Firstly, graph-cuts allow geometric interpretation; under certain conditions a cut on a graph can be seen as a hypersurface in N-D space embedding the corresponding graph. Thus, many applications in vision and graphics use min-cut algorithms as a tool for computing optimal hypersurfaces. Secondly, graph-cuts also work as a powerful energy minimization tool for a fairly wide class of binary and nonbinary energies that frequently occur in early vision. In some cases graph cuts produce globally optimal solutions. More generally, there are iterative techniques based on graph-cuts that produce provably good approximations which (were empirically shown to) correspond to high-quality solutions in practice. Thus, another large group of applications use graph-cuts as as an optimization technique for low-level vision problems based on global energy formulations.

[1]  Vladimir Kolmogorov,et al.  Multi-camera Scene Reconstruction via Graph Cuts , 2002, ECCV.

[2]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[4]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[5]  Li Hong,et al.  Segment-based stereo matching using graph cuts , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[6]  Patrick Pérez,et al.  Interactive Image Segmentation Using an Adaptive GMMRF Model , 2004, ECCV.

[7]  M. Shah,et al.  Motion layer extraction in the presence of occlusion using graph cut , 2004, CVPR 2004.

[8]  S. Osher,et al.  Geometric Level Set Methods in Imaging, Vision, and Graphics , 2011, Springer New York.

[9]  Michael F. Cohen,et al.  Minimal Surfaces for Stereo , 2002, ECCV.

[10]  Ning Xu,et al.  Object segmentation using graph cuts based active contours , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[11]  Hugues Talbot,et al.  Globally minimal surfaces by continuous maximal flows , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  E. Schwartz,et al.  Space-variant computer vision: a graph-theoretic approach , 2004 .

[13]  Davi Geiger,et al.  Occlusions, Discontinuities, and Epipolar Lines in Stereo , 1998, ECCV.

[14]  S. Gortler,et al.  A Discrete Global Minimization Algorithm for Continuous Variational Problems , 2004 .

[15]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[16]  Serge J. Belongie,et al.  What went where , 2003, CVPR 2003.

[17]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[18]  Irfan A. Essa,et al.  Graphcut textures: image and video synthesis using graph cuts , 2003, ACM Trans. Graph..

[19]  Olga Veksler,et al.  Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[20]  William T. Freeman,et al.  Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[21]  Sébastien Roy,et al.  Stereo Without Epipolar Lines: A Maximum-Flow Formulation , 1999, International Journal of Computer Vision.

[22]  G. Sapiro,et al.  Geometric partial differential equations and image analysis [Book Reviews] , 2001, IEEE Transactions on Medical Imaging.

[23]  Carlo Tomasi,et al.  Surfaces with occlusions from layered stereo , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Gilbert Strang,et al.  Maximal flow through a domain , 1983, Math. Program..

[25]  Ingemar J. Cox,et al.  A maximum-flow formulation of the N-camera stereo correspondence problem , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[26]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[27]  Davi Geiger,et al.  Segmentation by grouping junctions , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[28]  Larry S. Davis,et al.  Window-based, discontinuity preserving stereo , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[29]  Venu Madhav Govindu,et al.  MRF solutions for probabilistic optical flow formulations , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[30]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[31]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[32]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[33]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[34]  R. Zabih,et al.  Efficient Graph-Based Energy Minimization Methods in Computer Vision , 1999 .

[35]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[36]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[37]  Carlo Tomasi,et al.  Multiway cut for stereo and motion with slanted surfaces , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[38]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[39]  J. Besag.  On the Statistical Analysis of Dirty Pictures , 1986 .

[40]  Gareth Funka-Lea,et al.  Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials , 2004, ECCV Workshops CVAMIA and MMBIA.