171 search results - page 25 / 35 » Convex Sparse Matrix Factorizations |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
110
click to vote
PAMI
2012
13 years 4 days ago
2012
—Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal proce...
131
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...
104
click to vote
JACM
2011
14 years 18 days 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...
110
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...