4 search results - page 1 / 1 » Quantitative Robust Uncertainty Principles and Optimally Spa... |
64
Voted
FOCM
2006
14 years 10 months ago
2006
117
click to vote
SIAMJO
2011
14 years 1 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
107
click to vote
JACM
2011
14 years 1 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
132
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...