• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.83-90
• /
• 2010

In vocabulary recognition system has reduce recognition rate unrecognized error cause of similar phoneme recognition and due to provided inaccurate vocabulary. Input of inaccurate vocabulary by feature extraction case of recognition by appear result of unrecognized or similar phoneme recognized. Also can't feature extraction properly when phoneme recognition is similar phoneme recognition. In this paper propose vocabulary recognition post-process error correction system using phoneme likelihood based on phoneme feature. Phoneme likelihood is monophone training phoneme data by find out using MFCC and LPC feature extraction method. Similar phoneme is induced able to recognition of accurate phoneme due to inaccurate vocabulary provided unrecognized reduced error rate. Find out error correction using phoneme likelihood and confidence when vocabulary recognition perform error correction for error proved vocabulary. System performance comparison as a result of recognition improve represent MFCC 7.5%, LPC 5.3% by system using error pattern and system using semantic.

• Journal of Digital Convergence
• /
• v.11 no.6
• /
• pp.137-142
• /
• 2013

Speech recognition system is input of inaccurate vocabulary by feature extraction case of recognition by appear result of unrecognized or similar phoneme recognized. Therefore, in this paper, we propose a speech recognition error correction method using phoneme similarity rate and reliability measures based on the characteristics of the phonemes. Phonemes similarity rate was phoneme of learning model obtained used MFCC and LPC feature extraction method, measured with reliability rate. Minimize the error to be unrecognized by measuring the rate of similar phonemes and reliability. Turned out to error speech in the process of speech recognition was error compensation performed. In this paper, the result of applying the proposed system showed a recognition rate of 98.3%, error compensation rate 95.5% in the speech recognition.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.1E
• /
• pp.21-26
• /
• 2007

In this paper, we propose a modified Viterbi algorithm to compensate for endpoint detection error during the decoding phase of an isolated word recognition task. Since the conventional Viterbi algorithm explores only the search space whose boundaries are fixed to the endpoints of the segmented utterance by the endpoint detector, the recognition performance is highly dependent on the accuracy level of endpoint detection. Inaccurately segmented word boundaries lead directly to recognition error. In order to relax the degradation of recognition accuracy due to endpoint detection error, we describe an unconstrained search of word boundaries and present an algorithm to explore the search space with efficiency. The proposed algorithm was evaluated by performing a variety of simulated endpoint detection error cases on an isolated word recognition task. The proposed algorithm reduced the Word Error Rate (WER) considerably, from 84.4% to 10.6%, while consuming only a little more computation power.

• Journal of Sasang Constitutional Medicine
• /
• v.19 no.2
• /
• pp.30-39
• /
• 2007

1. Objectives The Face is an important standard for the classification of Sasang Constitution. We are developing 3D Automatic Face Recognition Apparatus(3D-AFRA) to analyse the facial characteristics. This apparatus show us 3D image and data of man's face and measure facial figure data. So we should examine the figure restoration error of 3D Automatic Fare Recognition Apparatus(3D-AFRA) in hardware Error Analysis. 2. Methods We scanned Face status by using 3D Automatic Face Recognition Apparatus(3D-AFRA). And also we scanned Face status by using laser scanner(vivid 9i). We compared facial shape data be restored by 3D Automatic Face Recognition Apparatus(3D-AFRA) with facial shape data that be restorated by 3D laser scanner. And we analysed the average error and the maximum error of two data. 3. Results and Conclusions In frontal face, the average error was 0.48mm. and the maximum error was 4.60mm. In whole face, the average error of was 0.99mm. And the maximum error was 6.64mm. In conclusion, We assessed that accuracy of 3D Automatic Face Recognition Apparatus(3D-AFRA) is considerably good.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1586-1593
• /
• 2010

