Abstract
In this paper we present a method for estimating the bin-wise separation performance in convolutive blind source separation. A common way to separate convolutive mixtures is the transformation to the time-frequency domain and the separation of the single bins using an instantaneous ICA algorithm. This approach reduces the complexity but leads to the so-called permutation problem which has been widely studied. Another problem arises when the single bins are only poorly separable or even not separable at all. These bins can significantly reduce the overall performance. In this paper we propose a method for detecting such bins based on properties of the unmixing matrices.
| Originalsprache | Englisch |
|---|---|
| Titel | 2008 42nd Asilomar Conference on Signals, Systems and Computers |
| Seitenumfang | 4 |
| Herausgeber (Verlag) | IEEE |
| Erscheinungsdatum | 01.10.2008 |
| Seiten | 1718-1721 |
| Aufsatznummer | 5074719 |
| ISBN (Print) | 978-1-4244-2940-0 |
| ISBN (elektronisch) | 978-1-4244-2941-7 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - 01.10.2008 |
| Veranstaltung | 2008 42nd Asilomar Conference on Signals, Systems and Computers - Pacific Grove, USA / Vereinigte Staaten Dauer: 26.10.2008 → 29.10.2008 Konferenznummer: 77519 |
UN SDGs
Dieser Output leistet einen Beitrag zu folgendem(n) Ziel(en) für nachhaltige Entwicklung
