Sciweavers

145 search results - page 3 / 29
» On Constrained Sparse Matrix Factorization
Sort
View
JMLR
2010
195views more  JMLR 2010»
13 years 3 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 5 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
ICASSP
2011
IEEE
12 years 9 months ago
Gain-robust multi-pitch tracking using sparse nonnegative matrix factorization
While nonnegative matrix factorization (NMF) has successfully been applied for gain-robust multi-pitch detection, a method to track pitch values over time was not provided. We emb...
Robert Peharz, Michael Wohlmayr, Franz Pernkopf
JMLR
2006
175views more  JMLR 2006»
13 years 5 months ago
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
Matthias Heiler, Christoph Schnörr
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 5 months ago
Convex Sparse Matrix Factorizations
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
Francis Bach, Julien Mairal, Jean Ponce