Convolutive Non-Negative Matrix Factorisation with a Sparseness Constraint
Paul D. O’Grady, Barak A. Pearlmutter · Machine learning for signal processing ... · 2006
Discovering a representation which allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF), a method for finding parts-based representations of non-negative data. We present an extension to NMF that is convolutive and includes a sparseness constraint. In combination with a spectral magnitude transform, this method discovers auditory objects and their associated sparse activation patterns.