This paper presents an efficient approximation of the Gaussian mixture state probability density functions of continuous observation density hidden Markov models (CHMM 's). In CHMM 's, the Gaussian mixtures carry a high computational cost, which amounts to a significant fraction (e.g. 30% to 70%) of the total computation. To achieve higher computation and memory efficiency, we approximate the Gaussian mixtures by (a) decomposition into functions defined on subspaces of the feature space, and (b) clustering the resulting subspace pdf's. Intuitively, when clustering in a subspace of few dimensions, even few function codewords can provide a small distortion. Therefore, we obtain significant reduction of the total computation (up to a factor of two), and memory savings (up to a factor of twelve), without significant changes of the CHMMM's accuracy.
Cite as: Bocchieri, E., Mak, B. (1997) Subspace distribution clustering for continuous observation density hidden Markov models. Proc. 5th European Conference on Speech Communication and Technology (Eurospeech 1997), 107-110, doi: 10.21437/Eurospeech.1997-54
@inproceedings{bocchieri97_eurospeech,
author={Enrico Bocchieri and Brian Mak},
title={{Subspace distribution clustering for continuous observation density hidden Markov models}},
year=1997,
booktitle={Proc. 5th European Conference on Speech Communication and Technology (Eurospeech 1997)},
pages={107--110},
doi={10.21437/Eurospeech.1997-54}
}