.png){kind=icon}
.png){kind=icon}
Return
An evolutionary decoding method for HMM-based continuous speech recognition systems using particle swarm optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-012-0313-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main recognition procedure in modern HMM-based continuous speech recognition systems is Viterbi algorithm. Viterbi algorithm finds out the best acoustic sequence according to input speech in the search space using dynamic programming. In this paper, dynamic programming is replaced by a search method which is based on particle swarm optimization. The major idea is focused on generating initial population of particles as the speech segmentation vectors. The particles try to achieve the best segmentation by an updating method during iterations. In this paper, a new method of particles representation and recognition process is introduced which is consistent with the nature of continuous speech recognition. The idea was tested on bi-phone recognition and continuous speech recognition workbenches and the results show that the proposed search method reaches the performance of the Viterbi segmentation algorithm ; however, there is a slight degradation in the accuracy rate.
Keywords:
Hidden Markov Model (HMM)
Particle swarm optimization (PSO)
Continuous speech recognition (CSR)
Viterbi algorithm
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K