Belief propagation for minimum weight many-to-one matchings in the random complete graph.
Mustafa KhandwawalaPublished in: CoRR (2014)
Keyphrases
- belief propagation
- minimum weight
- maximum cardinality
- graphical models
- bipartite graph
- message passing
- spanning tree
- markov random field
- weighted graph
- graph cuts
- greedy heuristic
- stereo matching
- minimum spanning tree
- planar graphs
- approximate inference
- pairwise
- free energy
- fixed point
- max product
- edge weights
- higher order
- graph structure
- probabilistic model
- np hard
- probabilistic inference
- three dimensional
- random variables
- energy function
- randomized algorithm
- optimal solution
- graph theory
- approximation algorithms
- active contours