{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:05:32Z","timestamp":1730214332267,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/dicta.2013.6691506","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T14:05:54Z","timestamp":1388757954000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Object Cut as Minimum Ratio Cycle in a Superpixel Boundary Graph"],"prefix":"10.1109","author":[{"given":"Gao","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yansheng","family":"Ming","sequence":"additional","affiliation":[]},{"given":"Hongdong","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Efficient additive kernels via explicit feature maps","volume":"34","author":"vedaldi","year":"2011","journal-title":"Pattern Analysis and Machine Intelligence"},{"journal-title":"Green's Theorem","year":"0","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0109-1"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206805"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1186"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540095"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206567"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408973"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.363"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.112"},{"key":"11","article-title":"Optimal contour closure by superpixel grouping","author":"levinshtein","year":"2010","journal-title":"ECCV"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1201819"},{"key":"3","first-page":"105","volume":"1","author":"boykov","year":"2001","journal-title":"Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995545"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2007.09.014"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.161"},{"journal-title":"Combinatorial Optimization Networks and Matroids","year":"2001","author":"lawler","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/34.954599"},{"key":"6","first-page":"167","author":"gu","year":"2012","journal-title":"Twisted Window Search for Efficient Shape Localization"},{"journal-title":"The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results","year":"0","author":"everingham","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.13.7.492"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587586"},{"key":"8","first-page":"109","article-title":"Efficient inference in fully connected crfs with Gaussian edge potentials","volume":"24","author":"kra?henbu?hl","year":"2011","journal-title":"Advances in neural information processing systems"}],"event":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","start":{"date-parts":[[2013,11,26]]},"location":"Hobart, Australia","end":{"date-parts":[[2013,11,28]]}},"container-title":["2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6689677\/6691460\/06691506.pdf?arnumber=6691506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T13:56:23Z","timestamp":1490190983000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6691506\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/dicta.2013.6691506","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}