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

Title
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Authors
Keywords
-
Journal
NEUROCOMPUTING
Volume 72, Issue 1-3, Pages 88-101
Publisher
Elsevier BV
Online
2008-09-14
DOI
10.1016/j.neucom.2008.01.033

Ask authors/readers for more resources

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now