19 search results - page 1 / 4 » Two Improved Sparse Decomposition Methods for Blind Source S... |
ICA
2007
Springer
13 years 10 months ago
2007
Springer
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
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...
ICASSP
2009
IEEE
13 years 2 months ago
2009
IEEE
In this paper, we propose a novel sparse source separation method that can be applied even if the number of sources is unknown. Recently, many sparse source separation approaches ...
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...
NIPS
2003
13 years 5 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 ...