Belief Propagation and LP Relaxation for Weighted Matching in General Graphs.
Sujay SanghaviDmitry M. MalioutovAlan S. WillskyPublished in: IEEE Trans. Inf. Theory (2011)
Keyphrases
- belief propagation
- message passing
- lp relaxation
- graphical models
- markov random field
- graph cuts
- energy minimization
- stereo matching
- disparity map
- energy minimization problems
- pairwise
- markov networks
- linear programming
- bayesian networks
- linear program
- distributed systems
- higher order
- constraint satisfaction
- post processing
- structure learning
- min cut