{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:37:57Z","timestamp":1787323077701,"version":"build-2736575974"},"reference-count":54,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GRK 1653"],"award-info":[{"award-number":["GRK 1653"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Imaging Sci."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We introduce a novel approach to Maximum A Posteriori (MAP) inference based on discrete graphical models. By utilizing local Wasserstein distances for coupling assignment measures across edges of the underlying graph, a given discrete objective function is smoothly approximated and restricted to the assignment manifold. A corresponding multiplicative update scheme combines in a single process (i) geometric integration of the resulting Riemannian gradient flow, and (ii) rounding to integral solutions that represent valid labelings. Throughout this process, local marginalization constraints known from the established LP relaxation are satisfied, whereas the smooth geometric setting results in rapidly converging iterations that can be carried out in parallel for every edge.<\/jats:p>","DOI":"10.1137\/17m1150669","type":"journal-article","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T10:51:45Z","timestamp":1527159105000},"page":"1317-1362","source":"Crossref","is-referenced-by-count":9,"title":["Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment"],"prefix":"10.1137","volume":"11","author":[{"given":"Ruben","family":"H\u00fchnerbein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrizio","family":"Savarino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Freddie","family":"\u00c5str\u00f6m","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,5,24]]},"reference":[{"key":"atypb1","first-page":"1079","author":"Aaron A.","year":"2004","journal-title":"SIAM"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00052492"},{"key":"atypb3","unstructured":"B. Andres, T. Beier, and J. H. Kappes,\n                      OpenGM: A C++ Library for Discrete Graphical Models\n                      , preprint,https:\/\/arxiv.org\/abs\/1206.0111, 2012."},{"key":"atypb4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-319-58771-4_30","volume":"10302","author":"\u00c5stro\u0308m F.","year":"2017","journal-title":"Lecture Notes in Comput. Sci."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-016-0702-4"},{"key":"atypb6","first-page":"27","volume":"4","author":"Bauschke H. H.","year":"1997","journal-title":"J. Convex Anal."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-017-0995-9"},{"key":"atypb8","unstructured":"R. Bergmann and D. Tenbrinck,\n                      A Graph Framework for Manifold-Valued Data\n                      , preprint,https:\/\/arxiv.org\/abs\/1702.05293, 2017."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/11083109X"},{"key":"atypb10","unstructured":"S. Boyd and L. Vandenberghe,\n                      Convex Optimization\n                      , 7th ed., Cambridge Univ. Press, 2009."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"atypb13","doi-asserted-by":"crossref","unstructured":"R. Brualdi,\n                      Combinatorial Matrix Classes\n                      , Cambridge Univ. Press, 2006.","DOI":"10.1017\/CBO9780511721182"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940051"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101396937"},{"key":"atypb16","first-page":"2292","author":"Cuturi M.","year":"2013","journal-title":"Inc."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032600"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1137\/0114053"},{"key":"atypb19","doi-asserted-by":"crossref","unstructured":"M. Deza and M. Laurent,\n                      Geometry of Cuts and Metrics\n                      , Springer, 1997.","DOI":"10.1007\/978-3-642-04295-9"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2008.924284"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/070698592"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079014"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0809-x"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160300502"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585268"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/060659624"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2695801"},{"key":"atypb30","unstructured":"A. Nemirovsky and D. Yudin,\n                      Problem Complexity and Method Efficiency in Optimization\n                      , John Wiley & Sons, 1983."},{"key":"atypb31","doi-asserted-by":"crossref","unstructured":"Y. Nesterov and A. Nemirovskii,\n                      Interior-Point Polynomial Algorithms in Convex Programming\n                      , SIAM Stud. Appl. Math. 13, SIAM, 1994,https:\/\/doi.org\/10.1137\/1.9781611970791.","DOI":"10.1137\/1.9781611970791"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589101"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1162\/0899766054026693"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1137\/15M1010087"},{"key":"atypb35","first-page":"289","volume":"22","author":"Pham Dinh T.","year":"1997","journal-title":"Acta Math. Vietnamica"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494274313"},{"key":"atypb37","first-page":"1043","volume":"11","author":"Ravikumar P.","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585941"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00941306"},{"key":"atypb40","unstructured":"R. Rockafellar and R. J.B. Wets,\n                      Variational Analysis\n                      , 2nd ed., Springer, 2009."},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58771-4_29"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-016-0653-9"},{"key":"atypb44","unstructured":"B. Schmitzer,\n                      Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems\n                      , preprint,https:\/\/arxiv.org\/abs\/1610.06519, 2016."},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582253"},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2484327"},{"key":"atypb48","doi-asserted-by":"crossref","unstructured":"T. Terlaky, ed.\n                      Interior Point Methods of Mathematical Programming\n                      , Springer, 1996.","DOI":"10.1007\/978-1-4613-3449-1"},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1561\/2200000001"},{"key":"atypb51","doi-asserted-by":"crossref","unstructured":"Y. Weiss,\n                      Comparing the mean field method and belief propagation for approximate inference in MRFs\n                      , in Advanced Mean Field Methods: Theory and Practice, MIT Press, 2001, pp. 229-240.","DOI":"10.7551\/mitpress\/1100.003.0019"},{"key":"atypb52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"atypb53","first-page":"1887","volume":"7","author":"Yanover C.","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"atypb54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"}],"container-title":["SIAM Journal on Imaging Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1150669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:40:45Z","timestamp":1787319645000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1150669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1150669"],"URL":"https:\/\/doi.org\/10.1137\/17m1150669","relation":{},"ISSN":["1936-4954"],"issn-type":[{"value":"1936-4954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}