{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T05:21:46Z","timestamp":1789622506410,"version":"build-2803163510"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100004807","name":"German Research Foundation (DFG)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004807","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Spatio-\/Temporal Graphical Models and Applications in Image Analysis","award":["GRK 1653"],"award-info":[{"award-number":["GRK 1653"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2016,7,1]]},"DOI":"10.1109\/tpami.2015.2484327","type":"journal-article","created":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T20:33:49Z","timestamp":1444768429000},"page":"1370-1382","source":"Crossref","is-referenced-by-count":8,"title":["Partial Optimality by Pruning for MAP-Inference with General Graphical Models"],"prefix":"10.1109","volume":"38","author":[{"given":"Paul","family":"Swoboda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Shekhovtsov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorg Hendrik","family":"Kappes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Schnorr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bogdan","family":"Savchynskyy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Found Trends Mach Learn"},{"key":"ref33","author":"strandmark","year":"0"},{"key":"ref32","first-page":"503","article-title":"Tightening lp relaxations for map using message passing","author":"sontag","year":"0","journal-title":"Proc 24th Conf Uncertainty in Artific Intell"},{"key":"ref31","first-page":"795","article-title":"Efficiently searching for frustrated cycles in MAP inference","author":"sontag","year":"0","journal-title":"Proc 8th Conf Annu Conf Uncertainty Artif Intell"},{"key":"ref30","article-title":"Approximate inference in graphical models using LP relaxations","author":"sontag","year":"2010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70844"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.153"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38267-3_40"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.91"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33783-3_29"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.145"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.06.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.175"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247863"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.229"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33712-3_11"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390217"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.108"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23094-3_7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126347"},{"key":"ref27","first-page":"113","article-title":"Syntactic analysis of two-dimensional visual signals in the presence of noise","volume":"12","author":"schlesinger","year":"1976","journal-title":"Kibernetika"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/356539a0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612354"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.152"},{"key":"ref5","first-page":"553","article-title":"Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations","author":"globerson","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-0031-y"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079014"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"ref9","year":"0"},{"key":"ref1","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45243-0_52"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"ref21","first-page":"35","article-title":"Sufficient condition for partial optimality for (max, +) labeling problems and its usage","volume":"2","author":"kovtun","year":"2011","journal-title":"Control Syst Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995652"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.0158"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383203"},{"key":"ref26","first-page":"746","article-title":"Efficient MRF energy minimization via adaptive diminishing smoothing","author":"savchynskyy","year":"0","journal-title":"Proc Uncertainty Artif Intell"},{"key":"ref25","first-page":"1950","article-title":"Global MAP-optimality by shrinking the combinatorial search area with convex relaxation","author":"savchynskyy","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7484354\/07297868.pdf?arnumber=7297868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:48Z","timestamp":1641987948000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7297868\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,1]]},"references-count":41,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2015.2484327","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,1]]}}}