An Efficient Graph Cut Algorithm for Computer Vision Problems

  • Chetan Arora
  • Subhashis Banerjee
  • Prem Kalra
  • S. N. Maheshwari
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6313)


Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed keeping the structure of vision based flow graphs in mind are more efficient than known strongly polynomial time max-flow algorithms based on preflow push or shortest augmenting path paradigms [1]. We present here a new algorithm for graph cuts which not only exploits the structural properties inherent in image based grid graphs but also combines the basic paradigms of max-flow theory in a novel way. The algorithm has a strongly polynomial time bound. It has been bench-marked using samples from Middlebury [2] and UWO [3] database. It runs faster on all 2D samples and is at least two to three times faster on 70% of 2D and 3D samples in comparison to the algorithm reported in [1].


Sink Node Texture Synthesis Grid Graph Voronoi Region Distance Label 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26, 1124–1137 (2004)CrossRefGoogle Scholar
  2. 2.
  3. 3.
  4. 4.
    Boykov, Y., Funka-Lea, G.: Graph cuts and efficient n-d image segmentation. Int. J. Comput. Vision 70, 109–131 (2006)CrossRefGoogle Scholar
  5. 5.
    Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: Proceedings of the International Conference on Computer Vision, vol. 2, pp. 508–515 (2001)Google Scholar
  6. 6.
    Kwatra, V., Schödl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: Image and video synthesis using graph cuts. ACM Transactions on Graphics, SIGGRAPH 22, 277–286 (2003)CrossRefGoogle Scholar
  7. 7.
    Lempitsky, V., Boykov, Y., Ivanov, D.: Oriented visibility for multiview reconstruction. In: European Conference on Computer Vision, vol. 3, pp. 226–238 (2006)Google Scholar
  8. 8.
    Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 147–159 (2004)CrossRefGoogle Scholar
  9. 9.
    Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. R. Statist. Soc. 51, 271–279 (1989)Google Scholar
  10. 10.
    Komodakis, N., Tziritas, G., Paragios, N.: Performance vs computational efficiency for optimizing single and dynamic mrfs: Setting the state of the art with primal-dual strategies. Comput. Vis. Image Underst. 112, 14–29 (2008)CrossRefGoogle Scholar
  11. 11.
    Delong, A., Boykov, Y.: A scalable graph-cut algorithm for n-d grids. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2008)Google Scholar
  12. 12.
    Juan, O., Boykov, Y.: Active graph cuts. In: IEEE Conference on Computer Vision and Pattern Recognition (2006)Google Scholar
  13. 13.
    Juan, O., Boykov, Y.: Capacity scaling for graph cuts in vision. In: Proceedings of the International Conference on Computer Vision, pp. 1–8 (2007)Google Scholar
  14. 14.
    Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23, 1222–1239 (2001)CrossRefGoogle Scholar
  15. 15.
    Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 1333–1336 (2003)CrossRefGoogle Scholar
  16. 16.
    Dinic, E.A.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. 11, 1277–1280 (1970)Google Scholar
  17. 17.
    Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. Journal of the Association for Computing Machinery 35, 921–940 (1988)zbMATHMathSciNetGoogle Scholar
  18. 18.
    Cherkassky, B.V., Goldberg, A.V.: On implementing push-relabel method for the maximum flow problem. Algorithmica 19, 390–410 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Goldberg, A.V.: Two-level push-relabel algorithm for the maximum flow problem. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol. 5564, pp. 212–225. Springer, Heidelberg (2009)Google Scholar
  20. 20.
    Vineet, V., Narayanan, P.J.: Cuda cuts: Fast graph cuts on the gpu. In: Computer Vision and Pattern Recognition Workshop, pp. 1–8 (2008)Google Scholar
  21. 21.
  22. 22.
  23. 23.
    Chandran, B.G., Hochbaum, D.S.: A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Oper. Res. 57, 358–376 (2009)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Chetan Arora
    • 1
  • Subhashis Banerjee
    • 1
  • Prem Kalra
    • 1
  • S. N. Maheshwari
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyDelhiIndia

Personalised recommendations