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 Mstep. The solution obtained by the proposed algorithm is compared to the minimum ℓ1-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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Zayyani, H., Babaie-Zadeh, M., Mohimani, G. H., & Jutten, C. (2007). Sparse component analysis in presence of noise using an iterative EM-MAP algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 438–445). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_55
Mendeley helps you to discover research relevant for your work.