Non-negative sparse coding
Top Cited Papers
- 25 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Non-negative sparse coding is a method for decomposing multi- variate data into non-negative sparse components. In this paper we briefly describe the motivation behind this type of data representation and its relation to standard sparse coding and non-negative matrix factorization. We then give a simple yet efficient multiplicative algorithm for finding the optimal values of the hidden components. In addition, we show how the basis vectors can be learned from the observed data. Simulations demonstrate the effectiveness of the proposed method.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Modeling receptive fields with non-negative sparse codingNeurocomputing, 2003
- A multi-layer sparse coding network learns contour coding from natural imagesVision Research, 2002
- Learning the parts of objects by non-negative matrix factorizationNature, 1999
- Emergence of simple-cell receptive field properties by learning a sparse code for natural imagesNature, 1996
- Development of low entropy coding in a recurrent networkNetwork: Computation in Neural Systems, 1996
- Positive matrix factorization: A non‐negative factor model with optimal utilization of error estimates of data valuesEnvironmetrics, 1994