On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs.
Yair WeissWilliam T. FreemanPublished in: IEEE Trans. Inf. Theory (2001)
Keyphrases
- belief propagation
- max product
- loopy belief propagation
- optimal solution
- graphical models
- message passing
- markov random field
- np hard
- dynamic programming
- stereo matching
- energy function
- approximate inference
- graph cuts
- preprocessing
- parameter estimation
- computational complexity
- energy minimization
- markov networks
- high quality
- linear programming
- matching algorithm
- input data
- probabilistic model
- objective function
- free energy
- reinforcement learning
- similarity measure