Partitioning Graphs on Message-Passing Machines by Pairwise Mincut.
P. SadayappanFikret ErçalJ. RamanujamPublished in: Inf. Sci. (1998)
Keyphrases
- min cut
- message passing
- pairwise
- belief propagation
- markov random field
- graph cuts
- lp relaxation
- energy minimization
- graph partitioning
- max flow
- graph matching
- energy function
- approximate inference
- higher order
- distributed systems
- loopy belief propagation
- semi supervised
- potential functions
- graphical models
- undirected graph
- spectral clustering
- weighted graph
- image segmentation
- maximum a posteriori
- conditional random fields
- parameter estimation
- similarity measure
- graph model
- information theoretic
- junction tree
- free energy
- shape prior
- stereo matching