Skip to Main content Skip to Navigation
Conference papers

Sparse filter models for solving permutation indeterminacy in 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 : Frequency-domain methods for estimating mixing filters in convolutive blind source separation (BSS) suffer from permutation and scaling indeterminacies in sub-bands. Solving these indeterminacies are critical to such BSS systems. In this paper, we propose to use sparse filter models to tackle the permutation problem. It will be shown that the ℓ1-norm of the filter matrix increases with permutations and with this motivation, an algorithm is then presented which aims to solve the permutations in the absence of any scaling. Experimental evidence to show the behaviour of ℓ1-norm of the filter matrix to sub-band permutations is presented. Then, the performance of our proposed algorithm is presented, both in noiseless and noisy cases.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00369554
Contributor : Ist Rennes <>
Submitted on : Friday, March 20, 2009 - 11:57:50 AM
Last modification on : Tuesday, June 15, 2021 - 4:26:13 PM
Long-term archiving on: : Thursday, June 10, 2010 - 5:38:27 PM

File

59.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00369554, version 1

Citation

Prasad Sudhakar, Rémi Gribonval. Sparse filter models for solving permutation indeterminacy in convolutive blind source separation. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, France. ⟨inria-00369554⟩

Share

Metrics

Record views

343

Files downloads

294