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...
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...
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...
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...
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...
Chunhou Zheng, Deshuang Huang, Zhan-Li Sun, Li Sha...