{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:56:12Z","timestamp":1762444572891,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/cvpr.2015.7298773","type":"proceedings-article","created":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T18:42:06Z","timestamp":1444934526000},"page":"1648-1656","source":"Crossref","is-referenced-by-count":21,"title":["Membership representation for detecting block-diagonal structure in low-rank or sparse subspace clustering"],"prefix":"10.1109","author":[{"given":"Minsik","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyeogjin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nojun","family":"Kwak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.200"},{"key":"ref30","article-title":"Practical low-rank matrix approximation under robust 11-norm","author":"zheng","year":"2012","journal-title":"Proc IEEE Conf Computer Vision and Pattern Recognition"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459173"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.92"},{"key":"ref13","article-title":"Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories","author":"li","year":"2004","journal-title":"IEEE Conf Computer Vision and Pattern Recognition"},{"key":"ref14","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2009","journal-title":"Technical report UILU-ENG-09–2215"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.58"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.64"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.1.30"},{"key":"ref28","article-title":"Doubly stochastic normalization for spectral clustering","author":"zass","year":"2007","journal-title":"Proc Neural Information Processing Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126528"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.27"},{"key":"ref3","first-page":"2213","article-title":"Clustering partially observed graphs via convex optimization","volume":"15","author":"chen","year":"2014","journal-title":"J Machine Learning Research"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref29","article-title":"Spectral relaxation for k-means clustering","author":"zha","year":"2002","journal-title":"Proc Neural Information Processing Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206547"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02291478"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995365"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref9","article-title":"Clustering using max-norm constrained optimization","author":"jalali","year":"2012","journal-title":"Proc Int'l Conf Machine Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref20","article-title":"Correlation clustering: maximizing agreements via semidefinite programming","author":"swamy","year":"2004","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2329453"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238361"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19318-7_2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.08.015"}],"event":{"name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","start":{"date-parts":[[2015,6,7]]},"location":"Boston, MA, USA","end":{"date-parts":[[2015,6,12]]}},"container-title":["2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7293313\/7298593\/07298773.pdf?arnumber=7298773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T17:41:58Z","timestamp":1490377318000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7298773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2015.7298773","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}