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

Abstract : In this paper, a new algorithm for source recovery in under-determined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented in the noisy case. The algorithm is essentially a method for obtaining sufficiently sparse solutions of under-determined systems of linear equations with additive Gaussian noise. The method is based on iterative Expectation-Maximization of a Maximum A Posteriori estimation of sources (EM-MAP) and a new steepest-descent method is introduced for the optimization in the M-step. The solution obtained by the proposed algorithm is compared to the minimum L1-norm solution achieved by Linear Programming (LP). It is experimentally shown that the proposed algorithm is about one order of magnitude faster than the interior-point LP method, while providing better accuracy.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00173379
Contributor : Christian Jutten <>
Submitted on : Wednesday, September 19, 2007 - 4:36:28 PM
Last modification on : Tuesday, July 9, 2019 - 1:21:27 AM
Long-term archiving on : Monday, June 27, 2011 - 4:55:18 PM

Files

ica2007.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00173379, version 1

Citation

Hadi Zayyani, Massoud Babaie-Zadeh, G. Hosein Mohimani, Christian Jutten. Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm. 7th International Conference, ICA 2007, Sep 2007, London, United Kingdom. pp.438-445. ⟨hal-00173379⟩

Share

Metrics

Record views

222

Files downloads

122