32 search results - page 1 / 7 » Postnonlinear Overcomplete Blind Source Separation Using Spa... |
ICA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
NIPS
2003
13 years 6 months ago
2003
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 ...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
We propose a new approach to underdetermined Blind Source Separation (BSS) using sparse decomposition over monochannel dictionary atoms and compare it to multichannel dictionary a...
IJON
2002
13 years 4 months ago
2002
It was discovered recently that sparse decomposition by signal dictionaries results in dramatic improvement of the qualities of blind source separation. We exploit sparse decompos...
ISNN
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper proposes a novel algorithm based on informax for postnonlinear blind source separation. The demixing system culminates to a neural network with sandwiched stru...