Abstract
Graphical models with higher order factors are an important tool for pattern recognition that has recently attracted considerable attention. Inference based on such models is challenging both from the view point of software design and optimization theory. In this article, we use the new C++ template library OpenGM to empirically compare inference algorithms on a set of synthetic and real-world graphical models with higher order factors that are used in computer vision. While inference algorithms have been studied intensively for graphical models with second order factors, an empirical comparison for higher order models has so far been missing. This article presents a first set of experiments that intends to fill this gap.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Francisco (1988)
Koller, D., Friedman, N.: Probabilistic Graphical Models. MIT Press, Cambridge (2009)
Aji, S., McEliece, R.: The generalized distributive law. IEEE Transactions on Information Theory 46(2), 325–343 (2000)
Kschischang, F., Member, S., Frey, B.J., Andrea Loeliger, H.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47, 498–519 (2001)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE TPAMI 23(11), 1222–1239 (2001)
Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 65–81. Springer, Heidelberg (2002)
Schlesinger, D.: Exact solution of permuted submodular minsum problems. In: Yuille, A.L., Zhu, S.-C., Cremers, D., Wang, Y. (eds.) EMMCVPR 2007. LNCS, vol. 4679, pp. 28–38. Springer, Heidelberg (2007)
Komodakis, N., Paragios, N.: Beyond Pairwise Energies: Efficient Optimization for Higher-order MRFs (June 2009)
Kohli, P., Kumar, M.P., Torr, P.H.: P3 & beyond: Move making algorithms for solving higher order functions. IEEE Transactions on Pattern Analysis and Machine Intelligence 31(9), 1645–1656 (2009)
Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing sparse higher order energy functions of discrete variables. In: CVPR, pp. 1382–1389 (2009)
Kohli, P., Ladický, L., Torr, P.H.: Robust higher order potentials for enforcing label consistency. Int. J. Comput. Vision 82(3), 302–324 (2009)
Murphy, K.P., Weiss, Y., Jordan, M.I.: Loopy belief propagation for approximate inference: An empirical study. In: Foo, N.Y. (ed.) AI 1999. LNCS, vol. 1747, pp. 467–475. Springer, Heidelberg (1999)
Weiss, Y., Freeman, W.T.: On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory 47(2), 736–744 (2001)
Wainwright, M.J., Jordan, M.I.: Graphical Models, Exponential Families, and Variational Inference. Now Publishers Inc., Hanover (2008)
Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Patt. Anal. Mach. Intell. 28(10), 1568–1583 (2006)
Bergtholdt, M., Kappes, J., Schmidt, S., Schnörr, C.: A study of parts-based object class detection using complete graphs. Int. J. Comp. Vision 87(1-2), 93–117 (2010)
Besag, J.: On the statisical analysis of dirty pictures. Journal of the Royal Statistical Society B 48, 259–302 (1986)
Andres, B., Kappes, J.H., Koethe, U., Hamprecht, F.A.: The Lazy Flipper: A minimal exhaustive search algorithm for higher order graphical models (2010) (forthcoming)
Minka, T., Winn, J., Guiver, J., Kannan, A.: Infer.NET 2.3, Microsoft Research Cambridge (2009), http://research.microsoft.com/infernet
Mooij, J.M., et al.: libDAI 0.2.4: A free/open source C++ library for Discrete Approximate Inference (2010), http://www.libdai.org/
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Trans. Pattern Anal. Mach. Intell. 30(6), 1068–1080 (2008)
Kolmogorov, V., Rother, C.: Comparison of energy minimization algorithms for highly connected graphs. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3952, pp. 1–15. Springer, Heidelberg (2006)
Tian, T.P., Sclaroff, S.: Fast Globally Optimal 2D Human Detection with Loopy Graph Models. In: CVPR (2010)
Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Int’l. Conf. Computer Vision, vol. 2, pp. 416–423 (July 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andres, B., Kappes, J.H., Köthe, U., Schnörr, C., Hamprecht, F.A. (2010). An Empirical Comparison of Inference Algorithms for Graphical Models with Higher Order Factors Using OpenGM. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds) Pattern Recognition. DAGM 2010. Lecture Notes in Computer Science, vol 6376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15986-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-15986-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15985-5
Online ISBN: 978-3-642-15986-2
eBook Packages: Computer ScienceComputer Science (R0)