{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T07:23:48Z","timestamp":1790321028249,"version":"4.1.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1109\/iccv.2007.4408970","type":"proceedings-article","created":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T15:34:53Z","timestamp":1199460893000},"page":"1-8","source":"Crossref","is-referenced-by-count":7,"title":["Capacity Scaling for Graph Cuts in Vision"],"prefix":"10.1109","author":[{"given":"Olivier","family":"Juan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuri","family":"Boykov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.47"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408970"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.81"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.252"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1109\/TPAMI.2007.1031","article-title":"Minimizing non-submodular functions with graph cuts - a review","author":"kolmogorov","year":"2007","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015720"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.238"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.5244\/C.20.117"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"ref6","article-title":"Metod porazryadnogo sokrashcheniya nevyazoki transportnye zadachi","author":"dinic","year":"1973","journal-title":"Issledovaniya po Diskretnoi Maternatike Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"ref8","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238310"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-7934-5"},{"key":"ref9","article-title":"The pseudoflow algorithm: A new algorithm for the maximum flow problem","author":"hochbaum","year":"2004","journal-title":"Long version of same titled paper"}],"event":{"name":"2007 IEEE 11th International Conference on Computer Vision","location":"Rio de Janeiro, Brazil","start":{"date-parts":[[2007,10,14]]},"end":{"date-parts":[[2007,10,21]]}},"container-title":["2007 IEEE 11th International Conference on Computer Vision"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4408818\/4408819\/04408970.pdf?arnumber=4408970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:14:03Z","timestamp":1781280843000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4408970\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iccv.2007.4408970","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}