Hybridizing Sparse Component Analysis with Genetic Algorithms for Blind Source Separation
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.
Unable to display preview. Download preview PDF.
- 1.Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 40, 788–791 (1999)Google Scholar
- 4.Chipperfield, A., Fleming, P., Pohlheim, H., Fonseca, C.: Genetic Algorithm Toolbox, Evolutionary Computation Research Group, University fo Sheffield, www.shef.ac.uk/acse/research/ecrg/