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

Authors:
Wenwu Wang;Andrzej Cichocki;Jonathon A. Chambers
Affiliations:
Centre for Vision, Speech and Signal Processing, Department of Electronic Engineering, University of Surrey, Guildford, U.K.;Laboratory for Advanced Brain Signal Processing, Brain Science Institute, RIKEN, Saitama, Japan;Advanced Signal Processing Group, Department of Electronic and Electrical Engineering, Loughborough University, Loughborough, U.K.
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 5
Cited 5

Non-negative Matrix Factorization with Sparseness Constraints

The Journal of Machine Learning Research
Csiszár’s divergences for non-negative matrix factorization: family of new algorithms

ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Nonnegative matrix factor 2-d deconvolution for blind single channel source separation

ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Monaural Sound Source Separation by Nonnegative Matrix Factorization With Temporal Continuity and Sparseness Criteria

IEEE Transactions on Audio, Speech, and Language Processing
Convolutive Speech Bases and Their Application to Supervised Speech Separation

IEEE Transactions on Audio, Speech, and Language Processing

Single channel music sound separation based on spectrogram decomposition and note classification

CMMR'10 Proceedings of the 7th international conference on Exploring music contents
On connection between the convolutive and ordinary nonnegative matrix factorizations

LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
Optimization and Parallelization of Monaural Source Separation Algorithms in the openBliSSART Toolkit

Journal of Signal Processing Systems
Noise robust ASR in reverberated multisource environments applying convolutive NMF and Long Short-Term Memory

Computer Speech and Language
Sparse coding with adaptive dictionary learning for underdetermined blind speech separation

Speech Communication

Quantified Score

Hi-index	35.68

Visualization

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.