Two Improved Sparse Decomposition Methods for Blind Source Separation

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 decomposition algorithms for the separation of linear instantaneous speech mixtures. We also show how a properly chosen dictionary can improve the performance of such algorithms by improving the sparsity of the underlying sources. The first algorithm proposes the use of a single channel Bounded Error Subset Selection (BESS) method for robustly estimating the mixing matrix. The second algorithm is a decomposition method that performs a constrained decomposition of the mixtures over a stereo dictionary.

• Type: Conference
• Year: 2007
• Where: ICA
• Authors: B. Vikrham Gowreesunker, Ahmed H. Tewfik
• Keywords: Decomposition, ICA 2007, Instantaneous Speech Mixtures, Signal Processing, Sparse Decomposition Algorithms