Discovering Convolutive Speech Phones Using Sparseness and Non-negativity

DOI10.1007/978-3-540-74494-8_65zbMATH Open1173.94378OpenAlexW1568232062MaRDI QIDQ3608599FDOQ3608599

Authors: Paul D. O'Grady, Barak A. Pearlmutter 

Publication date: 5 March 2009

Published in: Independent Component Analysis and Signal Separation (Search for Journal in Brave)

Full work available at URL: http://eprints.maynoothuniversity.ie/10244/1/BP-Discovering-2007.pdf

Recommendations

• Non-negative matrix factorization with sparseness constraints
• Independent Component Analysis and Blind Signal Separation
• Learning sparse representations by non-negative matrix factorization and sequential cone programming
• Convolutive blind separation of speech mixtures using the natural gradient
• Supervised non-negative matrix factorization for audio source separation

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Independent component analysis, a new concept?

Cited In (2)

• Unsupervised learning of phonemes of whispered speech in a noisy environment based on convolutive non-negative matrix factorization
• Online Non-Negative Convolutive Pattern Learning for Speech Signals

Uses Software

• BSS Eval

This page was built for publication: Discovering Convolutive Speech Phones Using Sparseness and Non-negativity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608599)