University of Cambridge > Talks.cam > Applied and Computational Analysis > Greedy Algorithm for Subspace Clustering from Corrupted and Incomplete Data

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Greedy Algorithm for Subspace Clustering from Corrupted and Incomplete Data

Download to your calendar using vCal

  • UserAlexander Petukhov (University of Georgia, USA)
  • ClockWednesday 09 September 2015, 15:00-16:00
  • HouseMR 14, CMS.

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

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:

Note that ex-directory lists are not shown.

Other lists

Emmanuel College Cambridge Queens College, Erasmus Room Makespace, 16 Mill Lane, Cambridge CB2 1SB

Other talks

Toward high resolution structure/function analyses of sensorimotor integration in ciliated protists Theophilus Richmond’s The First Crossing: The Transition from Slavery to Indentureship in the Caribbean and the Case of the Black Slave on the Hesperus CSaP Annual Cleevely Lecture 2026 TBC Title TBC Polar Oceans Seminar Talk
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity