This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Convergent Tree-Reweighted Message Passing for Energy Minimization
October 2006 (vol. 28 no. 10)
pp. 1568-1583
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.

[1] Y. Boykov and V. Kolmogorov, “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, Sept. 2004.
[2] Y. Boykov and M.-P. Jolly, “Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images,” Proc. Int'l Conf. Computer Vision, 2001.
[3] Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, Nov. 2001.
[4] C. Chekuri, S. Khanna, J. Naor, and L. Zosin, “Approximation Algorithms for the Metric Labeling Problem via a New Linear Programming Formulation,” Proc. Symp. Discrete Algorithms, 2000.
[5] R.G. Cowell, A.P. Dawid, S.L. Lauritzen, and D.J. Spiegelhalter, Probabilistic Networks and Expert Systems. Springer-Verlag, 1999.
[6] P.F. Felzenszwalb and D.P. Huttenlocher, “Efficient Belief Propagation for Early Vision,” Proc. Conf. Computer Vision and Pattern Recognition, 2004.
[7] W. Freeman, E. Pasztor, and O. Carmichael, “Learning Low-Level Vision,” Int'l J. Computer Vision, vol. 40, no. 1, pp. 25-47, 2000.
[8] S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, 1984.
[9] D. Greig, B. Porteous, and A. Seheult, “Exact Maximum A Posteriori Estimation for Binary Images,” J. Royal Statistical Soc., Series B, vol. 51, no. 2, pp. 271-279, 1989.
[10] H. Ishikawa, “Exact Optimization for Markov Random Fields with Convex Priors,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 10, pp. 1333-1336, Oct. 2003.
[11] J. Kleinberg and E. Tardos, “Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields,” Proc. Ann. Symp. Foundations of Computer Science, 1999.
[12] V. Kolmogorov and M. Wainwright, “On the Optimality of Tree-Reweighted Max-Product Message Passing,” Proc. Conf. Uncertainty in Artificial Intelligence, July 2005.
[13] V. Kolmogorov, “Convergent Tree-Reweighted Message Passing for Energy Minimization,” Proc. Int'l Workshop Artificial Intelligence and Statistics, Jan. 2005.
[14] V. Kolmogorov and R. Zabih, “Multi-Camera Scene Reconstruction via Graph Cuts,” Proc. European Conf. Computer Vision, vol. 3, pp. 82-96, 2002.
[15] V. Kolmogorov and R. Zabih, “What Energy Functions Can Be Minimized via Graph Cuts?” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147-159, Feb. 2004.
[16] N. Komodakis and G. Tziritas, “A New Framework for Approximate Labeling via Graph Cuts,” Proc. Int'l Conf. Computer Vision, 2005.
[17] A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen, “The Partial Constraint Satisfaction Problem: Facets and Lifting Theorems,” Operation Research Letters, vol. 23, nos. 3-5, pp. 89-97, 1998.
[18] V.K. Koval and M.I. Schlesinger, “Two-Dimensional Programming in Image Analysis Problems,” Automatics and Telemechanics, vol. 2, pp. 149-168, 1976 (in Russian).
[19] V. Kwatra, A. Schödl, I. Essa, G. Turk, and A. Bobick, “Graphcut Textures: Image and Video Synthesis Using Graph Cuts,” Proc. SIGGRAPH Conf., July 2003.
[20] T. Meltzer, C. Yanover, and Y. Weiss, “Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation,” Proc. Int'l Conf. Computer Vision, 2005.
[21] M.A. Paskin, “Sample Propagation,” Proc. Conf. Neural Information Processing Systems, 2003.
[22] J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
[23] D. Scharstein and R. Szeliski, “A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms,” Int'l J. Computer Vision, vol. 47, pp. 7-42, Apr. 2002.
[24] M.I. Schlesinger, “Syntactic Analysis of Two-Dimensional Visual Signals in Noisy Conditions,” Kibernetika, vol. 4, pp. 113-130, 1976 (in Russian).
[25] M.I. Schlesinger, Mathematical Tools for Image Processing. Kiev: Nauk. dumka, 1989 (in Russian).
[26] M.I. Schlesinger and B. Flach, “Some Solvable Subclass of Structural Recognition Problems,” Proc. Czech Pattern Recognition Workshop, 2000.
[27] J. Sun, N. Zheng, and H. Shum, “Stereo Matching Using Belief Propagation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 7, pp. 787-800, July 2003.
[28] M.F. Tappen and W.T. Freeman, “Comparison of Graph Cuts with Belief Propagation for Stereo, Using Identical MRF Parameters,” Proc. Int'l Conf. Computer Vision, Oct. 2003.
[29] Y.W. Teh and M. Welling, “On Improving the Efficiency of the Iterative Proportional Fitting Procedure,” Proc. Int'l Workshop Artificial Intelligence and Statistics, 2003.
[30] M.J. Wainwright, T.S. Jaakkola, and A.S. Willsky, “Tree-Based Reparameterization Framework for Analysis of Sum-Product and Related Algorithms,” IEEE Trans. Information Theory, vol. 45, no. 9, pp. 1120-1146, Sept. 2003.
[31] M.J. Wainwright, T.S. Jaakkola, and A.S. Willsky, “Tree-Reweighted Belief Propagation and Approximate ML Estimation by Pseudo-Moment Matching,” Proc. Int'l Workshop Artificial Intelligence and Statistics, Jan. 2003.
[32] M.J. Wainwright, T.S. Jaakkola, and A.S. Willsky, “Tree Consistency and Bounds on the Performance of the Max-Product Algorithm and Its Generalizations,” Statistics and Computing, vol. 14, no. 2, pp. 143-166, Apr. 2004.
[33] M.J. Wainwright, T.S. Jaakkola, and A.S. Willsky, “MAP Estimation via Agreement on (Hyper)Trees: Message-Passing and Linear-Programming Approaches,” IEEE Trans. Information Theory, vol. 51, no. 11, pp. 3697-3717, Nov. 2005.
[34] T. Werner, “A Linear Programming Approach to Max-Sum Problem: A Review,” Technical Report CTU-CMP-2005-25, Center for Machine Perception, Czech Technical Univ., Dec. 2005.
[35] J.S. Yedidia, W.T. Freeman, and Y. Weiss, “Generalized Belief Propagation,” Proc. Conf. Neural Information Processing Systems, pp. 689-695, 2000.

Index Terms:
Energy minimization, graph algorithms, message passing, belief propagation, early vision, Markov random fields, stereo.
Citation:
Vladimir Kolmogorov, "Convergent Tree-Reweighted Message Passing for Energy Minimization," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 1568-1583, Oct. 2006, doi:10.1109/TPAMI.2006.200
Usage of this product signifies your acceptance of the Terms of Use.