Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/108963
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJi, P.en
dc.contributor.authorSalzamnn, M.en
dc.contributor.authorLi, H.en
dc.date.issued2014en
dc.identifier.citationProceedings of the 2014 IEEE Winter Conference on Applications of Computer Vision, 2014 / pp.461-468en
dc.identifier.isbn9781479949854en
dc.identifier.issn1550-5790en
dc.identifier.urihttp://hdl.handle.net/2440/108963-
dc.description.abstractIn this paper, we tackle the problem of clustering data points drawn from a union of linear (or affine) subspaces. To this end, we introduce an efficient subspace clustering algorithm that estimates dense connections between the points lying in the same subspace. In particular, instead of following the standard compressive sensing approach, we formulate subspace clustering as a Frobenius norm minimization problem, which inherently yields denser con- nections between the data points. While in the noise-free case we rely on the self-expressiveness of the observations, in the presence of noise we simultaneously learn a clean dictionary to represent the data. Our formulation lets us address the subspace clustering problem efficiently. More specifically, the solution can be obtained in closed-form for outlier-free observations, and by performing a series of linear operations in the presence of outliers. Interestingly, we show that our Frobenius norm formulation shares the same solution as the popular nuclear norm minimization approach when the data is free of any noise, or, in the case of corrupted data, when a clean dictionary is learned. Our experimental evaluation on motion segmentation and face clustering demonstrates the benefits of our algorithm in terms of clustering accuracy and efficiency.en
dc.description.statementofresponsibilityPan Ji, Mathieu Salzmann, Hongdong Lien
dc.language.isoenen
dc.publisherIEEEen
dc.rightsCopyright © 2014, IEEEen
dc.subjectNoise, dictionaries, clustering algorithmsen
dc.titleEfficient dense subspace clusteringen
dc.typeConference paperen
dc.identifier.rmid0030071725en
dc.contributor.conference2014 IEEE Winter Conference on Applications of Computer Vision (WACV 2014) (24 Mar 2014 - 26 Mar 2014 : Steamboat Springs, CO, USA)en
dc.identifier.doi10.1109/WACV.2014.6836065en
dc.identifier.pubid356766-
pubs.library.collectionComputer Science publicationsen
pubs.library.teamDS06en
pubs.verification-statusVerifieden
pubs.publication-statusPublisheden
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_108963.pdfRestricted Access859.13 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.