Abstract
An important step of sparse representation technique for under-determined BSS (Blind Source Separation) is the estimation of the mixing matrix. In this paper, a new method to estimate the mixing matrix is proposed. The objective is to find the mixing matrix to minimize the mutual information of the estimated sources. An algorithm for the learning of the mixing matrix is proposed by the natural gradient. Simulation results of speech separation demonstrate the effectiveness of our method.
Original language | English |
---|---|
Title of host publication | Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 |
DOIs | |
Publication status | Published - 2009 |
Externally published | Yes |
Event | 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 - Wuhan, China Duration: 11 Dec 2009 → 13 Dec 2009 |
Publication series
Name | Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 |
---|
Conference
Conference | 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 |
---|---|
Country/Territory | China |
City | Wuhan |
Period | 11/12/09 → 13/12/09 |
Keywords
- Mutual information
- Sparse representation
- Under-determined blind source separation
Fingerprint
Dive into the research topics of 'Mutual information minimization for under-determined blind source separation'. Together they form a unique fingerprint.Cite this
Wang, F., & Zhang, J. (2009). Mutual information minimization for under-determined blind source separation. In Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 Article 5365757 (Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009). https://doi.org/10.1109/CISE.2009.5365757