• Title/Summary/Keyword: Word Recognition

Search Result 792, Processing Time 0.043 seconds

Noise Robust Automatic Speech Recognition Scheme with Histogram of Oriented Gradient Features

  • Park, Taejin;Beack, SeungKwan;Lee, Taejin
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.5
    • /
    • pp.259-266
    • /
    • 2014
  • In this paper, we propose a novel technique for noise robust automatic speech recognition (ASR). The development of ASR techniques has made it possible to recognize isolated words with a near perfect word recognition rate. However, in a highly noisy environment, a distinct mismatch between the trained speech and the test data results in a significantly degraded word recognition rate (WRA). Unlike conventional ASR systems employing Mel-frequency cepstral coefficients (MFCCs) and a hidden Markov model (HMM), this study employ histogram of oriented gradient (HOG) features and a Support Vector Machine (SVM) to ASR tasks to overcome this problem. Our proposed ASR system is less vulnerable to external interference noise, and achieves a higher WRA compared to a conventional ASR system equipped with MFCCs and an HMM. The performance of our proposed ASR system was evaluated using a phonetically balanced word (PBW) set mixed with artificially added noise.

A Study on Word Recognition using sub-model based Hidden Markov Model (HMM 부모델을 이용한 단어 인식에 관한 연구)

  • 신원호
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06c
    • /
    • pp.395-398
    • /
    • 1994
  • In this paper the word recognition using sub-model based Hidden Markov Model was studied. Phoneme models were composed of 61 phonemes in therms of Korean language pronunciation characteristic. Using this, word model was maded by serial concatenation. But, in case of this phoneme concatenation, the second and the third phoneme of syllable are overlapped in distribution at the same time. So considering this, the method that combines the second and the third phoneme to one model was proposed. And to prevent the increase in number of model, similar phonemes were combined to one, and finially, 57 models were created. In experiment proper model structure of sub-model was searched for, and recognition results were compared. So similar recognition results were maded, and overall recognition rates were increased in case of using parameter tying method.

  • PDF

Speech Parameters for the Robust Emotional Speech Recognition (감정에 강인한 음성 인식을 위한 음성 파라메터)

  • Kim, Weon-Goo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.12
    • /
    • pp.1137-1142
    • /
    • 2010
  • This paper studied the speech parameters less affected by the human emotion for the development of the robust speech recognition system. For this purpose, the effect of emotion on the speech recognition system and robust speech parameters of speech recognition system were studied using speech database containing various emotions. In this study, mel-cepstral coefficient, delta-cepstral coefficient, RASTA mel-cepstral coefficient and frequency warped mel-cepstral coefficient were used as feature parameters. And CMS (Cepstral Mean Subtraction) method were used as a signal bias removal technique. Experimental results showed that the HMM based speaker independent word recognizer using vocal tract length normalized mel-cepstral coefficient, its derivatives and CMS as a signal bias removal showed the best performance of 0.78% word error rate. This corresponds to about a 50% word error reduction as compare to the performance of baseline system using mel-cepstral coefficient, its derivatives and CMS.

Isolated-Word Recognition Using Neural Network and Hidden Markov Model (Neural-HMM을 이용한 고립단어 인식)

  • 김연수;김창석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.11
    • /
    • pp.1199-1205
    • /
    • 1992
  • In this paper, a Korean word recognition method which usese Neural Network and Hidden Markov Models(HMM) is proposed to improve a recognition rate with a small amount of learning data. The method reduces the fluctuation due to personal differences which is a problem to a HMM recognition system. In this method, effective recognizer is designed by the complement of each recognition result of the Hidden Markov Models(HMM) and Neural Network. In order to evaluate this model, word recognition experiment is carried out for 28 cities which is DDD area names uttered by two male and a female in twenties. As a result of testing HMM with 8 state, codeword is 64, the recognition rate 91[%], as a result of testing Neural network(NN) with 64 codeword the recognition rate is 89[%]. Finally, as a result of testing NN-HMM with 64 codeword which the best condition in former tests, the recognition rate is 95[%].

  • PDF

A Study on the Recognition of Korean 4 Connected Digits Considering Co-articulation (조음결합을 고려한 4연 숫자음 인식에 관한 연구)

  • 이종진;이광석;허강인;김명기;고시영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.1
    • /
    • pp.20-28
    • /
    • 1992
  • Co-articulation is one of major factors that make connected word recognition difficult. This Study Considers the fact that the head Part Of the following word is changed by the Preceding word in a connection point, by applying the co-articulation model, and adj usting the following word .We choose a critical damping second order linear system for the co-articulation model, combining a one-stage DP matching recognition algorithm with this model, and Investigating the effects. The recognition experiment is carried out for 35 Korean 4 connected digits spoken by 5 male speakers, and recognition rate Is upgraded by 4.7 percent.

  • PDF

