Graph Cuts is a Max-Product Algorithm.
Daniel TarlowInmar E. GivoniRichard S. ZemelBrendan J. FreyPublished in: UAI (2011)
Keyphrases
- graph cuts
- energy function
- segmentation algorithm
- belief propagation
- loopy belief propagation
- dynamic programming
- max product
- monte carlo
- markov random field
- search space
- computational complexity
- random walker
- objective function
- matching algorithm
- optimal solution
- energy minimization
- maximum flow
- markov chain
- graphical models
- min cut
- image sequences