Skip to Main content Skip to Navigation

Well-posedness of the permutation problem in sparse filter estimation with lp minimization

Alexis Benichoux 1 Prasad Sudhakar 1 Frédéric Bimbot 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 : Convolutive source separation is often done in two stages: 1) estimation of the mixing filters and 2) estimation of the sources. Traditional approaches suffer from the ambiguities of arbitrary permutations and scaling in each frequency bin of the estimated filters and/or the sources, and they are usually corrected by taking into account some special properties of the filters/sources. This paper focusses on the filter permutation problem in the absence of scaling, investigating the possible use of the temporal sparsity of the filters as a property enabling permutation correction. Theoretical and experimental results highlight the potential as well as the limits of sparsity as an hypothesis to obtain a well-posed permutation problem.
Complete list of metadata
Contributor : Rémi Gribonval Connect in order to contact the contributor
Submitted on : Thursday, November 10, 2011 - 8:27:45 PM
Last modification on : Friday, February 4, 2022 - 3:25:02 AM
Long-term archiving on: : Saturday, February 11, 2012 - 2:27:07 AM


Files produced by the author(s)


  • HAL Id : hal-00640198, version 1
  • ARXIV : 1111.2848


Alexis Benichoux, Prasad Sudhakar, Frédéric Bimbot, Rémi Gribonval. Well-posedness of the permutation problem in sparse filter estimation with lp minimization. [Research Report] RR-7782, INRIA. 2011, pp.20. ⟨hal-00640198⟩



Record views


Files downloads