{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T14:26:20Z","timestamp":1759587980527,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159855"},{"type":"electronic","value":"9783642159862"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15986-2_36","type":"book-chapter","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T04:47:46Z","timestamp":1284698866000},"page":"353-362","source":"Crossref","is-referenced-by-count":8,"title":["An Empirical Comparison of Inference Algorithms for Graphical Models with Higher Order Factors Using OpenGM"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Andres","sequence":"first","affiliation":[]},{"given":"J\u00f6rg H.","family":"Kappes","sequence":"additional","affiliation":[]},{"given":"Ullrich","family":"K\u00f6the","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[]},{"given":"Fred A.","family":"Hamprecht","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Francisco (1988)"},{"key":"36_CR2","volume-title":"Probabilistic Graphical Models","author":"D. Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models. MIT Press, Cambridge (2009)"},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/18.825794","volume":"46","author":"S. Aji","year":"2000","unstructured":"Aji, S., McEliece, R.: The generalized distributive law. IEEE Transactions on Information Theory\u00a046(2), 325\u2013343 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"F. Kschischang","year":"2001","unstructured":"Kschischang, F., Member, S., Frey, B.J., Andrea Loeliger, H.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory\u00a047, 498\u2013519 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"36_CR5","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE TPAMI\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE TPAMI"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-47977-5_5","volume-title":"Computer Vision - ECCV 2002","author":"V. Kolmogorov","year":"2002","unstructured":"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.\u00a02352, pp. 65\u201381. Springer, Heidelberg (2002)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-74198-5_3","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"D. Schlesinger","year":"2007","unstructured":"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.\u00a04679, pp. 28\u201338. Springer, Heidelberg (2007)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N.: Beyond Pairwise Energies: Efficient Optimization for Higher-order MRFs (June 2009)","DOI":"10.1109\/CVPRW.2009.5206846"},{"issue":"9","key":"36_CR9","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1109\/TPAMI.2008.217","volume":"31","author":"P. Kohli","year":"2009","unstructured":"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\u00a031(9), 1645\u20131656 (2009)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing sparse higher order energy functions of discrete variables. In: CVPR, pp. 1382\u20131389 (2009)","DOI":"10.1109\/CVPR.2009.5206739"},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s11263-008-0202-0","volume":"82","author":"P. Kohli","year":"2009","unstructured":"Kohli, P., Ladick\u00fd, L., Torr, P.H.: Robust higher order potentials for enforcing label consistency. Int. J. Comput. Vision\u00a082(3), 302\u2013324 (2009)","journal-title":"Int. J. Comput. Vision"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","first-page":"467","volume-title":"Advanced Topics in Artificial Intelligence","author":"K.P. Murphy","year":"1999","unstructured":"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.\u00a01747, pp. 467\u2013475. Springer, Heidelberg (1999)"},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1109\/18.910585","volume":"47","author":"Y. Weiss","year":"2001","unstructured":"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\u00a047(2), 736\u2013744 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"36_CR14","volume-title":"Graphical Models, Exponential Families, and Variational Inference","author":"M.J. Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I.: Graphical Models, Exponential Families, and Variational Inference. Now Publishers Inc., Hanover (2008)"},{"issue":"10","key":"36_CR15","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell.\u00a028(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans.\u00a0Patt.\u00a0Anal.\u00a0Mach.\u00a0Intell."},{"issue":"1-2","key":"36_CR16","first-page":"93","volume":"87","author":"M. Bergtholdt","year":"2010","unstructured":"Bergtholdt, M., Kappes, J., Schmidt, S., Schn\u00f6rr, C.: A study of parts-based object class detection using complete graphs. Int.\u00a0J.\u00a0Comp.\u00a0Vision\u00a087(1-2), 93\u2013117 (2010)","journal-title":"Int.\u00a0J.\u00a0Comp.\u00a0Vision"},{"key":"36_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J. Besag","year":"1986","unstructured":"Besag, J.: On the statisical analysis of dirty pictures. Journal of the Royal Statistical Society B\u00a048, 259\u2013302 (1986)","journal-title":"Journal of the Royal Statistical Society B"},{"key":"36_CR18","unstructured":"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)"},{"key":"36_CR19","unstructured":"Minka, T., Winn, J., Guiver, J., Kannan, A.: Infer.NET 2.3, Microsoft Research Cambridge (2009), http:\/\/research.microsoft.com\/infernet"},{"key":"36_CR20","unstructured":"Mooij, J.M., et al.: libDAI 0.2.4: A free\/open source C++ library for Discrete Approximate Inference (2010), http:\/\/www.libdai.org\/"},{"issue":"6","key":"36_CR21","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R. Szeliski","year":"2008","unstructured":"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.\u00a030(6), 1068\u20131080 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11744047_1","volume-title":"Computer Vision \u2013 ECCV 2006","author":"V. Kolmogorov","year":"2006","unstructured":"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.\u00a03952, pp. 1\u201315. Springer, Heidelberg (2006)"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Tian, T.P., Sclaroff, S.: Fast Globally Optimal 2D Human Detection with Loopy Graph Models. In: CVPR (2010)","DOI":"10.1109\/CVPR.2010.5540227"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"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\u2019l. Conf. Computer Vision, vol.\u00a02, pp. 416\u2013423 (July 2001)","DOI":"10.1109\/ICCV.2001.937655"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15986-2_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:57:48Z","timestamp":1740520668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15986-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159855","9783642159862"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15986-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}