Directional sparse filtering for blind estimation of under-determined complex-valued mixing matrices

Abstract

We propose an algorithm that exploits the benefits of sparse filtering and directional clustering when estimating under-determined mixing matrix from mixtures of sufficiently sparse sources. To express the direction of each sample by only a few vectors in which one vector is more dominant than the remaining ones, we propose to minimize the power mean of the magnitude-squared cosine distances between the estimated mixing matrix and the data. For the special case of estimating determined mixing matrix, we derive a stability condition for methods based on the magnitude-squared cosine metric. Our stability condition shows that the proposed approach, K-hyperlines, and sparse filtering can recover the invertible mixing matrix when the sources are i.i.d. super-Gaussian. Simulations using both synthetic data and recorded speech mixtures show that the proposed algorithm outperforms existing algorithms with lower computational complexity.