{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T04:47:56Z","timestamp":1762145276909,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61333015","61421004","61473292"],"award-info":[{"award-number":["61333015","61421004","61473292"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1109\/tip.2017.2704431","type":"journal-article","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T18:32:40Z","timestamp":1494959560000},"page":"3775-3788","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Graph Cuts in Parallel"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8406-9854","authenticated-orcid":false,"given":"Miao","family":"Yu","sequence":"first","affiliation":[]},{"given":"Shuhan","family":"Shen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7067-4498","authenticated-orcid":false,"given":"Zhanyi","family":"Hu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1031"},{"journal-title":"Max-flow min-cut theorem - Wikipedia the Free Encyclopedia","year":"2017","key":"ref38"},{"key":"ref33","article-title":"Convex optimization for parallel energy minimization","author":"kumar","year":"2015","journal-title":"CoRR"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2609819"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0571-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2011.06.012"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.47"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.81"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.82"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937505"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/S0262-8856(02)00047-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015720"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1128"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-014-5277-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937668"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.268"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.193"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"ref18","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"dinic","year":"1970","journal-title":"Sov Math Dokl"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"ref28","first-page":"2181","article-title":"Parallel graph-cuts by adaptive bottom-up merging","author":"liu","year":"2010","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383203"},{"journal-title":"GPU Computing Gems Emerald Edition","year":"2011","author":"wen-mei","key":"ref27"},{"article-title":"Preprocessing of unconstrained quadratic binary optimization","year":"2006","author":"boros","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539886"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-008-0202-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.131"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.165"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","article-title":"Exact maximum a posteriori estimation for binary images","volume":"51","author":"greig","year":"1989","journal-title":"J Roy Statist Soc Series B (Methodol )"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0524"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59408-6_49"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.161"},{"key":"ref24","first-page":"41","article-title":"A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic","author":"bader","year":"2005","journal-title":"Proc of ISCA PDCS"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-7934-5"},{"key":"ref23","first-page":"1","article-title":"A scalable graph-cut algorithm for N-D grids","author":"delong","year":"2008","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1103"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/7935144\/07929396.pdf?arnumber=7929396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T04:51:45Z","timestamp":1719204705000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7929396\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":42,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tip.2017.2704431","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"type":"print","value":"1057-7149"},{"type":"electronic","value":"1941-0042"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}