New Algorithms for Non-Negative Matrix Factorization in Applications to Blind Source Separation


In this paper we develop several algorithms for non-negative matrix factorization (NMF) in applications to blind (or semi blind) source separation (BSS), when sources are generally statistically dependent under conditions that additional constraints are imposed such as nonnegativity, sparsity, smoothness, lower complexity or better predictability. We express the non-negativity constraints using a wide class of loss (cost) functions, which leads to an extended class of multiplicative algorithms with regularization. The proposed relaxed forms of the NMF algorithms have a higher convergence speed with the desired constraints. Moreover, the effects of various regularization and constraints are clearly shown. The scope of the results is vast since the discussed loss functions include quite a large number of useful cost functions such as weighted Euclidean distance, relative entropy, Kullback Leibler divergence, and generalized Hellinger, Pearson's, Neyman's distances, etc

DOI: 10.1109/ICASSP.2006.1661352

Extracted Key Phrases

2 Figures and Tables

Citations per Year

207 Citations

Semantic Scholar estimates that this publication has 207 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Cichocki2006NewAF, title={New Algorithms for Non-Negative Matrix Factorization in Applications to Blind Source Separation}, author={Andrzej Cichocki and Rafal Zdunek and Shun-ichi Amari}, journal={2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings}, year={2006}, volume={5}, pages={V-V} }