A new look at reweighted message passing

Vladimir Kolmogorov.

In IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), May 2015, 37(5):919-930.


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 Diffusion (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.


Links

doi differently formatted version

implementation