Recovery of Independent Sparse Sources From Linear Mixtures Using Sparse Bayesian Learning
- 15 October 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 66 (24) , 6332-6346
Abstract
Classical algorithms for the multiple measurement vector (MMV) problem assume either independent columns for the solution matrix or certain models of correlation among the columns. The correlation structure in the previous MMV formulation does not capture the signals well for some applications like photoplethysmography (PPG) signal extraction where the signals are independent and linearly mixed in a certain manner. In practice, the mixtures of these signals are observed through different channels. In order to capture this structure, we decompose the solution matrix into multiplication of a sparse matrix composed of independent components, and a linear mixing matrix. We derive a new condition that guarantees a unique solution for this linear mixing MMV problem. The condition can be much less restrictive than the conditions for the typical MMV problem in previous works. We also propose two novel sparse Bayesian learning (SBL) algorithms, independent component analysis sparse Bayesian learning, (ICASBL), and fast independent component sparse Bayesian learning, which capture the linear mixture structure. Analysis of the global and local minima of the ICASBL cost function is also provided, and similar to the typical SBL cost function it is shown that the local minima are sparse and that the global minima have maximum sparsity. Experimental results show that the proposed algorithms outperform traditional approaches and can recover the signal with fewer number of measurements in the linear mixing MMV setting.Keywords
Funding Information
- Research Council of Norway project the Medical Sensing, Localization, and Communication using Ultra Wideband Technology (MELODY) (Phase II) (225885)
This publication has 64 references indexed in Scilit:
- Utility of the Photoplethysmogram in Circulatory MonitoringAnesthesiology, 2008
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Motion Artifact Reduction in Photoplethysmography Using Independent Component AnalysisIEEE Transactions on Biomedical Engineering, 2006
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Sparse Bayesian Learning for Basis SelectionIEEE Transactions on Signal Processing, 2004
- Dual multivariate auto-regressive modeling in state space for temporal signal separationIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2003
- An affine scaling methodology for best basis selectionIEEE Transactions on Signal Processing, 1999
- Modified Herault–Jutten Algorithms for Blind Separation of SourcesDigital Signal Processing, 1997
- Robust neural networks with on-line learning for blind identification and blind separation of sourcesIEEE Transactions on Circuits and Systems I: Regular Papers, 1996
- Skin photoplethysmography — a reviewComputer Methods and Programs in Biomedicine, 1989