Sciweavers

534 search results - page 1 / 107
» Data Separation by Sparse Representations
Sort
View
NIPS
2003
13 years 5 months ago
Sparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
Yuanqing Li, Andrzej Cichocki, Shun-ichi Amari, Se...
ICIP
2009
IEEE
14 years 5 months ago
Sparsity And Morphological Diversity For Hyperspectral Data Analysis
Recently morphological diversity and sparsity have emerged as new and effective sources of diversity for Blind Source Separation. Based on these new concepts, novel methods such a...
ISNN
2007
Springer
13 years 10 months ago
Regularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...
Andrzej Cichocki, Rafal Zdunek
ICONIP
2007
13 years 5 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...