Reweighted message passing revisited

V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.

Report | Published
Department
Abstract
We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results.
Publishing Year
Date Published
2013-09-22
IST-REx-ID

Cite this

Kolmogorov V. Reweighted Message Passing Revisited. IST Austria; 2013.
Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.
Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.
V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.
Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar