{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:10:55Z","timestamp":1745986255748},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/cvpr.2011.5995356","type":"proceedings-article","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T16:42:30Z","timestamp":1314290550000},"page":"2113-2120","source":"Crossref","is-referenced-by-count":24,"title":["Foreground-background segmentation using iterated distribution matching"],"prefix":"10.1109","author":[{"given":"Viet-Quoc","family":"Pham","sequence":"first","affiliation":[]},{"given":"Keita","family":"Takahashi","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Naemura","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206652"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459261"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459262"},{"key":"16","first-page":"628","article-title":"Background cut","author":"sun","year":"2006","journal-title":"Proc ECCV"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.908073"},{"key":"14","first-page":"556","article-title":"Algorithms for nonnegative matrix factorization","author":"lee","year":"2002","journal-title":"Proc NIPS"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.821445"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.31"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015719"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1576246.1531375"},{"key":"1","first-page":"105","article-title":"Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images","author":"boykov","year":"2001","journal-title":"Proc ICCV"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.91"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015720"},{"key":"5","first-page":"3288","article-title":"Graph cut segmentation with a global constraint: Recovering region distribution via a bound of the bhattacharyya measure","author":"ayed","year":"2010","journal-title":"Proc CVPR"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540079"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459287"}],"event":{"name":"2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","start":{"date-parts":[[2011,6,20]]},"location":"Colorado Springs, CO, USA","end":{"date-parts":[[2011,6,25]]}},"container-title":["CVPR 2011"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5968010\/5995307\/05995356.pdf?arnumber=5995356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T07:00:35Z","timestamp":1490079635000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5995356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2011.5995356","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}