Isolated Words Recognition using K-means iteration without Initialization (초기화하지 않은 K-means iteration을 이용한 고립단어 인식)

  • Kim, Jin-Young;Sung, Keong-Mo
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.7-9
    • /
    • 1988
  • K-means iteration method is generally used for creating the templates in speaker-independent isolated-word recognition system. In this paper the initialization method of initial centers is proposed. The concepts are sorting and trace segmentation. All the tokens are sorted and segmented by trace segmentation so that initial centers are decided. The performance of this method is evaluated by isolated-word recognition of Korean digits. The highest recognition rate is 97.6%.

  • PDF

Adaptive Changes in the Grain-size of Word Recognition (단어재인에 있어서 처리단위의 적응적 변화)

  • Lee, Chang H.
    • Proceedings of the Korean Society for Cognitive Science Conference
    • /
    • 2002.05a
    • /
    • pp.111-116
    • /
    • 2002
  • The regularity effect for printed word recognition and naming depends on ambiguities between single letters (small grain-size) and their phonemic values. As a given word is repeated and becomes more familiar, letter-aggregate size (grain-size) is predicted to increase, thereby decreasing the ambiguity between spelling pattern and phonological representation and, therefore, decreasing the regularity effect. Lexical decision and naming tasks studied the effect of repetition on the regularity effect for words. The familiarity of a word from was manipulated by presenting low and high frequency words as well as by presenting half the stimuli in mixed upper- and lowercase letters (an unfamiliar form) and half in uniform case. In lexical decision, the regularity effect was initially strong for low frequency words but became null after two presentations; in naming it was also initially strong but was merely reduced (although still substantial) after three repetitions. Mixed case words were recognized and named more slowly and tended to show stronger regularity effects. The results were consistent with the primary hypothesis that familiar word forms are read faster because they are processed at a larger grain-size, which requires fewer operations to achieve lexical selection. Results are discussed in terms of a neurobiological model of word recognition based on brain imaging studies.

  • PDF

A postprocessing method for korean optical character recognition using eojeol information (어절 정보를 이용한 한국어 문자 인식 후처리 기법)

  • 이영화;김규성;김영훈;이상조
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.2
    • /
    • pp.65-70
    • /
    • 1998
  • In this paper, we will to check and to correct mis-recognized word using Eojeol information. First, we divided into 16 classes that constituents in a Eojeol after we analyzed Korean statement into Eojeol units. Eojeol-Constituent state diagram constructed these constitutents, find the Left-Right Connectivity Information. As analogized the speech of connectivity information, reduced the number of cadidate words and restricted case of morphological analysis for mis-recognition Eojeol. Then, we improved correction speed uisng heuristic information as the adjacency information for Eojeol each other. In the correction phase, construct Reverse-Order Word Dictionary. Using this, we can trace word dictionary regardless of mis-recongnition word position. Its results show that improvement of recognition rate from 97.03% to 98.02% and check rate, reduction of chadidata words and morpholgical analysis cases.

  • PDF

Isolated-Word Recognition Using Adaptively Partitioned Multisection Codebooks (음성적응(音聲適應) 구간분할(區間分割) 멀티섹션 코드북을 이용(利用)한 고립단어인식(孤立單語認識))

  • Ha, Kyeong-Min;Jo, Jeong-Ho;Hong, Jae-Kuen;Kim, Soo-Joong
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.10-13
    • /
    • 1988
  • An isolated-word recognition method using adaptively partitioned multisection codebooks is proposed. Each training utterance was divided into several sections according to its pattern extracted by labeling technique. For each pattern, reference codebooks were generated by clustering the training vectors of the same section. In recognition procedure, input speech was divided into the sections by the same method used in codebook generation procedure, and recognized to the reference word whose codebook represented the smallest average distortion. The proposed method was tested for 100 Korean words and attained recognition rate about 96 percent.

  • PDF

Isolated word recognition using the SOFM-HMM and the Inertia (관성과 SOFM-HMM을 이용한 고립단어 인식)

  • 윤석현;정광우;홍광석;박병철
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.6
    • /
    • pp.17-24
    • /
    • 1994
  • This paper is a study on Korean word recognition and suggest the method that stabilizes the state-transition in the HMM by applying the `inertia' to the feature vector sequences. In order to reduce the quantized distortion considering probability distribution of input vectors, we used SOFM, an unsupervised learning method, as a vector quantizer, By applying inertia to the feature vector sequences, the overlapping of probability distributions for the response path of each word on the self organizing feature map can be reduced and the state-transition in the Hmm can be Stabilized. In order to evaluate the performance of the method, we carried out experiments for 50 DDD area names. The results showed that applying inertia to the feature vector sequence improved the recognition rate by 7.4% and can make more HMMs available without reducing the recognition rate for the SOFM having the fixed number of neuron.

  • PDF