Improved moves for truncated convex models

Journal article

We consider the problem of obtaining an approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex model. For this problem, we propose two st-MINCUT based move making algorithms that we call Range Swap and Range Expansion. Our algorithms can be thought of as extensions of αβ-Swap and a-Expansion respectively that fully exploit the form of the pairwise potentials. Specifically, instead of dealing with one or two labels at each iteration, our methods explore a large search space by considering a range of labels (that is, an interval of consecutive labels). Furthermore, we show that Range Expansion provides the same multiplicative bounds as the standard linear programming (LP) relaxation in polynomial time. Compared to previous approaches based on the LP relaxation, for example interior-point algorithms or tree-reweighted message passing (TRW), our methods are faster as they use only the efficient st-MINCUT algorithm in their design. We demonstrate the usefulness of the proposed approaches on both synthetic and standard real data problems.

Authors: Pawan Kumar, M; Veksler, O; Torr, PHS

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Journal of Machine Learning Research
• Journal: Journal of Machine Learning Research
• Volume: 12
• Issue: 2
• Pages: 31-67
• Publication date: 2011-11-01
• Acceptance date: 2011-10-09
• EISSN: 1533-7928
• ISSN: 1532-4435
• Language: English
• Keywords: range moves; multiplicative bounds; move making algorithms; truncated convex models; linear programming relaxation