• The Journal of the Acoustical Society of Korea
• /
• v.15 no.6
• /
• pp.5-11
• /
• 1996

This paper is the study for recognizing single vowels of speaker-independent, and we suppose a method of speech recognition using VQ(Vector Quantization)/NN(Neural Network). This method makes a VQ codebook, which is used for obtaining the observation sequence, and then claculates the probability value by comparing each codeword with the data, finally uses these probability values for the input value of the neural network. Korean signle vowels are selected for our recognition experiment, and ten male speakers pronounced eight single vowels ten times. We compare the performance of our method with those of fuzzy VQ/HMM and conventional VQ/NN According to the experiment result, the recognition rate by VQ/NN is 92.3%, by VQ/HMM using fuzzy is 93.8% and by VQ/NN using fuzzy is 95.7%. Therefore, it is shown that recognition rate of speech recognition by fuzzy VQ/NN is better than those of fuzzy VQ/HMM and conventional VQ/HMM because of its excellent learning ability.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.95-98
• /
• 1998

본 논문에서는 이산적인 HMM(Hidden Markov Model)을 이용한 고립단어 인식 시스템에서 입력특징 벡터의 변별력을 향상시키기 위해 수정된 집단화 알고리듬을 제안하므로써 K-means나 LBG 알고리듬을 이용한 기존의 HMM에 비해 2.16%의 인식율을 향상시켰다. 또한 HMM학습과정에서 불충분한 학습데이타로 인해 발생되는 인식율저하의 문제를 해소하기 위해 개선된 smoothing 기법을 제안하므로써 화자독립 실험에서 3.07%의 인식율을 향상시켰다. 본 논문에서 제안한 두가지 알고리듬을 모두 적용하여 최종적으로 실험한 VQ/HMM에서는 기존의 방식에 비해 화자독립 인식실험 결과 평균 인식율이 4.66% 개선되었다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1993.06a
• /
• pp.109-112
• /
• 1993

In this paper, we propose the modified VQ, applied correlation between codewords in order to reduce the error rate due to personal and speakers' temporal variation. Such a modified VQ is used in the stage of preprocessing of HMM and the temporal variation is absorbed by nonlinear Decimation and Interpolation of vowel part that we obtain higher recognition rate than not so case. The objects of experiment are Korea 142 DDD regional names and we show that the proposed method increase the recognition rate.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3
• /
• pp.35-42
• /
• 1999

In this paper, a modified clustering algorithm is proposed to improve the discrimination of discrete HMM(Hidden Markov Model), so that it has increased recognition rate of 2.16% in comparison with the original HMM using the K-means or LBG algorithm. And, for preventing the decrease of recognition rate because of insufficient training data at the training scheme of HMM, a modified probabilistic smoothing method is proposed, which has increased recognition rate of 3.07% for the speaker-independent case. In the experiment applied the two proposed algorithms, the average rate of recognition has increased 4.66% for the speaker-independent case in comparison with that of original VQ/HMM.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.40-49
• /
• 1994

In this paper, we propose methods for improving the performance of word recognition system. The ray stratey of the first method is to apply the inertia to the feature vector sequences of speech signal to stabilize the transitions between VQ cdoes. The second method is generating the new observation probabilities using the transition matrix of VQ codes as weights at the observation probability of the output symbol, so as to take into account the time relation between neighboring frames in DHMM. By applying the inertia to the feature vector sequences, we can reduce the overlapping of probability distribution of the response paths for each word and stabilize state transitions in the HMM. By using the transition matrix of VQ codes as weights in conventional DHMM. we can divide the probability distribution of feature vectors more and more, and restrict the feature distribution to a suitable region so that the performance of recognition system can improve. To evaluate the performance of the proposed methods, we carried out experiments for 50 DDD area names. As a result, the proposed methods improved the recognition rate by $4.2\%$ in the speaker-dependent test and $12.45\%$ in the speaker-independent test, respectively, compared with the conventional DHMM.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.9
• /
• pp.1468-1475
• /
• 1990

In this paper, isolated words are recognized using multisection VQ and HMM. As recognition vocabuaries, 20 area-name which is uttered 5 times by 3 speakers is selected. In generating codebook, we devide recognition vocabulary into equal length, section, and make standard VQ codebook to each section and calculate observation by section and than recognize isolated words by HMM training. Multisection VQ codebook has time information and as observation is calculated by eacy section, computation is lesser and recongnition rate is higher than by whole codword. As a result, it is proved that recognition rate is higher in case of HMM using multisection VQ codebook.

