A sparsity-based method to solve the permutation indeterminacy in frequency domain convolutive blind source separation

Prasad Sudhakar 1 Rémi Gribonval 1
1 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Existing methods for frequency-domain estimation of mixing filters in convolutive blind source separation (BSS) suffer from permutation and scaling indeterminacies in sub-bands. However, if the filters are assumed to be sparse in the time domain, it is shown in this paper that the l1-norm of the filter matrix increases as the sub-band coefficients are permuted. With this motivation, an algorithm is then presented which solves the source permutation indeterminacy, provided there is no scaling indeterminacy in sub-bands. The robustness of the algorithm to noise is also presented.
Type de document :
Communication dans un congrès
ICA 2009, 8th International Conference on Independent Component Analysis and Signal Separation, Mar 2009, Paraty, Brazil. 2009, LNCS. 〈10.1007/978-3-642-00599-2_43〉
Liste complète des métadonnées

Littérature citée [5 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00544760
Contributeur : Rémi Gribonval <>
Soumis le : dimanche 6 février 2011 - 22:23:05
Dernière modification le : jeudi 11 janvier 2018 - 06:20:09
Document(s) archivé(s) le : samedi 7 mai 2011 - 02:25:37

Fichier

2009_ICA_SudhakarGribonval_BSS...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Prasad Sudhakar, Rémi Gribonval. A sparsity-based method to solve the permutation indeterminacy in frequency domain convolutive blind source separation. ICA 2009, 8th International Conference on Independent Component Analysis and Signal Separation, Mar 2009, Paraty, Brazil. 2009, LNCS. 〈10.1007/978-3-642-00599-2_43〉. 〈inria-00544760〉

Partager

Métriques

Consultations de la notice

243

Téléchargements de fichiers

127