• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.2
• /
• pp.57-66
• /
• 2010

In this paper, we propose an enhanced voice recognition algorithm using adaptive MFCC(Mel Frequency Cepstral Coefficients) and neural network. Though it is very important to extract voice data from the raw data to enhance the voice recognition ratio, conventional algorithms are subject to deteriorating voice data when they eliminate noise within special frequency band. Differently from the conventional MFCC, the proposed algorithm imposed bigger weights to some specified frequency regions and unoverlapped filterbank to enhance the recognition ratio without deteriorating voice data. In simulation results, the proposed algorithm shows better performance comparing with MFCC since it is robust to variation of the environment.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.152-158
• /
• 2005

By using a combination of different feature sets extracted from input character patterns, we can improve the character recognition system performance. To reduce the dimensionality of the combined feature vector, we conduct the feature selection. This paper proposes a general framework for the feature combination and selection for character recognition problems. It also presents a specific design for the handwritten numeral recognition. Tn the design, DDD and AGD feature sets are extracted from handwritten numeral patterns, and a genetic algorithm is used for the feature selection. Experimental result showed a significant accuracy improvement by about 0.7% for the CENPARMI handwrittennumeral database.

• Speech Sciences
• /
• v.10 no.3
• /
• pp.251-261
• /
• 2003

There has been many research efforts to overcome the problems of speech recognition in noisy conditions. Among the noise-robust speech recognition methods, model-based adaptation approaches have been shown quite effective. Particularly, the PMC (parallel model combination) method is very popular and has been shown to give considerably improved recognition results compared with the conventional methods. In this paper, we experimented with the VTS (vector Taylor series) algorithm which is also based on the model parameter transformation but has not attracted much interests of the researchers in this area. To verify the effectiveness of it, we employed the algorithm in the continuous density HMM (Hidden Markov Model). We compared the performance of the VTS algorithm with the PMC method and could see that the it gave better results than the PMC method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.97-106
• /
• 1996

In this paper, we propose a face recognition algorithm using the hidden markov model and neural networks (HMM-NN). In the preprocessing stage, we find edges of a face using the locally adaptive threshold (LAT) scheme and extract features based on generic knowledge of a face, then construct a database with extracted features. In the training stage, we generate HMM parameters for each person by using the forward-backward algorithm. In the recognition stage, we apply probability vlaues calculated by the HMM to subsequent neural networks (NN) as input data. Computer simulation shows that the proposed HMM-NN algorithm gives higher recognition rate compared with conventional face recognition algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.240-246
• /
• 2006

This paper proposes the intelligent immigration control system that authorizes the traveler through immigration and detects forged passports by using automatic recognition of passport codes, the passport photo and face verification. The proposed system extracts and deskewes the areas of passport codes from the passport image. This paper proposes the novel ART algorithm creating the adaptive clusters to the variations of input patterns and it is applied to the extracted code areas for the code recognition. After compensating heuristically the recognition result, the detection of forged passports is achieved by using the picture and face verification between the passport photo extracted from the passport image and the picture retrieved from the database based on the recognized codes. Due to the proposed ART algorithm and the heuristic refinement, the proposed system relatively shows better performance.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.4
• /
• pp.282-287
• /
• 2006

This paper presents an original feature selection method for Emotion Recognition which includes many original elements. Feature selection has some merits regarding pattern recognition performance. Thus, we developed a method called thee 'Interactive Feature Selection' and the results (selected features) of the IFS were applied to an emotion recognition system (ERS), which was also implemented in this research. The innovative feature selection method was based on a Reinforcement Learning Algorithm and since it required responses from human users, it was denoted an 'Interactive Feature Selection'. By performing an IFS, we were able to obtain three top features and apply them to the ERS. Comparing those results from a random selection and Sequential Forward Selection (SFS) and Genetic Algorithm Feature Selection (GAFS), we verified that the top three features were better than the randomly selected feature set.

• Journal of the Semiconductor & Display Technology
• /
• v.18 no.4
• /
• pp.57-61
• /
• 2019

Nowadays, portable digital cameras such as smart phone cameras are being popularly used for entertainment and visual information recording. Given a database of geo-tagged images, a visual location recognition system can determine the place depicted in a query photo. One of the most common visual location recognition approaches is the bag-of-words method where local image features are clustered into visual words. In this paper, we propose a new bag-of-words-based visual location recognition algorithm using time-series streetview database. The proposed algorithm selects only a small subset of image features which will be used in image retrieval process. By reducing the number of features to be used, the proposed algorithm can reduce the memory requirement of the image database and accelerate the retrieval process.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.540-553
• /
• 2023

The hollow letter CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart) is an optimized version of solid CAPTCHA, specifically designed to weaken characteristic information and increase the difficulty of machine recognition. Although convolutional neural networks can solve CAPTCHA in a single step, a good attack result heavily relies on sufficient training data. To address this challenge, we propose a seed filling algorithm that converts hollow characters to solid ones after contour line restoration and applies three rounds of detection to remove noise background by eliminating noise blocks. Subsequently, we utilize a support vector machine to construct a feature vector for recognition. Security analysis and experiments show the effectiveness of this algorithm during the pre-processing stage, providing favorable conditions for subsequent recognition tasks and enhancing the accuracy of recognition for hollow CAPTCHA.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.701-710
• /
• 1995

A thinning algorithm is a very important procedure in order to increase recognition rate in the character recognition. This paper is the study of a parallel thinning algorithm available for the recognition of various characters, and it proposes the parallel thinning algorithm using the 8-neighbors connectivity value. Characteristics of the proposed algorithm are easiness of implementation of parallelism, the result of thinning is perfectly-8 connectivity and represented by numeric information. The proposed algorithm is very suitable for characters having many curve segments such as English, Japanese etc. Performance evaluation was performed by the measure of similarity to reference skeleton.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1391-1394
• /
• 1997

This paper proposes a new image processing algorithm to recognize korean documents. It take out the region of text area form input image, then it makes esgmentation of lines, words and characters in the text. A precision segmentation is very important to recognize the input document. The input image has 8-bit gray scaled resolution. Not only the histogram but also brightness dispersion graph are used for segmentation. The result shows a higher accuracy of document recognition.