{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:05:34Z","timestamp":1759133134534,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1109\/cvpr.2008.4587464","type":"proceedings-article","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T14:28:49Z","timestamp":1218551329000},"page":"1-8","source":"Crossref","is-referenced-by-count":63,"title":["A Scalable graph-cut algorithm for N-D grids"],"prefix":"10.1109","author":[{"given":"Andrew","family":"Delong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Boykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408997"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.13"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383203"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1031"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383293"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"11","first-page":"1277","article-title":"algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"dinitz","year":"1970","journal-title":"Soviet Math Dokl"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.238"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-7934-5"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"year":"0","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1103"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01415937"},{"year":"0","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0572"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"journal-title":"A Scalable Max-Flow\/Min-Cut Algorithm for Sparse Graphs","year":"2006","author":"delong","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009180"}],"event":{"name":"2008 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","start":{"date-parts":[[2008,6,23]]},"location":"Anchorage, AK, USA","end":{"date-parts":[[2008,6,28]]}},"container-title":["2008 IEEE Conference on Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4558014\/4587335\/04587464.pdf?arnumber=4587464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T15:03:24Z","timestamp":1489676604000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4587464\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2008.4587464","relation":{},"subject":[],"published":{"date-parts":[[2008,6]]}}}