Results 1 -
2 of
2
Modelling, estimating and compensating low-bit rate coding distortion in speech recognition
- IEEE Trans. on SAP
, 2002
"... A solution to the problem of speech recognition with signals distorted by low-bit rate coders is presented in this paper. A model for the coding-decoding distortion, a HMM compensation method to include this model, and an EM-based adaptation algorithm to estimate this distortion are proposed here. M ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
A solution to the problem of speech recognition with signals distorted by low-bit rate coders is presented in this paper. A model for the coding-decoding distortion, a HMM compensation method to include this model, and an EM-based adaptation algorithm to estimate this distortion are proposed here. Medium vocabulary continuous-speech speaker-independent recognition experiments with 8 kbps G.729(CS-CELP), 13 kbps RPE-LTP (GSM), 5.3 kbps G723.1, 4.8 kbps FS-1016 and 32 kbps G.726(ADPCM) coders show that the approach described in this paper is able to dramatically reduce the effect of the coding distortion and, in some cases, gives a word accuracy higher than the baseline system with uncoded speech. Finally, the EM estimation algorithm requires only one adapting utterance and the approach described is certainly The evolution and popularity of cellular and TCP/IP networks has created the problem of improving the recognition accuracy for speech distorted by low-bit rate coders. The distortion of coding schemes in speech recognizers is difficult to model and is an open problem that cannot be solved by applying conventional noise cancelling techniques [1] such as spectral subtraction [2], cepstral mean subtraction [3] and RASTA
A Robust Viterbi Algorithm Against Impulsive Noise with Application to Speech Recognition
, 2005
"... The Viterbi algorithm has been successfully applied to different pattern recognition and communi-cation tasks. However, if some observations are corrupted by unknown impulsives noise which are not accounted for by the distortion measures, recognition performance can degrade significantly. In this pa ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
The Viterbi algorithm has been successfully applied to different pattern recognition and communi-cation tasks. However, if some observations are corrupted by unknown impulsives noise which are not accounted for by the distortion measures, recognition performance can degrade significantly. In this paper, we propose a robust Viterbi algorithm to handle short, impulsive noises with unknown characteristics by means of joint decoding and detection during the Viterbi search. To make the algorithm applicable to different noisy conditions with varying amounts of impulsive noise, we further proposed an approach to efficiently estimate the number of corruptions. We demonstrate the effectiveness of the proposed robust algorithms using spoken digit recognition experiments under two different impulsive noise environments. Under random Gaussian replacement noise, the proposed algorithm reduced digit error by more than 65%. Under the GSM network environment in which lost frames are replaced by interpolated neighboring frames, the robust algorithm reduced digit error by 20%. Furthermore, the proposed algorithm does not degrade performance when impulsive noise is not present.

