Underdetermined Anechoic Blind Source Separation via \ell^{q}-Basis-Pursuit With q≪1

DOI10.1109/TSP.2007.895998zbMATH Open1390.94388DBLPjournals/tsp/SaabYMA07OpenAlexW2132483362WikidataQ60767365 ScholiaQ60767365MaRDI QIDQ4567359FDOQ4567359

Authors: Rayan Saab, Özgür Yılmaz, Martin J. McKeown, Rafeef Abugharbieh 

Publication date: 27 June 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2007.895998

Recommendations

• Underdetermined blind source separation based on sparse representation
• Underdetermined Blind Source Separation Based on Relaxed Sparsity Condition of Sources
• Provably robust blind source separation of linear-quadratic near-separable mixtures
• Underdetermined blind source separation using sparse representations
• Underdetermined Blind Separation of Nondisjoint Sources in the Time-Frequency Domain
• Source number estimation and separation algorithms of underdetermined blind separation
• An unconstrained underdetermined blind source separation algorithm based on the source number estimation
• Sparse Blind Source Separation via ℓ1-Norm Optimization

Mathematics Subject Classification ID

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

Cited In (3)

• Phase aliasing correction for robust blind source separation using DUET
• An algorithm for mixing matrix estimation in instantaneous blind source separation
• An improved underdetermined blind source separation method for insufficiently sparse sources

This page was built for publication: Underdetermined Anechoic Blind Source Separation via $\ell^{q}$-Basis-Pursuit With $q≪1$

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