Vocabulary recognition error correction method has probabilistic pattern matting and dynamic pattern matting. In it's a sentences to based on key-word by semantic analysis. Therefore it has problem with key-word not semantic analysis for morphological changes shape. Recognition rate improve of vocabulary unrecognized reduced this paper is propose. In syllable restoration algorithm find out semantic of a phoneme recognized by a phoneme semantic analysis process. Using to sentences restoration that morphological analysis and morphological analysis. Find out error correction rate using phoneme likelihood and confidence for system parse. When vocabulary recognition perform error correction for error proved vocabulary. system performance comparison as a result of recognition improve represent 2.0% by method using error pattern learning and error pattern matting, vocabulary mean pattern base on method.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.3E
• /
• pp.31-36
• /
• 1996

In this paper, a two-stage recognition approach based on error pattern hypotheses is proposed to reduce errors of a connected digit recognizer. In the approach, a conventional recognizer is first used to produce N-best candidate strings, and then error patterns are hypothesized by examining the candidate strings. For substitution error pattern hypotheses, error-pattern-dependent classifiers having more discriminative power than the first-stage classifier are used ; and for insertion and deletion errors, word duration and energy contour information are exploited are exploited to discriminated confusing pairs. Simulation results showed that the proposed approach achieves 15% decrease in word error rate for speaker-independent Korean connected digit recognition when a hidden Markov model-based recognizer is used for the first-stage classifier.

• 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.

• Speech Sciences
• /
• v.7 no.3
• /
• pp.167-183
• /
• 2000

In this paper, we propose two kinds of chaos dimensions, the fuzzy correlation and fuzzy Lyapunov dimensions, for speaker recognition. The proposal is based on the point that chaos enables us to analyze the non-linear information contained in individual's speech signal and to obtain superior discrimination capability. We confirm that the proposed fuzzy chaos dimensions play an important role in enhancing speaker recognition ratio, by absorbing the variations of the reference and test pattern attractors. In order to evaluate the proposed fuzzy chaos dimensions, we suggest speaker recognition using the proposed dimensions. In other words, we investigate the validity of the speaker recognition parameters, by estimating the recognition error according to the discrimination error of an individual speaker from the reference pattern.

• Journal of Sasang Constitutional Medicine
• /
• v.18 no.2
• /
• pp.34-40
• /
• 2006

1. Objectives We are going to develope 3D Face Recognition Apparatus to analyse the facial characteristics of the Sasangin. In the process, we should identify the recognition rate of the three dimensional position using this Apparatus. 2. Methods We took a photograph of calibrator($280{\times}400mm$) with interval of 20mm longitudinal direction of 10 times using 3D Face Recognition Apparatus. In the practice, we obtained 967 point to the exclusion of points deviating from the visual field of dual camera. And we made a comparison between measurement values and three dimensional standard values to calculate the errors. 3. Results and Conclusions In this test, the average error rate of X axis values was 0.019% and the maximum error rate of X axis values was 0.033%, the average error rate of Y axis values was 0.025% and the maximum error rate of Y axis values was 0.044%, the average error rate of Z axis values was 0.158% and the maximum error rate of Z axis values was 0.269%. This results exhibit much improvement upon the average error rate 1% and the maximum error rate 2.242% of the existing 3D Recognition Apparatus. In conclusion, we assessed that this apparatus was adaptable to abstract the facial characteristic point from three dimensional face shape in the mechanical aspects.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.57-63
• /
• 2010

The damping parameter of Levenberg-Marquardt algorithm switches between error backpropagation and Gauss-Newton learning and affects learning speed. Fixing the damping parameter induces some oscillation of error and decreases learning speed. Therefore, we propose the way of a variable damping parameter with referring to the alternation of error. The proposed method makes the damping parameter increase if error rate is large and makes it decrease if error rate is small. This method so plays the role of momentum that it can improve learning speed. We tested both iris recognition and wine recognition for this paper. We found out that this method improved learning speed in 67% cases on iris recognition and in 78% cases on wine recognition. It was also showed that the oscillation of error by the proposed way was less than those of other algorithms.