Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2002
Springer

favoriteEmaildiscussreport

180views Education» more CORR 2002»

Non-negative sparse coding

13 years 4 months ago

Non-negative sparse coding

Download www.cs.helsinki.fi

Abstract. Non-negative sparse coding is a method for decomposing multivariate 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.

Patrik O. Hoyer

Real-time Traffic

CORR 2002 | Education | Non-Negative Matrix Factorization | Non-negative Sparse | Non-negative Sparse Components |

claim paper

Related Content

» Learning NonNegative Sparse Image Codes by Convex Programming

» Sparse Image Coding Using a 3D NonNegative Tensor Factorization

» Nonnegative matrix factorization with sparseness constraints

» Face hallucination VIA sparse coding

» Learning Sparse Representations by NonNegative Matrix Factorization and Sequential Cone Pr...

» Controlling Sparseness in Nonnegative Tensor Factorization

» Online Learning for Matrix Factorization and Sparse Coding

» When Does NonNegative Matrix Factorization Give a Correct Decomposition into Parts

» Nonnegative tensor factorization with applications to statistics and computer vision

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	CORR
Authors	Patrik O. Hoyer

Comments (0)