{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:01:33Z","timestamp":1740132093487,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Moscow State University Joint Research Center","award":["RPD 1053945"],"award-info":[{"award-number":["RPD 1053945"]}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["12-01-00938","12-01-33085"],"award-info":[{"award-number":["12-01-00938","12-01-33085"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tpami.2014.2369046","type":"journal-article","created":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T19:36:58Z","timestamp":1415648218000},"page":"1347-1359","source":"Crossref","is-referenced-by-count":3,"title":["Submodular Relaxation for Inference in Markov Random Fields"],"prefix":"10.1109","volume":"37","author":[{"given":"Anton","family":"Osokin","sequence":"first","affiliation":[]},{"given":"Dmitry P.","family":"Vetrov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"113","article-title":"Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (Syntactic analysis of two-dimensional visual signals in noisy conditions)","volume":"4","author":"schlesinger","year":"1976","journal-title":"Kibernetika"},{"key":"ref38","first-page":"1817","article-title":"A study of Nesterov’s scheme for Lagrangian decomposition and MAP labeling","author":"savchynskyy","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33885-4_31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0514-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.165"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1134\/S1054661810030089"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9969.003.0008","article-title":"Getting feasible variable estimates from infeasible ones: MRF local polytope study","author":"savchynskyy","year":"2014","journal-title":"Advanced Structured Prediction"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206739"},{"journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference","year":"1988","author":"pearl","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995361"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.02.026"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0437-z"},{"key":"ref40","first-page":"1","article-title":"TextonBoost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation","author":"shotton","year":"0","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref12","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0728-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.91"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995589"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247863"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.175"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591907"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","article-title":"On the statistical analysis of dirty pictures","volume":"48","author":"besag","year":"1986","journal-title":"J Roy Statist Soc Ser B"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206846"},{"journal-title":"Convex Analysis and Optimization","year":"2003","author":"bertsekas","key":"ref3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"ref6","first-page":"351","article-title":"The tradeoffs of large scale learning","author":"bousquet","year":"2012","journal-title":"Optimization for Machine Learning"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.108"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539951"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/34.1000236"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.194"},{"key":"ref46","article-title":"Tightening MRF relaxations with planar subproblems","author":"yarkony","year":"0","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585268"},{"key":"ref45","article-title":"Planar cycle covering graphs","author":"yarkony","year":"0","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.217"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247860"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1128"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.257"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539886"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-008-0202-0"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459434"},{"key":"ref26","article-title":"On the optimality of tree-reweighted max-product message passing","author":"kolmogorov","year":"0","journal-title":"Proc 21st Conf Uncertainty Artif Intell"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7116666\/06951467.pdf?arnumber=6951467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T22:15:56Z","timestamp":1717539356000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6951467\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":47,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2014.2369046","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}