• Speech Sciences
• /
• v.12 no.3
• /
• pp.115-124
• /
• 2005

We investigated on the submission of multiple candidates in speaker-independent speech recognition by VQ/HMM. Submission of fixed number of multiple candidates has first been examined. As the number of candidates increases by two, three, and four, the recognition error rates were found to decrease by 41%, 58%, and 65%, respectively compared to that of a single candidate. We tried another approach that the candidates within a range of Viterbi scores are submitted. The number of candidates showed geometric increase as the admitted range becomes large. For a practical application, a combination of the above two methods was also studied. We chose the candidates within some range of Viterbi scores and limited the maximum number of candidates submitted to five. Experimental results showed that recognition error rates of less than 10% could be achieved with average number of candidates of 3.2 by this method.

• The Journal of the Acoustical Society of Korea
• /
• v.12 no.1
• /
• pp.55-60
• /
• 1993

본 논문은 불특정 화자의 단모음 인식에 관한 연구로써, VQ(Vectro Quantization)와 MLP(multi-layer perceptron)에 의한 음성 인식 방법을 제안한다. 이 방법은 VQ codebook을 구하고 이를 이용해서 관측열(observation sequence)을 구해각 codeword가 데이터로부터 가질 수 있는 확률값을 계산하여 이 값을 신경 회로망의 입력으로 사용하는 방법이다. 인식 대상으로는 한국어 단모음을 선정하였으며 10명의 남성 화자가 8개의 단모음을 10번씩 발음한 것으로 시스템의 효율성을 알아보기 위해 VQ/HMM(hidden markov model)에 의한 인식과 비교 실험한다. 실험 결과에 의하면, 시스템의 단순성에도 불구하고 학습능력애 뛰어난 관계로 VQ/HMM보다 VQ와 MLP에 의한 음성 인식률이 향상됨을 보여준다.

• Speech Sciences
• /
• v.8 no.3
• /
• pp.143-148
• /
• 2001

We propose a new scheme for VQ codebook search. The procedure is in between the binary-tree-search and full-search and thus might be called N-ary search of a codebook. Through the experiment performed on 7200 frames spoken by 25 speakers, we confirmed that the best codewords as good as by the full-search were obtained at moderate time consumption comparable to the binary-tree-search. In application to speech recognition by HMM/VQ with Bakis model, where appearance of a specific codeword is essential in the parameter training phase, the method proposed here is expected to provide an efficient training procedure.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1991.06a
• /
• pp.54-57
• /
• 1991

본 논무에서는 HMM과 VQ를 이용한 고립단어에 대한 화자종속 및 화자독립 음성인식시스템을 만들고 여기에 화자적응을 하는 방법에 대한 연구를 했다. 화자적응방법에는 크게 VQ코드북을 적응시키는 방법과 HMM패러미터블 적응시키는 방법이 있다. 코드북적응을 하는 방법으로서 기존코드북에 대해 새로운화자의 적응음성을 양자화한 뒤 각 코드벡터에 해당하는 적응음성의 평균을 구해서 새로운 화자의 코드북을 구해주는 방법과 기준코드북에 대해 새로운화자의 적응음성을 양자화할 때 HMM의 각 상태에서 각각의 코드벡터를 발생할 확률을 거리오차의 계산에서 고려해 비록 거리오차는 크지만 그 코드벡터를 발생할 확률이 매우 높으면 적응음성이 그 코드벡터에 index되게해서 각 코드벡터에 해당하는 모든 적응음성데이타의 평균을 새로운 코드북으로 하는 두가지 알고리즘을 제안한다. 이렇게 함으로써 기존의 기준코드북을 초기 코드북으로해서 LBG알고리즘을 사용해서 적응음성데이타에 대한 새로운 코드북을 만드는 방법에 비해 5-10배의 계산시간을 감소하게 된다. 이 새로운 코드북으로 적응음성데이타를 다시 index해서 이 index된 음성렬로 HMM패러미터를 적응했다. 제안된 알고리즘이 코드북적응을 하는 경우에 기존의 적응방법에 비해 5-10배의 계산 시간을 단축하면서 인식률에서는 더 나은결과를 얻었다. 또 같은 적응방법에 대해서 화자종속모델 보다는 화자독립모델에 대해서 화자적응하는 것이 더 나은 인식결과를 보여주었다.