Greedy Algorithm for Subspace Clustering from Corrupted and Incomplete Data

Add to your list(s) Download to your calendar using vCal

• Alexander Petukhov (University of Georgia, USA)
• Wednesday 09 September 2015, 15:00-16:00
• MR 14, CMS.

If you have a question about this talk, please contact A.Shadrin.

We describe the Fast Greedy Sparse Subspace Clustering (FGSSC) algorithm providing an efficient method for clustering data belonging to a few low-dimensional linear or affine subspaces. The main difference of our algorithm from predecessors is its ability to work with noisy data having a high rate of erasures (missed entries at the known locations) and errors (corrupted entries at unknown locations).

The algorithm has significant advantage over predecessor on synthetic models as well as for the Extended Yale B dataset of facial images. In particular, the face recognition misclassification rate turned out to be 6—20 times lower than for the SSC algorithm.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• Applied and Computational Analysis
• CMS Events
• DAMTP info aggregator
• Featured lists
• Interested Talks
• MR 14, CMS
• My seminars
• Type the title of a new list here
• bld31

Note that ex-directory lists are not shown.