{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:37Z","timestamp":1774946137120,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/cvpr.2011.5995567","type":"proceedings-article","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T20:42:30Z","timestamp":1314304950000},"page":"1849-1856","source":"Crossref","is-referenced-by-count":1,"title":["Exhaustive family of energies minimizable exactly by a graph cut"],"prefix":"10.1109","author":[{"given":"Guillaume","family":"Charpiat","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Exact solution of permuted submodular minsum problems","author":"schlesinger","year":"2007","journal-title":"EMMCVPR'07"},{"key":"22","article-title":"The expressive power of binary submodular functions","author":"z?ivny?","year":"2009","journal-title":"Int Symp on Mathematical Foundations of Computer Science"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383203"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"18","article-title":"A maximum-flow formulation of the n-camera stereo correspondence problem","author":"roy","year":"1998","journal-title":"ICCV"},{"key":"24","year":"0","journal-title":"Yet More Details"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408907"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587401"},{"key":"13","article-title":"What energy functions can be minimized via graph cuts?","author":"kolmogorov","year":"2002","journal-title":"ECCV"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"12","article-title":"A dichotomy theorem for conservative general-valued CSPs","author":"kolmogorov","year":"2010","journal-title":"Technical Report"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383249"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/DICTA.2009.90"},{"key":"20","article-title":"Transforming an arbitrary minsum problem into a binary one","author":"schlesinger","year":"2006","journal-title":"Technical Report"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.791245"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10331-5_98"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.143"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78275-9_20"},{"key":"5","article-title":"On the max-flow min-cut theorem of networks","author":"dantzig","year":"1956","journal-title":"Ann Math Studies"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.07.003"},{"key":"9","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","author":"greig","year":"1989","journal-title":"J R Statist Soc B"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206650"}],"event":{"name":"2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","location":"Colorado Springs, CO, USA","start":{"date-parts":[[2011,6,20]]},"end":{"date-parts":[[2011,6,25]]}},"container-title":["CVPR 2011"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5968010\/5995307\/05995567.pdf?arnumber=5995567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T09:02:54Z","timestamp":1741510974000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5995567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2011.5995567","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}