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

DOI10.1016/J.ACHA.2012.11.001zbMATH Open1336.94014arXiv1111.2848OpenAlexW1871883227MaRDI QIDQ2252162FDOQ2252162

Authors: Alexis Benichoux, Prasad Sudhakar, Frédéric Bimbot, Rémi Gribonval 

Publication date: 16 July 2014

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1111.2848

Recommendations

• Solving the Permutation Problem in Convolutive Blind Source Separation
• scientific article; zbMATH DE number 1820153
• Advances in Neural Networks – ISNN 2005
• Permutation correction in the frequency domain in blind separation of speech mixtures
• A novel and fast algorithm for solving permutation in convolutive BSS, based on real and imaginary decomposition

zbMATH Keywords

Hall's marriage theorembi-stochastic matrices\(\ell^p\) minimizationconvolutive blind source separationpermutation ambiguitysparse filters

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Title not available (Why is that?)
• An uncertainty principle for cyclic groups of prime order
• Uncertainty Principles and Signal Recovery
• Sparse components of images and optimal atomic decompositions
• Sparse Channel Estimation for Multicarrier Underwater Acoustic Communication: From Subspace Methods to Compressed Sensing
• On the linear independence of spikes and sines
• A generalized uncertainty principle and sparse representation in pairs of bases
• Well-posedness of the permutation problem in sparse filter estimation with \(\ell^p\) minimization

Cited In (2)

• Well-posedness of the permutation problem in sparse filter estimation with \(\ell^p\) minimization
• Advances in Neural Networks – ISNN 2005

This page was built for publication: Well-posedness of the permutation problem in sparse filter estimation with \(\ell^p\) minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252162)