• Title/Summary/Keyword: the recognition of the order

Search Result 3,219, Processing Time 0.032 seconds

The Study on Korean Phoneme for Korean Speech Recogintion

  • Hwang, Young-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.629-632
    • /
    • 2000
  • In this paper, we studied on the phoneme classification for Korean speech recognition. In the case of making large vocabulary speech recognition system, it is better to use phoneme than syllable or word as recognition unit. And, In order to study the difference of speech recognition according to the number of phoneme as recognition unit, we used the speech toolkit of OGI in U.S.A as recognition system. The result showed that the performance of diphthong being unified was better than that of seperated diphthongs, and we required the better result when we used the biphone than when using mono-phone as recognition unit.

  • PDF

Recognition of hand written hangeul based on the stroke order of the elementary segment

  • Song, Jeong-Young;Akizuki, Kageo;Lee, Hee-Hyol;Choi, Won-Kyu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.302-306
    • /
    • 1994
  • This paper describes how to recognize hand written Hangeul character using the stroke order of the elementary segment. The recognition system is constructed of parts : character input part, segment disassembling part, character element extraction part and character recognition part. The character input part reads the character and performs thinning algorithm. In the segment disassembling part, the input character is disassembled into elementary segments using the direction codes and the feature parameters. In the character element extraction part, we extract the character element using the stroke order and the knowledge rule. Finally, we able to recognize the hand written Hangeul characters by assembling the character elements, in the character recognition part.

  • PDF

PCA vs. ICA for Face Recognition

  • Lee, Oyoung;Park, Hyeyoung;Park, Seung-Jin
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.873-876
    • /
    • 2000
  • The information-theoretic approach to face recognition is based on the compact coding where face images are decomposed into a small set of basis images. Most popular method for the compact coding may be the principal component analysis (PCA) which eigenface methods are based on. PCA based methods exploit only second-order statistical structure of the data, so higher- order statistical dependencies among pixels are not considered. Independent component analysis (ICA) is a signal processing technique whose goal is to express a set of random variables as linear combinations of statistically independent component variables. ICA exploits high-order statistical structure of the data that contains important information. In this paper we employ the ICA for the efficient feature extraction from face images and show that ICA outperforms the PCA in the task of face recognition. Experimental results using a simple nearest classifier and multi layer perceptron (MLP) are presented to illustrate the performance of the proposed method.

  • PDF

Fast Decoder Algorithm Using Hybrid Beam Search and Variable Flooring for Large Vocabulary Speech Recognition (대용량 음성인식을 위한 하이브리드 빔 탐색 방법과 가변 플로링 기법을 이용한 고속 디코더 알고리듬 연구)

  • Kim, Yong-Min;Kim, Jin-Young;Kim, Dong-Hwa;Kwon, Oh-Il
    • Speech Sciences
    • /
    • v.8 no.4
    • /
    • pp.17-33
    • /
    • 2001
  • In this paper, we implement the large variable vocabulary speech recognition system, which is characterized by no additional pre-training process and no limitation of recognized word list. We have designed the system in order to achieve the high recognition rate using the decision tree based state tying algorithm and in order to reduce the processing time using the gaussian selection based variable flooring algorithm, the limitation algorithm of the number of nodes and ENNS algorithm. The gaussian selection based variable flooring algorithm shows that it can reduce the total processing time by more than half of the recognition time, but it brings about the reduction of recognition rate. In other words, there is a trade off between the recognition rate and the processing time. The limitation algorithm of the number of nodes shows the best performance when the number of gaussian mixtures is a three. Both of the off-line and on-line experiments show the same performance. In our experiments, there are some differences of the recognition rate and the average recognition time according to the distinction of genders, speakers, and the number of vocabulary.

  • PDF

A Study on Object Recognition Technique based on Artificial Intelligence (인공지능 기반 객체인식 기법에 관한 연구)

  • Yang Hwan Seok
    • Convergence Security Journal
    • /
    • v.22 no.5
    • /
    • pp.3-9
    • /
    • 2022
  • Recently, in order to build a cyber physical system(CPS) that is a technology related to the 4th industry, the construction of the virtual control system for physical model and control circuit simulation is increasingly required in various industries. It takes a lot of time and money to convert documents that are not electronically documented through direct input. For this, it is very important to digitize a large number of drawings that have already been printed through object recognition using artificial intelligence. In this paper, in order to accurately recognize objects in drawings and to utilize them in various applications, a recognition technique using artificial intelligence by analyzing the characteristics of objects in drawing was proposed. In order to improve the performance of object recognition, each object was recognized and then an intermediate file storing the information was created. And the recognition rate of the next recognition target was improved by deleting the recognition result from the drawing. In addition, the recognition result was stored as a standardized format document so that it could be utilized in various fields of the control system. The excellent performance of the technique proposed in this paper was confirmed through the experiments.

