Low complexity techniques for embedded ASR systems

This paper deals with the problem of reducing the computational complexity of ASR algorithms for embedded systems. Particularly, three methods for simplifying the computation of state observation likelihoods of continuous density based HMMs are proposed. Feature component masking, variable-rate partial likelihood update and density pruning all result in significant savings in the decoding complexity with marginal impact on the recognition performance. A combination of feature component masking and density pruning was evaluated in a small vocabulary, 25lingual, speaker independent, isolated word recognition system. With a computational complexity reduction of 62% compared to the baseline system, a marginal, 1.6/6.5% relative error rate increase was obtained without/with on-line MAP adaptation on the average in clean and noisy operating environments. The presented framework can also be extended to larger vocabulary systems.

[1]  Olli Viikki,et al.  A recursive feature vector normalization approach for robust speech recognition in noise , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[2]  Marcel Vasilache,et al.  Speech recognition using HMMs with quantized parameters , 2000, INTERSPEECH.

[3]  Marcel Vasilache,et al.  Speaker adaptation of quantized parameter HMMs , 2001, INTERSPEECH.

[4]  Juha Häkkinen,et al.  Fast decoding in large vocabulary name dialing , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[5]  Enrico Bocchieri,et al.  Vector quantization for the efficient computation of continuous density likelihoods , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.