Name
Abstract | ||
|---|---|---|
Blind source separation (BSS) algorithms are often categorized as either narrowband or broadband algorithms depending on whether their respective cost functions aim at individual DFT bins or the entire broadband signal. In this contribution, we present comparable general natural gradient-based formulations of both concepts based on the TRINICON framework. As a distinctive feature, narrowband algorithms imply an internal permutation and scaling problem. We show that the common DOA estimation-based methods for aligning the permutations effectively rely on geometric a-priori knowledge, and we explain why they need to be complemented by additional repair mechanisms for robust BSS. The latter can already be viewed as approximations of the generic TRINICON broadband algorithm. As a conclusion, we propose to always use a generic broadband algorithm as a starting point for the design of new BSS algorithms. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICASSP.2006.1661437 | 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, Vols 1-13 |
Keywords | Field | DocType |
a priori knowledge,signal processing,cost function,independent component analysis,frequency,dft,blind source separation,speech processing,bss | Natural gradient,Mathematical optimization,Narrowband,Pattern recognition,Matrix algebra,Computer science,Permutation,Broadband,Artificial intelligence,Distinctive feature,Scaling,Blind signal separation | Conference |
ISSN | Citations | PageRank |
1520-6149 | 2 | 0.73 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. Kellermann | 1 | 686 | 71.03 |
| Herbert Buchner | 2 | 435 | 40.57 |
| R. Aichner | 3 | 38 | 5.64 |