Towards More Efficient and Effective LP-Based Algorithms for MRF Optimization

  • Nikos Komodakis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6312)


This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is applicable to both pairwise and higher order MRFs, as well as to any type of dual relaxation. It relies on combining two ideas. The first one is inspired by algebraic multigrid approaches for linear systems, while the second one employs a novel decimation strategy that carefully fixes the labels for a growing subset of nodes during the course of a dual LP-based algorithm. Experimental results on a wide variety of vision problems demonstrate the great effectiveness of this framework.


Dual Variable Master Problem Stereo Match Dual Objective Pairwise Potential 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supplementary material

978-3-642-15552-9_38_MOESM1_ESM.pdf (66 kb)
Electronic Supplementary Material (67 KB)


  1. 1.
    Wainwright, M., Jaakkola, T., Willsky, A.: Map estimation via agreement on trees: message-passing and linear programming. IEEE Trans. on Info. Theory (2005)Google Scholar
  2. 2.
    Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. PAMI (2006)Google Scholar
  3. 3.
    Komodakis, N., Paragios, N., Tziritas, G.: MRF optimization via dual decomposition: Message-passing revisited. In: ICCV (2007)Google Scholar
  4. 4.
    Werner, T.: A linear programming approach to max-sum problem: A review. PAMI (2007)Google Scholar
  5. 5.
    Szeliski, R., et al.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. PAMI (2008)Google Scholar
  6. 6.
    Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. IJCV 70, 41–54 (2006)CrossRefGoogle Scholar
  7. 7.
    Komodakis, N., Tziritas, G.: Image completion using efficient belief propagation via priority scheduling and dynamic pruning. In: IEEE TIP (2007)Google Scholar
  8. 8.
    Braunstein, A., Mézard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms 27, 201–226 (2005)zbMATHCrossRefGoogle Scholar
  9. 9.
    Kovtun, I.: Partial optimal labeling search for a np-hard subclass of (max,+) problems. In: Michaelis, B., Krell, G. (eds.) DAGM 2003. LNCS, vol. 2781, pp. 402–409. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Alahari, K., Kohli, P., Torr, P.: Reduce, reuse and recycle: Efficiently solving multi-label mrfs. In: CVPR (2008)Google Scholar
  11. 11.
    Shekhovtsov, A., Kovtun, I., Hlaváč, V.: Efficient mrf deformation model for non-rigid image matching. In: CVIU (2008)Google Scholar
  12. 12.
  13. 13.
    Dykstra, R.L.: An iterative procedure for obtaining i-projections onto the intersection of convex sets. Annals of Probability (1985)Google Scholar
  14. 14.
    Komodakis, N., Paragios, N.: Beyond pairwise energies: Efficient optimization for higher-order MRFs. In: CVPR (2009)Google Scholar
  15. 15.
    Meltzer, T., Yanover, C., Weiss, Y.: Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: ICCV (2005)Google Scholar
  16. 16.
    Kohli, P., Kumar, P., Torr, P.: P3 and beyond: Solving energies with higher order cliques. In: CVPR (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Nikos Komodakis
    • 1
  1. 1.Computer Science DepartmentUniversity of Crete 

Personalised recommendations