Title
Optimal Clustering And Non-Uniform Allocation Of Gaussian Kernels In Scalar Dimension For Hmm Compression
Abstract
We propose ail algorithm for optimal clustering and nonuniform allocation of Gaussian Kernels in scalar (feature) dimension to compress complex, Gaussian mixture-based, continuous density HMMs into computationally efficient, small footprint models. The symmetric Kullback-Leibler divergence (KLD) is used as the universal distortion measure and it is minimized in both kernel clustering and allocation procedures. The algorithm was tested on the Resource Management (RM) database. The original coil text-dependent HMMs can be compressed to any resolution, measured by the total number of clustered scalar kernel components. Good trade-offs between the recognition performance and model complexities have been obtained: HMM can be compressed to 15-20% of the original model size, which needs 1-5% of multiplication/division operations, and results in almost negligible recognition performance degradation.
Year
DOI
Venue
2005
10.1109/ICASSP.2005.1415202
2005 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1-5: SPEECH PROCESSING
Keywords
DocType
ISSN
high performance computing,resource manager,testing,kernel,context dependent,speech recognition,gaussian kernel,natural languages,gaussian distribution,clustering algorithms,resource management,hidden markov models,kullback leibler divergence
Conference
1520-6149
Citations 
PageRank 
References 
6
0.70
6
Authors
4
Name
Order
Citations
PageRank
Xiao-Bing Li160.70
Frank K. Soong21395268.29
Tor André Myrvoll38210.39
Ren-Hua Wang434441.36