Lower Bounds for Sparse Coding
- 4 September 2015
- book chapter
- Published by Springer Nature
- p. 359-370
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- $K$-Dimensional Coding Schemes in Hilbert SpacesIEEE Transactions on Information Theory, 2010
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-MinimizationIEEE Transactions on Information Theory, 2010
- The restricted isometry property and its implications for compressed sensingComptes Rendus Mathématique, 2008
- A Simple Proof of the Restricted Isometry Property for Random MatricesConstructive Approximation, 2008
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve themLinear Algebra and its Applications, 2006
- Learning the parts of objects by non-negative matrix factorizationNature, 1999
- Sparse coding with an overcomplete basis set: A strategy employed by V1?Vision Research, 1997
- Emergence of simple-cell receptive field properties by learning a sparse code for natural imagesNature, 1996
- Probability in Banach Spaces1991