A multiplicative algorithm for convolutive non-negative matrix factorization based on squared euclidean distance

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.