A Multiplicative Algorithm for Convolutive Non-Negative Matrix Factorization Based on Squared Euclidean Distance

Abstract

Using the convolutive nonnegative matrix factorization (NMF) model due to Smaragdis, we develop a novel algorithm for matrix decomposition based on the squared Euclidean distance criterion. The algorithm features new formally derived learning rules and an efficient update for the reconstructed nonnegative matrix. Performance comparisons in terms of computational load and audio onset detection accuracy indicate the advantage of the Euclidean distance criterion over the Kullback-Leibler divergence criterion.

DOI: 10.1109/TSP.2009.2016881

Extracted Key Phrases

7 Figures and Tables

Statistics

0102020102011201220132014201520162017
Citations per Year

52 Citations

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

See our FAQ for additional information.

Cite this paper

@article{Wang2009AMA, title={A Multiplicative Algorithm for Convolutive Non-Negative Matrix Factorization Based on Squared Euclidean Distance}, author={Wenwu Wang and Andrzej Cichocki and Jonathon A. Chambers}, journal={IEEE Transactions on Signal Processing}, year={2009}, volume={57}, pages={2858-2864} }