Advertisement

When Can \(l_p\)-norm Objective Functions Be Minimized via Graph Cuts?

  • Filip MalmbergEmail author
  • Robin Strand
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11255)

Abstract

Techniques based on minimal graph cuts have become a standard tool for solving combinatorial optimization problems arising in image processing and computer vision applications. These techniques can be used to minimize objective functions written as the sum of a set of unary and pairwise terms, provided that the objective function is submodular. This can be interpreted as minimizing the \(l_1\)-norm of the vector containing all pairwise and unary terms. By raising each term to a power p, the same technique can also be used to minimize the \(l_p\)-norm of the vector. Unfortunately, the submodularity of an \(l_1\)-norm objective function does not guarantee the submodularity of the corresponding \(l_p\)-norm objective function. The contribution of this paper is to provide useful conditions under which an \(l_p\)-norm objective function is submodular for all \(p\ge 1\), thereby identifying a large class of \(l_p\)-norm objective functions that can be minimized via minimal graph cuts.

Keywords

Minimal graph cuts \(l_p\) norm Submodularity 

References

  1. 1.
    Allène, C., Audibert, J.Y., Couprie, M., Keriven, R.: Some links between extremum spanning forests, watersheds and min-cuts. Image Vis. Comput. 28(10), 1460–1471 (2010)CrossRefGoogle Scholar
  2. 2.
    Boykov, Y., Funka-Lea, G.: Graph cuts and efficient ND image segmentation. Int. J. Comput. Vis. 70(2), 109–131 (2006)CrossRefGoogle Scholar
  3. 3.
    Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222–1239 (2001)CrossRefGoogle Scholar
  4. 4.
    Couprie, C., Grady, L., Najman, L., Talbot, H.: Power watershed: a unifying graph-based optimization framework. IEEE Trans. Pattern Anal. Mach. Intell. 33(7), 1384–1399 (2011)CrossRefGoogle Scholar
  5. 5.
    Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cuts-a review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1274–1279 (2007)CrossRefGoogle Scholar
  6. 6.
    Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147–159 (2004)CrossRefGoogle Scholar
  7. 7.
    Levi, Z., Zorin, D.: Strict minimizers for geometric optimization. ACM Trans. Graph. (TOG) 33(6), 185 (2014)CrossRefGoogle Scholar
  8. 8.
    Miranda, P.A., Falcão, A.X.: Links between image segmentation based on optimum-path forest and minimum cut in graph. J. Math. Imaging Vis. 35(2), 128–142 (2009)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Information TechnologyUppsala UniversityUppsalaSweden

Personalised recommendations