{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:49:15Z","timestamp":1761947355328,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cvpr.2006.47","type":"proceedings-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T15:59:56Z","timestamp":1152547196000},"page":"1023-1029","source":"Crossref","is-referenced-by-count":63,"title":["Active Graph Cuts"],"prefix":"10.1109","volume":"1","author":[{"given":"O.","family":"Juan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Boykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2006.11.004"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015720"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.81"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.13"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937505"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-7934-5"},{"key":"10","first-page":"434","article-title":"Determinimg the max-flow in a network by the method of preflows","volume":"15","author":"karzanov","year":"1974","journal-title":"Soviet Math Dokl"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"journal-title":"Flows in Networks","year":"1962","author":"ford","key":"6"},{"key":"5","first-page":"1277","article-title":"Algorithm for solution of a problem of max. Flow in networks with power estimation","volume":"11","author":"dinic","year":"1970","journal-title":"Soviet Math Dokl"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-69346-7_25","article-title":"The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem","volume":"1412","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"The Pseudoflow Algorithm for the Maximum Flow Problem","year":"0","author":"hochbaum","key":"8"}],"event":{"name":"2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06)","location":"New York, NY, USA"},"container-title":["2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06)"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx5\/10924\/34373\/01640863.pdf?arnumber=1640863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T03:23:15Z","timestamp":1497669795000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/1640863\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/cvpr.2006.47","relation":{},"subject":[]}}