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 ℓ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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Zibulevsky, M., Pearlmutter, B.A.: Blind source separation by sparse decomposition in a signal dictionary. Neural Computation 13(4), 863–882 (2001)
Gribonval, R., Lesage, S.: A survey of sparse component analysis for blind source separation: principles, perspectives, and new challanges. In: Proceeding of ESANN 2006, pp. 323–330 (2006)
Davies, M., Mitianoudis, N.: Simple mixture model for sparse overcomplete ICA. In: Puntonet, C.G., Prieto, A.G. (eds.) ICA 2004. LNCS, vol. 3195, pp. 35–43. Springer, Heidelberg (2004)
Li, Y.Q., Amari, S., Cichocki, A., Ho, D.W.C, Xie, S.: Underdetermined blind source separation based on sparse representation. IEEE Transaction on Signal Processing 54(2), 423–437 (2006)
Zayyani, H., Babaie-Zadeh, M., Jutten, C.: Source estimation in noisy sparse component analysis. In: DSP 2007 (accepted, 2007)
Balan, R., Rosca, J.: Source separation using sparse discrete prior models. In: Proceeding of ICASSP 2006 (2006)
Donoho, D.L.: For most large underdetermined systems of linear equations the minimal ℓ1 norm is also the sparsest solution. Technical Report (2004)
Donoho, D.L., Elad, M., Temlyakov, V.: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transaction on Information theory 52(1), 6–18 (2006)
Mohimani, G.H, Babaie-Zadeh, M., Jutten, C.: Fast sparse representation based on smoothed ℓ0 norm. In: ICA 2007 (accepted, 2007)
Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing 20(1), 31–61 (1999)
Mallat, S., Zhang, Z.: Matching pursuit with time-frequency dictionaries. IEEE Transaction on Signal Processing 41(12), 3397–3415 (1993)
Djafari, A.M.: Bayesian source separation: beyond PCA and ICA. In: Proceeding of ESANN 2006 (2006)
Anderson, B.D., Moor, J.B.: Optimal filtering, 2nd edn. Prentice Hall, Englewood Cliffs (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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: Davies, M.E., James, C.J., Abdallah, S.A., Plumbley, M.D. (eds) Independent Component Analysis and Signal Separation. ICA 2007. Lecture Notes in Computer Science, vol 4666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74494-8_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-74494-8_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74493-1
Online ISBN: 978-3-540-74494-8
eBook Packages: Computer ScienceComputer Science (R0)