Skip to main content
SpringerLink
Log in

Graph Cuts and Efficient N-D Image Segmentation

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features of combinatorial graph cuts methods in vision: global optima, practical efficiency, numerical robustness, ability to fuse a wide range of visual cues and constraints, unrestricted topological properties of segments, and applicability to N-D problems. Graph cuts based approaches to object extraction have also been shown to have interesting connections with earlier segmentation methods such as snakes, geodesic active contours, and level-sets. The segmentation energies optimized by graph cuts combine boundary regularization with region-based properties in the same fashion as Mumford-Shah style functionals. We present motivation and detailed technical description of the basic combinatorial optimization framework for image segmentation via s/t graph cuts. After the general concept of using binary graph cut algorithms for object segmentation was first proposed and tested in Boykov and Jolly (2001), this idea was widely studied in computer vision and graphics communities. We provide links to a large number of known extensions based on iterative parameter re-estimation and learning, multi-scale or hierarchical approaches, narrow bands, and other techniques for demanding photo, video, and medical applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amini, A.A., Weymouth, T.E., and Jain, R.C. 1990. Using dynamic programming for solving variational problems in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(9):855–867.

    Article  Google Scholar 

  • Appleton, B. and Talbot, H. 2006. Globally minimal surfaces by continuous maximal flows. IEEE transactions on Pattern Analysis and Pattern Recognition (PAMI), 28(1):106–118.

    Article  Google Scholar 

  • Blake, A., Rother, C., Brown, M., Perez, P., and Torr, P. 2004. Interactive image segmentation using an adaptive gmmrf model. In European Conference on Computer Vision (ECCV), Prague, Chech Republic.

  • Boykov, Y. and Kolmogorov, V. 2003. Computing geodesics and minimal surfaces via graph cuts. In International Conference on Computer Vision, vol. I, pp. 26–33.

  • Boykov, Y., Veksler, O., and Zabih, R. 1998. Markov random fields with efficient approximations. In IEEE Conference on Computer Vision and Pattern Recognition, pp. 648–655.

  • Boykov, Y. and Jolly, M.-P. 2001. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In International Conference on Computer Vision, vol. I, pp. 105–112, July 2001.

  • Boykov, Y. and Kolmogorov, V. 2004. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9):1124–1137.

    Article  Google Scholar 

  • Boykov, Y., Kolmogorov, V., Cremers, D., and Delong, A. 2006. An integral solution to surface evolution PDEs via geo-cuts. In European Conference on Computer Vision, LNCS 3953, Graz, Austria, vol. III, pp. 409–422.

  • Boykov, Y. and Veksler, O. 2006. Graph cuts in vision and graphics: Theories and applications. In: N. Paragios, Y. Chen, and O. Faugeras, (Eds.), Handbook of Mathematical Models in Computer Vision, Springer-Verlag, pp. 79–96.

  • Boykov, Y., Veksler, O., and Zabih, R. 2001. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1222–1239.

    Article  Google Scholar 

  • Bray, M., Kohli, P., and Torr, P.H.S. 2006. Posecut: Simultaneous segmentation and 3D pose estimation of humans using dynamic graph-cuts. In European Conference on Computer Vision, Graz, Austria, May 2006, (to appear).

  • Caselles, V., Kimmel, R., and Sapiro, G. 1997. Geodesic active contours. International Journal of Computer Vision, 22(1):61–79.

    Article  MATH  Google Scholar 

  • Cohen, L.D. 1991. On active contour models and ballons. Computer Vision, Graphics, and Image Processing: Image Understanding, 53(2):211–218.

    MATH  Google Scholar 

  • Cohen, L.D. and Kimmel, R. 1997. Global minimum for active contour models: A minimal path approach. International Journal of Computer Vision, 24(1):57–78.

    Article  Google Scholar 

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., and Schrijver, A. 1998. Combinatorial Optimization. John Wiley & Sons.

  • Cox, I.J., Rao, S.B., and Zhong, Y. 1996. “Ratio regions”: a technique for image segmentation. In International Conference on Pattern Recognition, vol. II, pp. 557–564.

  • Cremers, D. 2006. Dynamical statistical shape priors for level set based tracking. IEEE Trans. on Pattern Analysis and Machine Intelligence, (to appear).

  • Cremers, D., Osher, S.J., and Soatto, S. 2006. Kernel density estimation and intrinsic alignment for shape priors in level set segmentation. International Journal of Computer Vision, (to appear).

  • FalcÃo, A.X., Udupa, J.K., Samarasekera, S., and Sharma, S. 1998. User-steered image segmentation paradigms: Live wire and live lane. Graphical Models and Image Processing, 60:233–260.

    Article  Google Scholar 

  • Felzenszwalb, P. and Huttenlocher, D. 2004. Efficient graph-based image segmentation. International Journal of Computer Vision, 59(2):167–181.

    Article  Google Scholar 

  • Ford, L. and Fulkerson, D. 1962. Flows in Networks. Princeton University Press.

  • Funka-Lea, G., Boykov, Y., Florin, C., Jolly, M.-P., Moreau-Gobard, R., Ramaraj, R., and Rinck, D. 2006. Automatic heart isolation for CT coronary visualization using graph-cuts. In IEEE International Symposium on Biomedical Imaging, Arlington, VA, April 2006.

  • Geiger, D., Gupta, A., Costa, L.A., and Vlontzos, J. 1995. Dynamic programming for detecting, tracking, and matching deformable contours. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(3):294–402.

    Article  Google Scholar 

  • Goldberg, A.V. and Tarjan, R.E. 1988. A new approach to the maximum-flow problem. Journal of the Association for Computing Machinery, 35(4):921–940.

    MATH  MathSciNet  Google Scholar 

  • Grady, L. 2005. Multilabel random walker segmentation using prior models. In IEEE Conference of Computer Vision and Pattern Recognition, San Diego, CA, June 2005, vol. 1, pp. 763–770.

  • Greig, D., Porteous, B., and Seheult, A. 1989. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B, 51(2):271–279.

    Google Scholar 

  • Griffin, L.D., Colchester, A.C.F., Röll, S.A., and Studholme, C.S. 1994. Hierarchical segmentation satisfying constraints. In British Machine Vision Conference, pp. 135–144.

  • Haralick, R.M. and Shapiro, L.G. 1992. Computer and Robot Vision. Addison-Wesley Publishing Company.

  • Hochbaum, D.S. 1998. The pseudoflow algorithm for the maximum flow problem. Manuscript, UC Berkeley, revised 2003, Extended abstract in: The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem. Proceedings of IPCO98, June 1998. Lecture Notes in Computer Science, Bixby, Boyd and Rios-Mercado (Eds.) 1412, Springer, pp. 325–337.

  • Isard, M. and Blake, A. 1998. Active contours. Springer-Verlag.

  • Ishikawa, H. and Geiger, D. 1998. Occlusions, discontinuities, and epipolar lines in stereo. In 5th European Conference on Computer Vision, pp. 232–248.

  • Ishikawa, H. and Geiger, D. 1998. Segmentation by grouping junctions. In IEEE Conference on Computer Vision and Pattern Recognition, pp. 125–131.

  • Ishikawa, H. 2003. Exact optimization for Markov Random Fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(10):1333–1336.

    Article  Google Scholar 

  • Jermyn, I.H. and Ishikawa, H. 1999. Globally optimal regions and boundaries. In International Conference on Computer Vision, vol. II, pp. 904–910.

  • Juan, O. and Boykov, Y. 2006. Active Graph Cuts. In IEEE Conference of Computer Vision and Pattern Recognition, 2006 (to appear). Also in Tech.Rep. #655, UWO, CS Dept., Nov. 18, 2005 (ISBN-13: 978-0-7714-2558-9).

  • Kass, M., Witkin, A., and Terzolpoulos, D. 1988. Snakes: Active contour models. International Journal of Computer Vision, 1(4):321–331.

    Article  Google Scholar 

  • Kimmel, R. and Bruckstein, A.M. 2003. Regularized Laplacian zero crossings as optimal edge integrators. International Journal of Computer Vision, 53(3):225–243.

    Article  Google Scholar 

  • Kirsanov, D. and Gortler, S.J. 2004. A discrete global minimization algorithm for continuous variational problems. Harvard Computer Science Technical Report, TR-14-04, July 2004, (also submitted to a journal).

  • Kleinberg, J. 2002. An impossibility theorem for clustering. In The 16th conference on Neural Information Processing Systems (NIPS).

  • Kohli, P. and Torr, P.H.S. 2005. Efficiently solving dynamic markov random fields using graph cuts. In International Conference on Computer Vision.

  • Kohli, P. and Torr, P.H.S. 2006. Measuring uncertainty in graph cut solutions—efficiently computing min-marginal energies using dynamic graph cuts. In European Conference on Computer Vision, Graz, Austria, May 2006 (to appear).

  • Kolmogorov, V. and Boykov, Y. 2005. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. In International Conference on Computer Vision, Beijing, China, vol. I, pp. 564–571.

  • Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., and Rother, C. 2005. Bi-layer segmentation of binocular stereo video. In IEEE Conference of Computer Vision and Pattern Recognition, San Diego, CA.

  • Kolmogorov, V. and Zabih, R. 2002. Multi-camera scene reconstruction via graph cuts. In 7th European Conference on Computer Vision, volume III of LNCS 2352, pp. 82–96, Copenhagen, Denmark, May 2002. Springer-Verlag.

  • Kolmogorov, V. and Zabih, R. 2004. What energy functions can be minimized via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2):147–159.

    Article  Google Scholar 

  • Kumar, M.P., Torr, P.H.S., and Objcut, A.Z. 2005. In IEEE Conference of Computer Vision and Pattern Recognition, pp. 18–25.

  • Kwatra, V., Schodl, A., Essa, I., and Bobick, A. 2003. GraphCut textures: image and video synthesis using graph cuts. In ACM Transactions on Graphics (SIGGRAPH), vol. 22, July 2003.

  • Lempitsky, V., Boykov, Y., and Ivanov, D. 2006. Oriented visibility for multiview reconstruction. In European Conference on Computer Vision, Graz, Austria, May 2006 (to appear).

  • Li, K., Wu, X., Chen, D.Z., and Sonka, M. 2006. Optimal surface segmentation in volumetric images-a graph-theoretic approach. IEEE transactions on Pattern Analysis and Pattern Recognition (PAMI), 28(1):119–134.

    Google Scholar 

  • Li, Y., Sun, J., and Shum, H.-Y. 2005. Video object cut and paste. In SIGGRAPH (ACM Transaction on Graphics)

  • Li, Y., Sun, J., Tang, C.-K., and Shum, H.-Y. 2004. Lazy snapping. In SIGGRAPH (ACM Transaction on Graphics).

  • Lombaert, H., Sun, Y., Grady, L., and Xu, C. 2005. A multilevel banded graph cuts method for fast image segmentation. In International Conference on Computer Vision, October 2005.

  • Mortensen, E.N. and Barrett, W.A. 1998. Interactive segmentation with intelligent scissors. Graphical Models and Image Processing, 60:349–384.

    Article  MATH  Google Scholar 

  • Mumford, D. and Shah, J. 1989. Optimal approximations by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math., 42:577–685.

    MATH  MathSciNet  Google Scholar 

  • Murota, K. 2003. Discrete Convex Analysis. SIAM Monographs on Discrete Mathematics and Applications.

  • Osher, S. and Paragios, N. 2003. Geometric Level Set Methods in Imaging, Vision, and Graphics. Springer Verlag.

  • Osher, S.J. and Fedkiw, R.P. 2002. Level Set Methods and Dynamic Implicit Surfaces. Springer Verlag.

  • Reese, L.J. 1999. Intelligent paint: Region-based interactive image segmentation. Master’s thesis, Brigham Young University.

  • Rother, C., Kolmogorov, V., and Blake, A. 2004. Grabcut—interactive foreground extraction using iterated graph cuts. In ACM Transactions on Graphics (SIGGRAPH).

  • Rother, C., Kumar, S., Kolmogorov, V., and Blake, A. 2005. Digital tapestry. In IEEE Conference of Computer Vision and Pattern Recognition, San Diego, CA.

  • Roy, S. and Cox, I. 1998. A maximum-flow formulation of the n-camera stereo correspondence problem. In IEEE Proc. of Int. Conference on Computer Vision, pp. 492–499.

  • Sapiro, G. 2001. Geometric Partial Differential Equations and Image Analysis. Cambridge University Press.

  • Scharstein, D. and Szeliski, R. 2002. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision, 47(1/3):7–42.

    Article  MATH  Google Scholar 

  • Sethian, J.A. 1999. Level Set Methods and Fast Marching Methods. Cambridge University Press.

  • Shi, J. and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888–905.

    Article  Google Scholar 

  • Szeliski, R. and Zabih, R. 1999. An experimental comparison of stereo algorithms. In Vision Algorithms: Theory and Practice, number 1883 in LNCS, pp. 1–19, Springer-Verlag, Corfu, Greece, September 1999.

  • Vasilevskiy, A. and Siddiqi, K. 2002. Flux maximizing geometric flows. PAMI, 24(12):1565–1578.

    Google Scholar 

  • Veksler, O. 2000. Image segmentation by nested cuts. In IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 339–344.

  • Vogiatzis, G., Torr, P.H.S., and Cipolla, R. 2005. Multi-view stereo via volumetric graph-cuts. In IEEE Conference of Computer Vision and Pattern Recognition, pp. 391–398.

  • Wang, J., Bhat, P., Colburn, R.A., Agrawala, M., and Cohen, M.F. 2005. Interactive video cutout. In SIGGRAPH (ACM Transaction on Graphics).

  • Wu, Z. and Leahy, R. 1993. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(11):1101–1113.

    Article  Google Scholar 

  • Xu, N., Bansal, R., and Ahuja, N. 2003. Object segmentation using graph cuts based active contours. In IEEE Conference on Computer Vision and Pattern Recognition, vol. II, pp. 46–53.

  • Yezzi, A., Jr., Kichenassamy, S., Kumar, A., Olver, P., and Tannenbaum, A. 1997. A geometric snake model for segmentation of medical imagery. IEEE Transactions on Medical Imaging, 16(2):199–209.

    Article  Google Scholar 

  • Zhu, S.C. and Yuille, A. 1996. Region competition: Unifying snakes, region growing, and Bayes/MDL for multiband image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(9):884–900.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, University of Western Ontario, London, ON, Canada

    Yuri Boykov

  2. Imaging & Visualization, Siemens Corp. Research, Princeton, NJ, USA

    Gareth Funka-Lea

Authors
  1. Yuri Boykov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gareth Funka-Lea
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuri Boykov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boykov, Y., Funka-Lea, G. Graph Cuts and Efficient N-D Image Segmentation. Int J Comput Vision 70, 109–131 (2006). https://doi.org/10.1007/s11263-006-7934-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11263-006-7934-5

Keywords

Search

Navigation