Subband-Based Blind Separation for Convolutive Mixtures of Speech
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fast approximate joint diagonalization incorporating weight matrices
IEEE Transactions on Signal Processing
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
Experimental upper bound for the performance of convolutive source separation methods
IEEE Transactions on Signal Processing
IEEE Transactions on Audio, Speech, and Language Processing
The 2010 signal separation evaluation campaign (SiSEC2010): audio source separation
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
Hi-index | 0.00 |
Time-domain methods for blind separation of audio signals are preferred due to their lower demand for available data and the avoidance of the permutation problem. However, their computational demands increase rapidly with the length of separating filters due to the simultaneous growth of the dimension of an observation space. We propose, in this paper, a general framework that allows the time-domain methods to compute separating filters of theoretically infinite length without increasing the dimension. Based on this framework, we derive a generalized version of the time-domain method of Koldovský and Tichavský (2008). For instance, it is demonstrated that its performance might be improved by 4dB of SIR using the Laguerre filter bank.