Cooled and relaxed survey propagation for MRFs
We describe a new algorithm, Relaxed Survey Propagation (RSP), for finding MAP configurations in Markov random fields. We compare its performance with state-of-the-art algorithms including the max-product belief propagation, its sequential tree-reweighted variant, residual (sum-product) belief propa...
| Principais autores: | , , |
|---|---|
| Formato: | Journal article |
| Idioma: | English |
| Publicado em: |
2009
|