2008
DOI: 10.1016/j.neucom.2008.01.033
|View full text |Cite
|
Sign up to set email alerts
|

Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint

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), a method for finding parts-based representations of non-negative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint, where the resultant algorithm has multiplicative updates and utilises the beta divergence as its reconstruction object… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
49
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 57 publications
(49 citation statements)
references
References 17 publications
0
49
0
Order By: Relevance
“…For example, multiple observations of speech over nearby intervals of time have temporal relationships. These temporal relationships motivate the use of a convolutive generative model to extend ICA and NMF mixing models for speech [20], [16] and [21]. NMF models the sensed magnitude spectrogram V as the combination of a set of objects (single spectral features) and the activations of the each of these features in time.…”
Section: B Convolutive Non-negative Matrix Factorizationmentioning
confidence: 99%
“…For example, multiple observations of speech over nearby intervals of time have temporal relationships. These temporal relationships motivate the use of a convolutive generative model to extend ICA and NMF mixing models for speech [20], [16] and [21]. NMF models the sensed magnitude spectrogram V as the combination of a set of objects (single spectral features) and the activations of the each of these features in time.…”
Section: B Convolutive Non-negative Matrix Factorizationmentioning
confidence: 99%
“…The statistical interpretation of the first approach is maximum likelihood estimation, given linear measurements corrupted by noise -regularization may also be considered. Regularization is often used by the NMF community to encourage a parts-based decomposition [17]. For this swimmers dataset, regularization is required.…”
Section: : End Ifmentioning
confidence: 99%
“…It is challenging for NMF as an overcomplete dictionary is required from a mixture of parts. Regularization is used to address this challenge: the choice of a suitable weighting term for the regularization parameter is difficult [17]. A second challenge lies in the fact that whilst the parts are binary, they are mixed synthetically with nonnegative values.…”
Section: Binary Matrices and Nonnegative Matricesmentioning
confidence: 99%
See 1 more Smart Citation
“…NMD has already been used successfully for sound source separation in music and speech applications [10,11].…”
Section: Matrix Deconvolutionmentioning
confidence: 99%