Sciweavers

17 search results - page 2 / 4
» Sparse representation using nonnegative curds and whey
Sort
View
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
13 years 11 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
JMLR
2006
175views more  JMLR 2006»
13 years 4 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
ICONIP
2007
13 years 6 months ago
Flexible Component Analysis for Sparse, Smooth, Nonnegative Coding or Representation
In the paper, we present a new approach to multi-way Blind Source Separation (BSS) and corresponding 3D tensor factorization that has many potential applications in neuroscience an...
Andrzej Cichocki, Anh Huy Phan, Rafal Zdunek, Liqi...
IJON
2008
116views more  IJON 2008»
13 years 4 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter