A sparsity-based method to solve the permutation indeterminacy in frequency domain convolutive blind source separation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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

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.
Fichier principal
Vignette du fichier
2009_ICA_SudhakarGribonval_BSSPermutationL1.pdf (239.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00544760 , version 1 (06-02-2011)

Identifiers

Cite

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. ⟨10.1007/978-3-642-00599-2_43⟩. ⟨inria-00544760⟩
136 View
176 Download

Altmetric

Share

Gmail Facebook X LinkedIn More