Approximate Message Passing under Finite Alphabet Constraints
Andreas MüllerDino SejdinovicRobert J. PiechockiPublished in: CoRR (2012)
Keyphrases
- message passing
- inference in graphical models
- finite alphabet
- belief propagation
- distributed systems
- factor graphs
- lp relaxation
- markov random field
- distributed shared memory
- approximate inference
- junction tree
- generalized belief propagation
- graphical models
- dual decomposition
- constraint satisfaction
- sum product algorithm
- graph cuts
- sum product