A Message Passing Algorithm for the Minimum Cost Multicut Problem.
Paul SwobodaBjoern AndresPublished in: CoRR (2016)
Keyphrases
- message passing
- np hard
- minimum cost
- worst case
- optimal solution
- computational complexity
- dynamic programming
- belief propagation
- distributed systems
- spanning tree
- inference in graphical models
- minimum cost flow
- factor graphs
- loopy belief propagation
- junction tree
- special case
- k means
- path planning
- graphical models
- markov random field
- network flow
- pairwise
- high quality
- sum product algorithm
- image segmentation