{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:38:17Z","timestamp":1774600697750,"version":"3.50.1"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T00:00:00Z","timestamp":1426291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11263-015-0809-x","type":"journal-article","created":{"date-parts":[[2015,3,13]],"date-time":"2015-03-13T10:39:02Z","timestamp":1426243142000},"page":"155-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":126,"title":["A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems"],"prefix":"10.1007","volume":"115","author":[{"given":"J\u00f6rg H.","family":"Kappes","sequence":"first","affiliation":[]},{"given":"Bjoern","family":"Andres","sequence":"additional","affiliation":[]},{"given":"Fred A.","family":"Hamprecht","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Nowozin","sequence":"additional","affiliation":[]},{"given":"Dhruv","family":"Batra","sequence":"additional","affiliation":[]},{"given":"Sungwoong","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Bernhard X.","family":"Kausler","sequence":"additional","affiliation":[]},{"given":"Thorben","family":"Kr\u00f6ger","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Lellmann","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Komodakis","sequence":"additional","affiliation":[]},{"given":"Bogdan","family":"Savchynskyy","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Rother","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,14]]},"reference":[{"issue":"1","key":"809_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., & Martin, A. (2005). Branching rules revisited. Operations Research Letters, 33(1), 42\u201354.","journal-title":"Operations Research Letters"},{"key":"809_CR2","unstructured":"Alahari, K., Kohli, P., & Torr, P. H. S. (2008). Reduce, reuse and recycle: Efficiently solving multi-label MRFs. In: CVPR."},{"issue":"10","key":"809_CR3","doi-asserted-by":"crossref","first-page":"1846","DOI":"10.1109\/TPAMI.2009.194","volume":"32","author":"K Alahari","year":"2010","unstructured":"Alahari, K., Kohli, P., & Torr, P. H. S. (2010). Dynamic hybrid algorithms for MAP inference in discrete MRFs. IEEE PAMI, 32(10), 1846\u20131857.","journal-title":"IEEE PAMI"},{"key":"809_CR4","unstructured":"Andres, B., Beier, T., & Kappes, J. H. (2014). OpenGM2. http:\/\/hci.iwr.uni-heidelberg.de\/opengm2\/ ."},{"key":"809_CR5","unstructured":"Andres, B., Beier, T., & Kappes, J. H. (2012). OpenGM: A C++ library for discrete graphical models. ArXiv e-prints. http:\/\/arxiv.org\/abs\/1206.0111 ."},{"key":"809_CR6","doi-asserted-by":"crossref","unstructured":"Andres, B., Kappes, J. H., Beier, T., K\u00f6the, U., & Hamprecht, F. A. (2011). Probabilistic image segmentation with closedness constraints. In ICCV.","DOI":"10.1109\/ICCV.2011.6126550"},{"key":"809_CR7","doi-asserted-by":"crossref","unstructured":"Andres, B., Kappes, J. H., Beier, T., K\u00f6the, U., & Hamprecht, F. A. (2012). The lazy flipper: Efficient depth-limited exhaustive search in discrete graphical models. In ECCV.","DOI":"10.1007\/978-3-642-33786-4_12"},{"key":"809_CR8","doi-asserted-by":"crossref","unstructured":"Andres, B., Kappes, J. H., K\u00f6the, U., Schn\u00f6rr, C., & Hamprecht, F. A. (2010). An empirical comparison of inference algorithms for graphical models with higher order factors using OpenGM. In DAGM.","DOI":"10.1007\/978-3-642-15986-2_36"},{"key":"809_CR9","doi-asserted-by":"crossref","unstructured":"Andres, B., K\u00f6the, U., Kroeger, T., Helmstaedter, M., Briggman, K. L., Denk, W., & Hamprecht, F. A. (2012). 3D segmentation of SBFSEM images of neuropil by a graphical model over supervoxel boundaries. Medical Image Analysis, 16(4), 796\u2013805. doi: 10.1016\/j.media.2011.11.004 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1361841511001666 .","DOI":"10.1016\/j.media.2011.11.004"},{"key":"809_CR10","doi-asserted-by":"crossref","unstructured":"Andres, B., Kr\u00f6ger, T., Briggman, K. L., Denk, W., Korogod, N., Knott, G., K\u00f6the, U., & Hamprecht, F. A. (2012). Globally optimal closed-surface segmentation for connectomics. In ECCV.","DOI":"10.1007\/978-3-642-33712-3_56"},{"key":"809_CR11","doi-asserted-by":"crossref","unstructured":"Batra, D., & Kohli, P. (2011). Making the right moves: Guiding alpha-expansion using local primal-dual gaps. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2011 (pp. 1865\u20131872). IEEE.","DOI":"10.1109\/CVPR.2011.5995449"},{"key":"809_CR12","doi-asserted-by":"crossref","unstructured":"Bergtholdt, M., Kappes, J. H., Schmidt, S., & Schn\u00f6rr, C. (2010). A study of parts-based object class detection using complete graphs. IJCV, 87(1\u20132), 93\u2013117.","DOI":"10.1007\/s11263-009-0209-1"},{"issue":"3","key":"809_CR13","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. (1986). On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society. Series B (Methodological), 48(3), 259\u2013302. doi: 10.2307\/2345426 .","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"issue":"1\u20132","key":"809_CR14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-013-0688-2","volume":"146","author":"T Bonato","year":"2014","unstructured":"Bonato, T., J\u00fcnger, M., Reinelt, G., & Rinaldi, G. (2014). Lifting and separation procedures for the cut polytope. Mathematical Programming A, 146(1\u20132), 351\u2013378. doi: 10.1007\/s10107-013-0688-2 .","journal-title":"Mathematical Programming A"},{"key":"809_CR15","doi-asserted-by":"crossref","unstructured":"Boykov, Y. (2003). Computing geodesics and minimal surfaces via graph cuts. In ICCV.","DOI":"10.1109\/ICCV.2003.1238310"},{"issue":"11","key":"809_CR16","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. (2001). Fast approximate energy minimization via graph cuts. IEEE PAMI, 23(11), 1222\u20131239. doi: 10.1109\/34.969114 .","journal-title":"IEEE PAMI"},{"issue":"2","key":"809_CR17","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., Delling, D., Gaertler, M., G\u00f6rke, R., Hoefer, M., Nikoloski, Z., et al. (2008). On modularity clustering. IEEE Transactions on Knowledge and Data Engineering, 20(2), 172\u2013188.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"809_CR18","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G C\u0103linescu","year":"2000","unstructured":"C\u0103linescu, G., Karloff, H., & Rabani, Y. (2000). An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences, 60(3), 564\u2013574.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"809_CR19","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1137\/S0895480101396937","volume":"18","author":"C Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S., Naor, J., & Zosin, L. (2004). A linear programming formulation and approximation algorithms for the metric labeling problem. SIAM Journal of Discrete Mathematics, 18(3), 608\u2013625.","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"4","key":"809_CR20","first-page":"S425","volume":"5","author":"CA Cocosco","year":"1997","unstructured":"Cocosco, C. A., Kollokian, V., Kwan, R. S., & Evans, A. C. (1997). Brainweb: Online interface to a 3d MRI simulated brain database. NeuroImage, 5(4), S425.","journal-title":"NeuroImage"},{"key":"809_CR21","unstructured":"IBM, ILOG CPLEX Optimizer. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/ (2013)."},{"key":"809_CR22","doi-asserted-by":"crossref","unstructured":"Delong, A., Osokin, A., Isack, H., & Boykov, Y. (2012). Fast approximate energy minimization with label costs. International Journal of Computer Vision, 96, 1\u201327. http:\/\/www.csd.uwo.ca\/~yuri\/Abstracts\/ijcv10_lc-abs.shtml .","DOI":"10.1007\/s11263-011-0437-z"},{"key":"809_CR23","unstructured":"Elidan, G., & Globerson, A. (2011) The probabilistic inference challenge (PIC2011). http:\/\/www.cs.huji.ac.il\/project\/PASCAL\/ ."},{"issue":"1","key":"809_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s11263-006-7899-4","volume":"70","author":"PF Felzenszwalb","year":"2006","unstructured":"Felzenszwalb, P. F., & Huttenlocher, D. P. (2006). Efficient belief propagation for early vision. International Journal of Computer Vision, 70(1), 41\u201354.","journal-title":"International Journal of Computer Vision"},{"key":"809_CR25","doi-asserted-by":"crossref","unstructured":"Fix, A., Gruber, A., Boros, E., & Zabih, R. (2011). A graph cut algorithm for higher-order Markov random fields. In ICCV. doi: 10.1109\/ICCV.2011.6126347 .","DOI":"10.1109\/ICCV.2011.6126347"},{"key":"809_CR26","doi-asserted-by":"crossref","unstructured":"Gallagher, A. C., Batra, D., & Parikh, D. (2011). Inference for order reduction in Markov random fields. In CVPR.","DOI":"10.1109\/CVPR.2011.5995452"},{"key":"809_CR27","unstructured":"Globerson, A., & Jaakkola, T. (2007). Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In NIPS."},{"issue":"1","key":"809_CR28","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D Goldberg","year":"1991","unstructured":"Goldberg, D. (1991). What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 23(1), 5\u201348. doi: 10.1145\/103162.103163 .","journal-title":"ACM Computing Surveys"},{"key":"809_CR29","unstructured":"Gorelick, L., Veksler, O., Boykov, Y., Ben Ayed, I., & Delong, A. (2014). Local submodular approximations for binary pairwise energies. In Computer Vision and Pattern Recognition."},{"key":"809_CR30","doi-asserted-by":"crossref","unstructured":"Gould, S., Fulton, R., & Koller, D. (2009). Decomposing a scene into geometric and semantically consistent regions. In ICCV.","DOI":"10.1109\/ICCV.2009.5459211"},{"issue":"2","key":"809_CR31","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard, M., & Kim, S. (1987). Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Programming, 39(2), 215\u2013228.","journal-title":"Mathematical Programming"},{"issue":"3","key":"809_CR32","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/s11263-010-0400-4","volume":"91","author":"D Hoiem","year":"2011","unstructured":"Hoiem, D., Efros, A. A., & Hebert, M. (2011). Recovering occlusion boundaries from an image. IJCV, 91(3), 328\u2013346.","journal-title":"IJCV"},{"key":"809_CR33","unstructured":"Hutter, F., Hoos, H. H., & St\u00fctzle, T. (2005). Efficient stochastic local search for MPE solving. In L. P. Kaelbling & A. Saffiotti (Eds.), IJCAI (pp. 169\u2013174)."},{"issue":"2","key":"809_CR34","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1089\/cmb.2006.13.145","volume":"13","author":"A Jaimovich","year":"2006","unstructured":"Jaimovich, A., Elidan, G., Margalit, H., & Friedman, N. (2006). Towards an integrated protein\u2013protein interaction network: A relational Markov network approach. Journal of Computational Biology, 13(2), 145\u2013164.","journal-title":"Journal of Computational Biology"},{"key":"809_CR35","doi-asserted-by":"crossref","unstructured":"Kappes, J. H., Andres, B., Hamprecht, F. A., Schn\u00f6rr, C., Nowozin, S., Batra, D., Kim, S., Kausler, B. X., Lellmann, J., Komodakis, N., & Rother, C. (2013). A comparative study of modern inference techniques for discrete energy minimization problem. In CVPR.","DOI":"10.1109\/CVPR.2013.175"},{"key":"809_CR36","unstructured":"Kappes, J. H., Beier, T., & Schn\u00f6rr, C. (2014). MAP-inference on large scale higher-order discrete graphical models by fusion moves. In ECCV\u2014International Workshop on Graphical Models in Computer Vision."},{"key":"809_CR37","doi-asserted-by":"crossref","unstructured":"Kappes, J. H., Savchynskyy, B., & Schn\u00f6rr, C. (2012). A bundle approach to efficient MAP-inference by Lagrangian relaxation. In CVPR.","DOI":"10.1109\/CVPR.2012.6247863"},{"key":"809_CR38","doi-asserted-by":"crossref","unstructured":"Kappes, J. H., Speth, M., Andres, B., Reinelt, G., & Schn\u00f6rr, C. (2011). Globally optimal image partitioning by multicuts. In EMMCVPR.","DOI":"10.1007\/978-3-642-23094-3_3"},{"key":"809_CR39","unstructured":"Kappes, J. H., Speth, M., Reinelt, G., & Schn\u00f6rr, C. (2013). Higher-order segmentation via multicuts. ArXiv e-prints. http:\/\/arxiv.org\/abs\/1305.6387 ."},{"key":"809_CR40","doi-asserted-by":"crossref","unstructured":"Kappes, J. H., Speth, M., Reinelt, G., & Schn\u00f6rr, C. (2013). Towards efficient and exact MAP-inference for large scale discrete computer vision problems via combinatorial optimization. InCVPR.","DOI":"10.1109\/CVPR.2013.229"},{"key":"809_CR41","doi-asserted-by":"crossref","unstructured":"Kausler, B. X., Schiegg, M., Andres, B., Lindner, M., Leitte, H., Hufnagel, L., Koethe, U., & Hamprecht, F. A. (2012). A discrete chain graph model for 3d+t cell tracking with high misdetection robustness. In ECCV.","DOI":"10.1007\/978-3-642-33712-3_11"},{"issue":"2","key":"809_CR42","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B. W., & Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. The Bell Systems Technical Journal, 49(2), 291\u2013307.","journal-title":"The Bell Systems Technical Journal"},{"key":"809_CR43","unstructured":"Kim, S., Nowozin, S., Kohli, P., & Yoo, C. D. (2011). Higher-order correlation clustering for image segmentation. In NIPS (pp. 1530\u20131538)."},{"key":"809_CR44","doi-asserted-by":"crossref","unstructured":"Kim, T., Nowozin, S., Kohli, P., & Yoo, C. D. (2011). Variable grouping for energy minimization. In CVPR (pp. 1913\u20131920).","DOI":"10.1109\/CVPR.2011.5995645"},{"key":"809_CR45","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., & Tardos, \u00c9. (1999). Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS).","DOI":"10.1109\/SFFCS.1999.814572"},{"issue":"3","key":"809_CR46","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s11263-008-0202-0","volume":"82","author":"P Kohli","year":"2009","unstructured":"Kohli, P., Ladicky, L., & Torr, P. (2009). Robust higher order potentials for enforcing label consistency. International Journal of Computer Vision, 82(3), 302\u2013324. doi: 10.1007\/s11263-008-0202-0 .","journal-title":"International Journal of Computer Vision"},{"key":"809_CR47","volume-title":"Probabilistic graphical models: Principles and techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., & Friedman, N. (2009). Probabilistic graphical models: Principles and techniques. Cambridge: MIT Press."},{"issue":"10","key":"809_CR48","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. PAMI, 28(10), 1568\u20131583.","journal-title":"PAMI"},{"key":"809_CR49","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., & Rother, C. (2006). Comparison of energy minimization algorithms for highly connected graphs. In ECCV (pp. 1\u201315).","DOI":"10.1007\/11744047_1"},{"key":"809_CR50","unstructured":"Kolmogorov, V., & Zabih, R. (2002). What energy functions can be minimized via graph cuts? In ECCV. http:\/\/dl.acm.org\/citation.cfm?id=645317.649315 ."},{"key":"809_CR51","doi-asserted-by":"crossref","unstructured":"Komodakis, N., & Paragios, N. (2008). Beyond loose LP-relaxations: Optimizing MRFs by repairing cycles. In ECCV.","DOI":"10.1007\/978-3-540-88690-7_60"},{"issue":"3","key":"809_CR52","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TPAMI.2010.108","volume":"33","author":"N Komodakis","year":"2011","unstructured":"Komodakis, N., Paragios, N., & Tziritas, G. (2011). MRF energy minimization and beyond via dual decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(3), 531\u2013552.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"8","key":"809_CR53","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1109\/TPAMI.2007.1061","volume":"29","author":"N Komodakis","year":"2007","unstructured":"Komodakis, N., & Tziritas, G. (2007). Approximate labeling via graph cuts based on linear programming. IEEE PAMI, 29(8), 1436\u20131453. doi: 10.1109\/TPAMI.2007.1061 .","journal-title":"IEEE PAMI"},{"key":"809_CR54","unstructured":"Kovtun, I. (2003). Partial optimal labeling search for a np-hard subclass of (max, +) problems. In B. Michaelis & G. Krell (Eds.), DAGM-Symposium, Lecture Notes in Computer Science (Vol. 2781, pp. 402\u2013409). Heidelberg: Springer."},{"key":"809_CR55","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical Models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen, S. L. (1996). Graphical Models. Oxford: Oxford University Press."},{"issue":"4","key":"809_CR56","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1137\/100805844","volume":"4","author":"J Lellmann","year":"2011","unstructured":"Lellmann, J., & Schn\u00f6rr, C. (2011). Continuous multiclass labeling approaches and algorithms. SIAM Journal of Imaging Sciences, 4(4), 1049\u20131096.","journal-title":"SIAM Journal of Imaging Sciences"},{"issue":"8","key":"809_CR57","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1109\/TPAMI.2009.143","volume":"32","author":"V Lempitsky","year":"2010","unstructured":"Lempitsky, V., Rother, C., Roth, S., & Blake, A. (2010). Fusion moves for Markov random field optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(8), 1392\u20131405. doi: 10.1109\/TPAMI.2009.143 .","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"809_CR58","unstructured":"Martins, A. F. T., Figueiredo, M. A. T., Aguiar, P. M. Q., Smith, N. A., & Xing, E. P. (2011). An augmented lagrangian approach to constrained MAP inference. In ICML (pp. 169\u2013176)."},{"key":"809_CR59","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s11263-013-0619-y","volume":"104","author":"C Nieuwenhuis","year":"2013","unstructured":"Nieuwenhuis, C., Toeppe, E., & Cremers, D. (2013). A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model. International Journal of Computer Vision, 104, 223\u2013240. doi: 10.1007\/s11263-013-0619-y .","journal-title":"International Journal of Computer Vision"},{"issue":"3\u20134","key":"809_CR60","first-page":"185","volume":"6","author":"S Nowozin","year":"2011","unstructured":"Nowozin, S., & Lampert, C. H. (2011). Structured learning and prediction in computer vision. Foundations and Trends in Computer Graphics and Vision, 6(3\u20134), 185\u2013365.","journal-title":"Foundations and Trends in Computer Graphics and Vision"},{"key":"809_CR61","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Rother, C., Bagon, S., Sharp, T., Yao, B., & Kohli, P. (2011). Decision tree fields. In ICCV (pp. 1668\u20131675). IEEE.","DOI":"10.1109\/ICCV.2011.6126429"},{"key":"809_CR62","unstructured":"Orabona, F., Hazan, T., Sarwate, A., & Jaakkola, T. (2014). On measure concentration of random maximum a-posteriori perturbations. In Proc. ICML."},{"key":"809_CR63","doi-asserted-by":"crossref","unstructured":"Osokin, A., Vetrov, D., & Kolmogorov, V. (2011). Submodular decomposition framework for inference in associative markov networks with global constraints. In CVPR (pp. 1889\u20131896).","DOI":"10.1109\/CVPR.2011.5995361"},{"key":"809_CR64","unstructured":"Otten, L., & Dechter, R. (2011). Anytime AND\/OR depth-first search for combinatorial optimization. In Proceedings of the Annual Symposium on Combinatorial Search (SOCS)."},{"key":"809_CR65","doi-asserted-by":"crossref","unstructured":"Papandreou, G., & Yuille, A. (2011). Perturb-and-MAP random fields: Using discrete optimization to learn and sample from energy models. In Proc. ICCV.","DOI":"10.1109\/ICCV.2011.6126242"},{"key":"809_CR66","volume-title":"Probabilistic reasoning in intelligent systems: Networks of plausible inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Francisco, CA: Morgan Kaufmann Publishers Inc."},{"key":"809_CR67","unstructured":"Prua, D., & Werner, T. (2013). Universality of the local marginal polytope. In CVPR (pp. 1738\u20131743). IEEE."},{"key":"809_CR68","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Lempitsky, V. S., & Szummer, M. (2007). Optimizing binary MRFs via extended roof duality. InCVPR.","DOI":"10.1109\/CVPR.2007.383203"},{"key":"809_CR69","doi-asserted-by":"crossref","unstructured":"Rother, C., Kumar, S., Kolmogorov, V., & Blake, A. (2005). Digital tapestry. In Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201905) (Vol. 1, pp. 589\u2013596). IEEE Computer Society, Washington, DC, USA. doi: 10.1109\/CVPR.2005.130 .","DOI":"10.1109\/CVPR.2005.130"},{"key":"809_CR70","unstructured":"Savchynskyy, B., Kappes, J. H., Swoboda, P., & Schn\u00f6rr, C. (2013). Global MAP-optimality by shrinking the combinatorial search area with convex relaxation. In NIPS."},{"key":"809_CR71","doi-asserted-by":"crossref","unstructured":"Savchynskyy, B., & Schmidt, S. (2013). Getting feasible variable estimates from infeasible ones: MRF local polytope study. In Workshop on Inference for Probabilistic Graphical Models at ICCV 2013.","DOI":"10.1109\/ICCVW.2013.43"},{"key":"809_CR72","doi-asserted-by":"crossref","unstructured":"Savchynskyy, B., & Schmidt, S. (2014). Getting feasible variable estimates from infeasible ones: MRF local polytope study. In Advanced structured prediction. MIT Press.","DOI":"10.7551\/mitpress\/9969.003.0008"},{"key":"809_CR73","first-page":"746","volume":"2012","author":"B Savchynskyy","year":"2012","unstructured":"Savchynskyy, B., Schmidt, S., Kappes, J. H., & Schn\u00f6rr, C. (2012). Efficient MRF energy minimization via adaptive diminishing smoothing. UAI, 2012, 746\u2013755.","journal-title":"UAI"},{"key":"809_CR74","first-page":"113","volume":"4","author":"M Schlesinger","year":"1976","unstructured":"Schlesinger, M. (1976). Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (Syntactic analysis of two-dimensional visual signals in noisy conditions). Kibernetika, 4, 113\u2013130.","journal-title":"Kibernetika"},{"key":"809_CR75","unstructured":"Sontag, D., Choe, D. K., & Li, Y. (2012). Efficiently searching for frustrated cycles in MAP inference. In N. de Freitas & K. P. Murphy (Eds.) UAI (pp. 795\u2013804). AUAI Press."},{"key":"809_CR76","doi-asserted-by":"crossref","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., et al. (2008). A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. IEEE PAMI, 30(6), 1068\u20131080. doi: 10.1109\/TPAMI.2007.70844 .","DOI":"10.1109\/TPAMI.2007.70844"},{"key":"809_CR77","unstructured":"Tarlow, D., Batra, D., Kohli, P., & Kolmogorov, V. (2011). Dynamic tree block coordinate ascent. In Proceedings of the International Conference on Machine Learning (ICML)."},{"key":"809_CR78","doi-asserted-by":"crossref","unstructured":"Verma, T., & Batra, D. (2012). Maxflow revisited: An empirical comparison of maxflow algorithms for dense vision problems. In BMVC (pp. 1\u201312).","DOI":"10.5244\/C.26.61"},{"issue":"11","key":"809_CR79","doi-asserted-by":"crossref","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"MJ Wainwright","year":"2005","unstructured":"Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2005). MAP estimation via agreement on trees: Message-passing and linear programming. IEEE Transactions on Information Theory, 51(11), 3697\u20133717.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"809_CR80","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T Werner","year":"2007","unstructured":"Werner, T. (2007). A linear programming approach to max-sum problem: A review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(7), 1165\u20131179. doi: 10.1109\/TPAMI.2007.1036 .","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"809_CR81","unstructured":"Wesselmann, F., & Stuhl, U. (2012). Implementing cutting plane management and selection techniques. Tech. rep., University of Paderborn. http:\/\/www.optimization-online.org\/DB_HTML\/2012\/12\/3714.html ."},{"issue":"12","key":"809_CR82","doi-asserted-by":"crossref","first-page":"2115","DOI":"10.1109\/TPAMI.2009.131","volume":"31","author":"OJ Woodford","year":"2009","unstructured":"Woodford, O. J., Torr, P. H. S., Reid, I. D., & Fitzgibbon, A. W. (2009). Global stereo reconstruction under second order smoothness priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(12), 2115\u20132128.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"7","key":"809_CR83","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1089\/cmb.2007.0158","volume":"15","author":"C Yanover","year":"2008","unstructured":"Yanover, C., Schueler-Furman, O., & Weiss, Y. (2008). Minimizing and learning energy functions for side-chain prediction. Journal of Computational Biology, 15(7), 899\u2013911.","journal-title":"Journal of Computational Biology"},{"key":"809_CR84","unstructured":"Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2004). Constructing free energy approximations and generalized belief propagation algorithms. MERL Technical Report, 2004\u2013040. http:\/\/www.merl.com\/papers\/docs\/TR2004-040 ."}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-015-0809-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-015-0809-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-015-0809-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T20:46:24Z","timestamp":1717793184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-015-0809-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,14]]},"references-count":84,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s11263-015-0809-x","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,14]]}}}