Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm

DOI10.1007/978-3-540-74494-8_55zbMATH Open1173.94391arXiv1008.3618OpenAlexW1528912019MaRDI QIDQ3608588FDOQ3608588

Authors: Hadi Zayyani, Massoud Babaie-Zadeh, G. Hosein Mohimani, C. Jutten 

Publication date: 5 March 2009

Published in: Independent Component Analysis and Signal Separation (Search for Journal in Brave)

Abstract: In this paper, we propose a Bayesian Hypothesis Testing Algorithm (BHTA) for sparse representation. It uses the Bayesian framework to determine active atoms in sparse representation of a signal. The Bayesian hypothesis testing based on three assumptions, determines the active atoms from the correlations and leads to the activity measure as proposed in Iterative Detection Estimation (IDE) algorithm. In fact, IDE uses an arbitrary decreasing sequence of thresholds while the proposed algorithm is based on a sequence which derived from hypothesis testing. So, Bayesian hypothesis testing framework leads to an improved version of the IDE algorithm. The simulations show that Hard-version of our suggested algorithm achieves one of the best results in terms of estimation accuracy among the algorithms which have been implemented in our simulations, while it has the greatest complexity in terms of simulation time.

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

Recommendations

• Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP
• Fast Sparse Representation Based on Smoothed ℓ0 Norm
• Robust sparse component analysis based on a generalized Hough transform
• Adaptive blind separation of underdetermined mixtures based on sparse component analysis
• Sparse deconvolution using adaptive mixed-Gaussian models

zbMATH Keywords

independent component analysisblind source separationsparse component analysissparse decomposition

Mathematics Subject Classification ID

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

Cites Work

• Atomic Decomposition by Basis Pursuit
• Matching pursuits with time-frequency dictionaries
• Stable recovery of sparse overcomplete representations in the presence of noise
• Title not available (Why is that?)
• Fast Sparse Representation Based on Smoothed ℓ0 Norm
• Blind source separation by sparse decomposition in a signal dictionary
• Underdetermined blind source separation based on sparse representation
• Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
• Independent Component Analysis and Blind Signal Separation

Cited In (5)

• Underdetermined blind separation of non-disjoint signals in time-frequency domain based on matrix diagonalization
• Robust sparse component analysis based on a generalized Hough transform
• Fast Sparse Representation Based on Smoothed ℓ0 Norm
• An Iterative Bayesian Algorithm for Sparse Component Analysis in Presence of Noise
• Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm

This page was built for publication: Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm

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