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
-
Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.J Phys Chem B. 2016 Aug 25;120(33):8354-60. doi: 10.1021/acs.jpcb.6b02059. Epub 2016 May 3. J Phys Chem B. 2016. PMID: 27089174 Free PMC article.
-
Real-Time Video Synopsis via Dynamic and Adaptive Online Tube Resizing.Sensors (Basel). 2022 Nov 22;22(23):9046. doi: 10.3390/s22239046. Sensors (Basel). 2022. PMID: 36501746 Free PMC article.
-
A voting-based sequential pattern recognition method.PLoS One. 2013 Oct 14;8(10):e76980. doi: 10.1371/journal.pone.0076980. eCollection 2013. PLoS One. 2013. PMID: 24155915 Free PMC article.
-
Image-based Analysis to Study Plant Infection with Human Pathogens.Comput Struct Biotechnol J. 2014 Sep 28;12(20-21):1-6. doi: 10.1016/j.csbj.2014.09.010. eCollection 2014 Nov. Comput Struct Biotechnol J. 2014. PMID: 25505501 Free PMC article. Review.
-
Automatic estimation of aortic and mitral valve displacements in dynamic CTA with 4D graph-cuts.Med Image Anal. 2020 Oct;65:101748. doi: 10.1016/j.media.2020.101748. Epub 2020 Jun 6. Med Image Anal. 2020. PMID: 32711368 Free PMC article.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
Other Literature Sources