DMCA
Convergent Tree-reweighted Message Passing for Energy Minimization (2006)
Cached
Download Links
| Venue: | ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI) |
| Citations: | 488 - 16 self |
BibTeX
@MISC{Kolmogorov06convergenttree-reweighted,
author = {Vladimir Kolmogorov},
title = { Convergent Tree-reweighted Message Passing for Energy Minimization},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33]- tree-reweighted max-product message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy. However, the algorithm is not guaranteed to increase this bound- it may actually go down. In addition, TRW does not always converge. We develop a modification of this algorithm which we call sequential tree-reweighted message passing. Its main property is that the bound is guaranteed not to decrease. We also give a weak tree agreement condition which characterizes local maxima of the bound with respect to TRW algorithms. We prove that our algorithm has a limit point that achieves weak tree agreement. Finally, we show that our algorithm requires half as much memory as traditional message passing approaches. Experimental results demonstrate that on certain synthetic and real problems our algorithm outperforms both the ordinary belief propagation and tree-reweighted algorithm in [33]. In addition, on stereo problems with Potts interactions we obtain a lower energy than graph cuts.
Keyphrases
energy minimization convergent tree-reweighted message fundamental importance limit point tree-reweighted max-product message passing tree-reweighted algorithm trw algorithm discrete energy minimization local maximum real problem computer vision traditional message passing approach graph cut much memory stereo problem sequential tree-reweighted message passing potts interaction weak tree agreement weak tree agreement condition recent technique ordinary belief propagation experimental result main property
