Well-posedness of the permutation problem in sparse filter estimation with lp minimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Applied and Computational Harmonic Analysis Year : 2013

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

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

Dates and versions

hal-00767139 , version 1 (20-12-2012)

Identifiers

Cite

Alexis Benichoux, Prasad Sudhakar, Frédéric Bimbot, Rémi Gribonval. Well-posedness of the permutation problem in sparse filter estimation with lp minimization. Applied and Computational Harmonic Analysis, 2013, 35 (3), pp.394-406. ⟨10.1016/j.acha.2012.11.001⟩. ⟨hal-00767139⟩
283 View
228 Download

Altmetric

Share

Gmail Facebook X LinkedIn More