7 search results - page 1 / 2 » Robust Matrix Completion with Corrupted Columns |
101
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
105
click to vote
ACCV
2010
Springer
14 years 4 months ago
2010
Springer
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...
115
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
107
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...