A new look at reweighted message passing
arXiv:1309.5655 · doi:10.1109/TPAMI.2014.2363465
Abstract
We propose a new family of message passing techniques for MAP estimation in graphical models which we call {\em Sequential Reweighted Message Passing} (SRMP). Special cases include well-known techniques such as {\em Min-Sum Diffusion} (MSD) and a faster {\em 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.
TPAMI accepted version
References in corpus (5)
Cited by in corpus (15)
- Improving ICS Cyber Resilience through Optimal Diversification of Network Resources
- Relative Interior Rule in Block-Coordinate Minimization
- Detailed Surface Geometry and Albedo Recovery from RGB-D Video Under Natural Illumination
- Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams
- Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective
- A Message Passing Algorithm for the Minimum Cost Multicut Problem
- A Primal-Dual Solver for Large-Scale Tracking-by-Assignment
- Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization
- Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
- Quasi-exact ground-state algorithm for the random-field Potts model
- Principled Parallel Mean-Field Inference for Discrete Random Fields
- Global and Local Texture Randomization for Synthetic-to-Real Semantic Segmentation
- On Coordinate Minimization of Convex Piecewise-Affine Functions
- Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation
- Higher Order Maximum Persistency and Comparison Theorems