{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:01:10Z","timestamp":1740132070491,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100015539","name":"Australian Government","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015539","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":[[2019,4,1]]},"DOI":"10.1109\/tpami.2018.2819675","type":"journal-article","created":{"date-parts":[[2018,3,26]],"date-time":"2018-03-26T18:05:45Z","timestamp":1522087545000},"page":"886-900","source":"Crossref","is-referenced-by-count":2,"title":["Memory Efficient Max Flow for Multi-Label Submodular MRFs"],"prefix":"10.1109","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6431-0775","authenticated-orcid":false,"given":"Thalaiyasingam","family":"Ajanthan","sequence":"first","affiliation":[{"name":"ANU and Data61-CSIRO, Canberra, ACT, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5005-0191","authenticated-orcid":false,"given":"Richard","family":"Hartley","sequence":"additional","affiliation":[{"name":"ANU and Data61-CSIRO, Canberra, ACT, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8347-8637","authenticated-orcid":false,"given":"Mathieu","family":"Salzmann","sequence":"additional","affiliation":[{"name":"CVLab, EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2003.1211354"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014573219977"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0571-2"},{"article-title":"OpenGM: A C++ library for discrete graphical models","year":"2012","author":"andres","key":"ref37"},{"key":"ref36","first-page":"619","article-title":"Faster and more dynamic maximum flow by incremental breadth-first search","author":"goldberg","year":"2015","journal-title":"Proc Eur Symp Algorithms"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/34.677269"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913491297"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539886"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.108"},{"key":"ref13","first-page":"746","article-title":"Efficient MRF energy minimization via adaptive diminishing smoothing","author":"savchynskyy","year":"2012","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.632"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70844"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0809-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"ref19","volume":"6","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587464"},{"journal-title":"Flows in Networks","year":"1962","author":"ford","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.5244\/C.26.61"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.175"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0491-6"},{"key":"ref29","first-page":"3673","article-title":"Cache-efficient graph cuts on structured grids","author":"jamri\u0161ka","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref5","first-page":"889","article-title":"Improved moves for truncated convex models","author":"torr","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299150"},{"journal-title":"Transforming an Arbitrary Minsum Problem into a Binary One","year":"2006","author":"schlesinger","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.81"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref21","first-page":"671","article-title":"Graph cuts is a max-product algorithm","author":"tarlow","year":"2011","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref23","first-page":"316","article-title":"On the optimality of tree-reweighted max-product message-passing","author":"kolmogorov","year":"2005","journal-title":"Proc 21st Conf Uncertainty Artif Intell"},{"key":"ref26","first-page":"457","article-title":"Maximum flows by incremental breadth-first search","author":"goldberg","year":"2011","journal-title":"Proc Eur Symp Algorithms"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0572"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/8660600\/08325531.pdf?arnumber=8325531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,16]],"date-time":"2024-01-16T18:20:08Z","timestamp":1705429208000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8325531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,1]]},"references-count":38,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2018.2819675","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2019,4,1]]}}}