By Topic

Robust principal component analysis?: Recovering low-rank matrices from sparse errors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Emmanuel Candés ; Department of Mathematics, Stanford University ; Xiaodong Li ; Yi Ma ; John Wright

The problem of recovering a low-rank data matrix from corrupted observations arises in many application areas, including computer vision, system identification, and bioinformatics. Recently it was shown that low-rank matrices satisfying an appropriate incoherence condition can be exactly recovered from non-vanishing fractions of errors by solving a simple convex program, Principal Component Pursuit, which minimizes a weighted combination of the nuclear norm and the ℓ1 norm of the corruption. Our methodology and results suggest a principled approach to robust principal component analysis, since they show that one can efficiently and exactly recover the principal components of a low-rank data matrix even when a positive fraction of the entries are corrupted. These results extend to the case where a fraction of entries are missing as well.

Published in:

Sensor Array and Multichannel Signal Processing Workshop (SAM), 2010 IEEE

Date of Conference:

4-7 Oct. 2010