Feature Extraction Method for the Character Recognition of the Low Resolution Document

  • Kim, Dae-Hak;Cheong, Hyoung-Chul
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.3
    • /
    • pp.525-533
    • /
    • 2003
  • In this paper we introduce some existing preprocessing algorithm for character recognition and consider feature extraction method for the recognition of low resolution document. Image recognition of low resolution document including fax images can be frequently misclassified due to the blurring effect, slope effect, noise and so on. In order to overcome these difficulties in the character recognition we considered a mesh feature extraction and contour direction code feature. System for automatic character recognition were suggested.

  • PDF

A Stroke Matching Method for the Off-line Recognition of Handprinted Hangul (필기체 한글의 오프라인 인식을 위한 획 정합 방법)

  • 김기철;김영식;이성환
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.6
    • /
    • pp.76-85
    • /
    • 1993
  • In this paper, we propose a stroke matching method for the off-line recognition of handprinted Hangul. In this method, the preprocessing steps such as position normalization, contour tracing and thinning are carried out first. Then, after extracting features such as the firection component distribution of contour, the direction component distribution of skeleton, and the distribution of structural feature points, strokes are extracted and matched based on the midpont distribution of the direction and the length of each stroke. In order to reduce the recognition time, a preliminary classification based on the direction component distribution features of the contour is performed. In order to domonstrate the performance of the proposed method, experiments with 520 most frequently used Hangul were performed, and 90.7% of correct recognition rate and 0.46second of recognition time per one character has been obtained. This results reveal that the proposed method can absorb effectively the noise in input character and the variations of stroke slant.

  • PDF

A Study on Face Recognition and Reliability Improvement Using Classification Analysis Technique

  • Kim, Seung-Jae
    • International journal of advanced smart convergence
    • /
    • v.9 no.4
    • /
    • pp.192-197
    • /
    • 2020
  • In this study, we try to find ways to recognize face recognition more stably and to improve the effectiveness and reliability of face recognition. In order to improve the face recognition rate, a lot of data must be used, but that does not necessarily mean that the recognition rate is improved. Another criterion for improving the recognition rate can be seen that the top/bottom of the recognition rate is determined depending on how accurately or precisely the degree of classification of the data to be used is made. There are various methods for classification analysis, but in this study, classification analysis is performed using a support vector machine (SVM). In this study, feature information is extracted using a normalized image with rotation information, and then projected onto the eigenspace to investigate the relationship between the feature values through the classification analysis of SVM. Verification through classification analysis can improve the effectiveness and reliability of various recognition fields such as object recognition as well as face recognition, and will be of great help in improving recognition rates.

Combining Empirical Feature Map and Conjugate Least Squares Support Vector Machine for Real Time Image Recognition : Research with Jade Solution Company

  • Kim, Byung Joo
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.1
    • /
    • pp.9-17
    • /
    • 2017
  • This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.

A Study on How to Build an Optimal Learning Model for Artificial Intelligence-based Object Recognition (인공지능 기반 객체 인식을 위한 최적 학습모델 구축 방안에 관한 연구)

  • Yang Hwan Seok
    • Convergence Security Journal
    • /
    • v.23 no.5
    • /
    • pp.3-8
    • /
    • 2023
  • The Fourth Industrial Revolution is bringing about great changes in many industrial fields, and among them, active research is being conducted on convergence technology using artificial intelligence. Among them, the demand is increasing day by day in the field of object recognition using artificial intelligence and digital transformation using recognition results. In this paper, we proposed an optimal learning model construction method to accurately recognize letters, symbols, and lines in images and save the recognition results as files in a standardized format so that they can be used in simulations. In order to recognize letters, symbols, and lines in images, the characteristics of each recognition target were analyzed and the optimal recognition technique was selected. Next, a method to build an optimal learning model was proposed to improve the recognition rate for each recognition target. The recognition results were confirmed by setting different order and weights for character, symbol, and line recognition, and a plan for recognition post-processing was also prepared. The final recognition results were saved in a standardized format that can be used for various processing such as simulation. The excellent performance of building the optimal learning model proposed in this paper was confirmed through experiments.