Analysis of sparse representation and blind source separation
Neural Computation
Sequential blind extraction of instantaneously mixed sources
IEEE Transactions on Signal Processing
Computational Intelligence and Security
Underdetermined Blind Source Separation Using SVM
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III
First stereo audio source separation evaluation campaign: data, algorithms and results
ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation
Identification of mixing matrix in blind source separation
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Estimation of delays and attenuations for underdetermined BSS in frequency domain
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Mixing matrix estimation using discriminative clustering for blind source separation
Digital Signal Processing
Hi-index | 0.00 |
In this paper, we discussed the separation of n sources from m linear mixtures when the underlying system is underdetermined, that is, when m n. The underdetermined blind sources separation has two steps. In matrix-recovery step, we defined a characteristic of the signals as the durative-sparsity and proposed a novel approach called as a searching-and-averaging-based method in frequency domain. This approach tells us how to search some data points that are very close to the basis lines along the direction of basis vectors a j and how to use them to estimate the mixing matrix. In source-recovery step, we used Bofill and Zibulevsky's shortest-path algorithm. Finally, the separation results were obtained using their short-time Fourier transforms.