1995 International Conference on Acoustics, Speech, and Signal Processing
DOI: 10.1109/icassp.1995.479658
|View full text |Cite
|
Sign up to set email alerts
|

High speed speech recognition using tree-structured probability density function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(23 citation statements)
references
References 4 publications
0
23
0
Order By: Relevance
“…Moreover, preprocessing techniques (spectral subtraction for Table 1 Mobile terminal products and chips including speech recognition (see [116,116}121] [102,104,126]. Another aspect that highly interests these manufacturers is the reduction of the computational cost of the ASR algorithm [124,125]. To conclude this section, one can say that ASR can be fully implemented in a terminal if operating on small vocabulary and in isolated or connected words modes.…”
Section: Speech Recognition In Mobile Terminalsmentioning
confidence: 99%
“…Moreover, preprocessing techniques (spectral subtraction for Table 1 Mobile terminal products and chips including speech recognition (see [116,116}121] [102,104,126]. Another aspect that highly interests these manufacturers is the reduction of the computational cost of the ASR algorithm [124,125]. To conclude this section, one can say that ASR can be fully implemented in a terminal if operating on small vocabulary and in isolated or connected words modes.…”
Section: Speech Recognition In Mobile Terminalsmentioning
confidence: 99%
“…Thus, only the likely CGs are selected to impute the candidate clean speech. Existing methods of Gaussian selection can be classified as axis indexing-based methods [37,38] and VQ-based methods [39,40]. The former quickly locates the likely regions based on the observation, then selects the Gaussians in the likely regions [38] or removes the Gaussians in the unlikely regions [37].…”
Section: Selection Of Cgmentioning
confidence: 99%
“…Since the total number of clusters can be much less than the number of states, the problem of choosing the correct information block for sample generation is simplified. A tree structure to group the Gaussian mixtures from clean speech HMMs into clusters can be built with the following distance measure [15]: …”
Section: A Clustering Approach To Obtaining Correct Hmm Informationmentioning
confidence: 99%