2 search results - page 1 / 1 » Robust overcomplete matrix recovery for sparse sources using... |
ESANN
2004
13 years 6 months ago
2004
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
NIPS
2003
13 years 6 months ago
2003
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...