129 search results - page 2 / 26 » Blind Separation of Instantaneous Mixtures of Dependent Sour... |
TSP
2011
12 years 11 months ago
2011
—In this paper, a novel algorithm to blindly separate an instantaneous linear underdetermined mixture of nonstationary sources is proposed. It means that the number of sources ex...
ICA
2007
Springer
13 years 11 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
1998
13 years 4 months ago
1998
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
We propose a novel blind source separation algorithm called Block AutoRegressive Blind Identification (BARBI). The algorithm is asymptotically efficient in separation of instant...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this paper, we present a new algorithm for solving the permutation ambiguity in convolutive blind source separation. A common approach for separation of convolutive mixtures is...