Sparsity and Adaptivity for the Blind Separation of Partially Correlated Sources

DOI10.1109/TSP.2015.2391071MaRDI QIDQ4579771zbMATH OpenOpenAlexFDO

Authors Jérôme Bobin, Jérémy Rapin, Anthony Larue, J.-L. Starck

Publication date 22 August 2018

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

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

Mathematics Subject Classification ID

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

Abstract: Blind source separation (BSS) is a very popular technique to analyze multichannel data. In this context, the data are modeled as the linear combination of sources to be retrieved. For that purpose, standard BSS methods all rely on some discrimination principle, whether it is statistical independence or morphological diversity, to distinguish between the sources. However, dealing with real-world data reveals that such assumptions are rarely valid in practice: the signals of interest are more likely partially correlated, which generally hampers the performances of standard BSS methods. In this article, we introduce a novel sparsity-enforcing BSS method coined Adaptive Morphological Component Analysis (AMCA), which is designed to retrieve sparse and partially correlated sources. More precisely, it makes profit of an adaptive re-weighting scheme to favor/penalize samples based on their level of correlation. Extensive numerical experiments have been carried out which show that the proposed method is robust to the partial correlation of sources while standard BSS techniques fail. The AMCA algorithm is evaluated in the field of astrophysics for the separation of physical components from microwave data.

Recommendations

• Independent Component Analysis and Blind Signal Separation
• Adaptive blind separation of underdetermined mixtures based on sparse component analysis
• Underdetermined blind source separation using sparse representations
• Blind source separation by sparse decomposition in a signal dictionary
• Two Improved Sparse Decomposition Methods for Blind Source Separation
• Underdetermined blind source separation based on sparse representation
• scientific article; zbMATH DE number 2247799

Cited in

(8)

• Blind source separation with outliers in transformed domains
• On Optimal Selection of Correlation Matrices for Matrix-Pencil-Based Separation
• Joint multichannel deconvolution and blind source separation
• Sparse Blind Source Separation via ℓ1-Norm Optimization
• Blind source separation of positive and partially correlated data
• Provably robust blind source separation of linear-quadratic near-separable mixtures
• A WHT signal detection-based FLO-TF-UBSS algorithm under impulsive noise environment
• Blind source separation based on mixed integer programming

This page was built for publication: Sparsity and Adaptivity for the Blind Separation of Partially Correlated Sources

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