Unsupervised learning of time-frequency patches as a noise-robust representation of speech

Abstract

We present a self-learning algorithm using a bottom-up based approach to automatically discover, acquire and recognize the words of a language. First, an unsupervised technique using non-negative matrix factorization (NMF) discovers phone-sized time–frequency patches into which speech can be decomposed. The input matrix for the NMF is constructed for static and dynamic speech features using a spectral representation of both short and long acoustic events. By describing speech in terms of the discovered time–frequency patches, patch activations are obtained which express to what extent each patch is present across time. We then show that speaker-independent patterns appear to recur in these patch activations and how they can be discovered by applying a second NMF-based algorithm on the co-occurrence counts of activation events. By providing information about the word identity to the learning algorithm, the retrieved patterns can be associated with meaningful objects of the language. In case of a small vocabulary task, the system is able to learn patterns corresponding to words and subsequently detects the presence of these words in speech utterances. Without the prior requirement of expert knowledge about the speech as is the case in conventional automatic speech recognition, we illustrate that the learning algorithm achieves a promising accuracy and noise robustness. 2009 Elsevier B.V. All rights reserved.

DOI: 10.1016/j.specom.2009.05.003

Extracted Key Phrases

13 Figures and Tables

Cite this paper

@article{Segbroeck2009UnsupervisedLO, title={Unsupervised learning of time-frequency patches as a noise-robust representation of speech}, author={Maarten Van Segbroeck and Hugo Van hamme}, journal={Speech Communication}, year={2009}, volume={51}, pages={1124-1138} }