What energy functions can be minimized via graph cuts?
- PMID: 15376891
- DOI: 10.1109/TPAMI.2004.1262177
What energy functions can be minimized via graph cuts?
Abstract
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a general-purpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.
Similar articles
-
Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.IEEE Trans Pattern Anal Mach Intell. 2005 Aug;27(8):1239-53. doi: 10.1109/TPAMI.2005.161. IEEE Trans Pattern Anal Mach Intell. 2005. PMID: 16119263
-
Minimizing nonsubmodular functions with graph cuts - a review.IEEE Trans Pattern Anal Mach Intell. 2007 Jul;29(7):1274-9. doi: 10.1109/TPAMI.2007.1031. IEEE Trans Pattern Anal Mach Intell. 2007. PMID: 17496384 Review.
-
Nonparametric multiscale energy-based model and its application in some imagery problems.IEEE Trans Pattern Anal Mach Intell. 2004 Feb;26(2):184-97. doi: 10.1109/TPAMI.2004.1262180. IEEE Trans Pattern Anal Mach Intell. 2004. PMID: 15376894
-
Automatic construction of active appearance models as an image coding problem.IEEE Trans Pattern Anal Mach Intell. 2004 Oct;26(10):1380-4. doi: 10.1109/TPAMI.2004.77. IEEE Trans Pattern Anal Mach Intell. 2004. PMID: 15641725
-
Multivariate image analysis in biomedicine.J Biomed Inform. 2004 Oct;37(5):380-91. doi: 10.1016/j.jbi.2004.07.010. J Biomed Inform. 2004. PMID: 15488751 Review.
Cited by
-
Selective segmentation for global optimization of depth estimation in complex scenes.ScientificWorldJournal. 2013 May 14;2013:868674. doi: 10.1155/2013/868674. Print 2013. ScientificWorldJournal. 2013. PMID: 23766717 Free PMC article.
-
Interactive semiautomatic contour delineation using statistical conditional random fields framework.Med Phys. 2012 Jul;39(7):4547-58. doi: 10.1118/1.4728979. Med Phys. 2012. PMID: 22830786 Free PMC article.
-
Constraint factor graph cut-based active contour method for automated cellular image segmentation in RNAi screening.J Microsc. 2008 May;230(Pt 2):177-91. doi: 10.1111/j.1365-2818.2008.01974.x. J Microsc. 2008. PMID: 18445146 Free PMC article.
-
Fat water decomposition using globally optimal surface estimation (GOOSE) algorithm.Magn Reson Med. 2015 Mar;73(3):1289-99. doi: 10.1002/mrm.25193. Epub 2014 Mar 6. Magn Reson Med. 2015. PMID: 24604689 Free PMC article.
-
DeepIGeoS: A Deep Interactive Geodesic Framework for Medical Image Segmentation.IEEE Trans Pattern Anal Mach Intell. 2019 Jul;41(7):1559-1572. doi: 10.1109/TPAMI.2018.2840695. Epub 2018 Jun 1. IEEE Trans Pattern Anal Mach Intell. 2019. PMID: 29993532 Free PMC article.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
Other Literature Sources