We propose a scalable recognition system for reducing recognition complexity. Scalable recognition can be combined with scalable compression in a distributed speech recognition (DSR) application to reduce both the computational load and the bandwidth requirement at the server. A low complexity pre-processor is used to eliminate the unlikely classes so that the complex recognizer can use the reduced subset of classes to recognize the unknown utterance. It is shown that by using our system it is fairly straightforward to trade-off reductions in complexity for performance degradation. Results of preliminary experiments using the TI-46 word digit database show that the proposed scalable approach can provide a 40% speed up, while operating under 1.05 kbps, compared to the baseline recognition using uncompressed speech.
Cite as: Srinivasamurthy, N., Ortega, A., Narayanan, S. (2001) Efficient scalable speech compression for scalable speech recognition. Proc. 7th European Conference on Speech Communication and Technology (Eurospeech 2001), 1845-1848, doi: 10.21437/Eurospeech.2001-436
@inproceedings{srinivasamurthy01_eurospeech,
author={Naveen Srinivasamurthy and Antonio Ortega and Shrikanth Narayanan},
title={{Efficient scalable speech compression for scalable speech recognition}},
year=2001,
booktitle={Proc. 7th European Conference on Speech Communication and Technology (Eurospeech 2001)},
pages={1845--1848},
doi={10.21437/Eurospeech.2001-436}
}