DocumentCode
3257043
Title
Viterbi Algorithm for multi-pattern joint decoding
Author
Nair, Nishanth Ulhas ; Sreenivas, T.V.
Author_Institution
Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India
fYear
2009
fDate
23-26 Jan. 2009
Firstpage
1
Lastpage
5
Abstract
Multi pattern Viterbi algorithm (MPVA) to jointly decode and recognize multiple speech patterns for automatic speech recognition (ASR) is proposed. The MPVA is a generalization of the Viterbi algorithm (VA) to jointly decode multiple patterns for a given standard hidden Markov model (HMM). Unlike our previously proposed constrained multi pattern Viterbi algorithm (CMPVA), the MPVA does not require the multi pattern dynamic time warping (MPDTW) algorithm. The new algorithm has the advantage that it can be extended to connected word recognition (CWR) and continuous speech recognition (CSR) problems. It also gives an improved speech recognition performance over the earlier techniques. Using only two repetitions of noisy speech patterns (-5 dB SNR, 10% burst noise), the word error rate using the proposed MPVA decreases by 28.5 percent, when compared to using individual decoding.
Keywords
Viterbi decoding; hidden Markov models; speech recognition; automatic speech recognition; connected word recognition; continuous speech recognition; hidden Markov model; multipattern Viterbi algorithm; multipattern dynamic time warping algorithm; multipattern joint decoding; noisy speech patterns; word error rate; Automatic speech recognition; Costs; Decoding; Hidden Markov models; Pattern recognition; Speech enhancement; Speech recognition; Testing; Viterbi algorithm; Working environment noise;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 2009 - 2009 IEEE Region 10 Conference
Conference_Location
Singapore
Print_ISBN
978-1-4244-4546-2
Electronic_ISBN
978-1-4244-4547-9
Type
conf
DOI
10.1109/TENCON.2009.5396092
Filename
5396092
Link To Document