By Topic

Extracting dynamic features using the stochastic matching pursuit algorithm for speech event detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Wang ; Bell Atlantic Sci. & Technol. Inc., White Plains, NY, USA ; D. M. Goblirsch

We extend the stochastic matching pursuit algorithm (Wang et al., 1997) to the time frequency domain to extract dynamic features of speech. Speech signals, modeled by random processes, are decomposed into a linear combination of a subset of time frequency kernels, where the random vector composed of the decomposition coefficients can be proven to capture the statistical properties of the signal. Acoustic models based on these decomposition coefficients are trained and used to locate speech events that bear distinctive signatures on the time frequency plane. A recognition paradigm based on such a speech event detection mechanism is shown to achieve comparable recognition accuracy as those of the conventional approaches based on hidden Markov models

Published in:

Automatic Speech Recognition and Understanding, 1997. Proceedings., 1997 IEEE Workshop on

Date of Conference:

14-17 Dec 1997