DocumentCode
1956218
Title
Application of structured composite source models to problems in speech processing
Author
Feng, B. John ; Wakefield, Gregory H.
Author_Institution
Dept. of Electr. Eng., Michigan Univ., East Lansing, MI, USA
fYear
1989
fDate
14-16 Aug 1989
Firstpage
89
Abstract
An extension of the hidden Markov framework which may lead to substantial reductions in the complexity of implementing such a framework for speech modeling and recognition is proposed. This extension is suggested by the observation that speech statistics exhibit temporal structure over multiple time scales. Such temporal variation leads naturally to a special structure for the HMM (hidden Markov model). The structured composite source (SCS) is introduced as a generalization of the HMM. Theorems are developed for representing an arbitrary HMM as an SCS using techniques developed for multiple time scale analysis of weakly coupled Markov chains. Modification of the algorithms for the estimation of HMM parameters from sample data, the forward-backward and the baum-Welch algorithms, is straightforward, and results in a significant reduction in the computational complexity of the reestimation procedure
Keywords
Markov processes; computational complexity; speech analysis and processing; speech recognition; HMM; SCS; baum-Welch algorithms; computational complexity; hidden Markov framework; multiple time scales; reestimation procedure; speech modeling; speech processing; speech recognition; speech statistics; structured composite source models; weakly coupled Markov chains; Application software; Computer science; Estimation theory; Hidden Markov models; Predictive models; Signal processing; Speech processing; Speech recognition; Statistics; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1989., Proceedings of the 32nd Midwest Symposium on
Conference_Location
Champaign, IL
Type
conf
DOI
10.1109/MWSCAS.1989.101801
Filename
101801
Link To Document