Abstract
Nonnegative Matrix Factorization (NMF) has proven to be a useful tool for the analysis of nonnegative multivariate data. However, it is known not to lead to unique results when applied to nonnegative Blind Source Separation (BSS) problems. In this paper we present first results of an extension to the NMF algorithm which solves the BSS problem when the underlying sources are sufficiently sparse. As the proposed target function has many local minima, we use a genetic algorithm for its minimization. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Stadlthanner, K., Theis, F. J., Puntonet, C. G., Górriz, J. M., Tomé, A. M., & Lang, E. W. (2005). Hybridizing sparse component analysis with genetic algorithms for blind source separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3745 LNBI, pp. 137–148). https://doi.org/10.1007/11573067_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
