Discovering convolutive speech phones using sparseness and non-negativity

16Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Discovering a representation that 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), which is a method for finding parts-based representations of non-negative data. Here, we present a convolutive NMF algorithm that includes a sparseness constraint on the activations and has multiplicative updates. In combination with a spectral magnitude transform of speech, this method extracts speech phones that exhibit sparse activation patterns, which we use in a supervised separation scheme for monophonie mixtures. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

O’Grady, P. D., & Pearlmutter, B. A. (2007). Discovering convolutive speech phones using sparseness and non-negativity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 520–527). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free