• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.2
• /
• pp.135-145
• /
• 2023

Recently, as deep learning technology has developed, various deep learning technologies have been introduced in handwritten recognition, greatly contributing to performance improvement. The recognition accuracy of handwritten Hangeul recognition has also improved significantly, but prior research has focused on recognizing 520 Hangul characters or 2,350 Hangul characters using SERI95 data or PE92 data. In the past, most of the expressions were possible with 2,350 Hangul characters, but as globalization progresses and information and communication technology develops, there are many cases where various foreign words need to be expressed in Hangul. In this paper, we propose a model that recognizes and combines the consonants, medial vowels, and final consonants of a Korean syllable using a multi-label classification model, and achieves a high recognition accuracy of 98.38% as a result of learning with the public data of Korean handwritten characters, PE92. In addition, this model learned only 2,350 Hangul characters, but can recognize the characters which is not included in the 2,350 Hangul characters

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.9
• /
• pp.85-100
• /
• 1994

This paper proposes a recognition system of constrained handwritten Hangul and alphanumeric characters using discrete hidden Markov models (HMM). HMM process encodes the distortion and similarity among patterns of a class through a doubly stochastic approach. Characterizing the statistical properties of characters using selected features, a recognition system can be implemented by absorbing possible variations in the form. Hangul shapes are classified into six types by fuzzy inference, and their recognition is performed based on quantized features by optimally ordering features according to their effectiveness in each class. The constrained alphanumerics recognition is also performed using the same features used in Hangul recognition. The forward-backward, Viterbi, and Baum-Welch reestimation algorithms are used for training and recognition of handwritten Hangul and alphanumeric characters. Simulation result shows that the proposed method recognizes handwritten Korean characters and alphanumerics effectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.887-894
• /
• 2006

This paper proposes a new method that detects the intersection points of handwritten Hangul strokes using run-length. The method firstly finds the strokes' width of handwritten Hangul characters using both horizontal and vertical run-lengths, secondly extracts horizontal and vertical strokes of a character utilizing the strokes' width, and finally detects the intersection points of the strokes exploiting horizontal and vertical strokes. The analysis of both the horizontal and the vertical strokes doesn't use the strokes' angles but both the strokes' width and the changes of the run-lengths. The intersection points of the strokes become the candidated parts for phoneme segmentation, which is one of main techniques for off-line handwritten Hangul recognition. The segmented strokes represent the feature for handwritten Hangul recognition.

• Journal of Information Technology Services
• /
• v.20 no.6
• /
• pp.97-105
• /
• 2021

Recently, with the development of IT technology, unmanned systems are being introduced in many industrial fields, and one of the most important factors for introducing unmanned systems in the automobile field is vehicle licence plate recognition(VLPR). The existing VLPR algorithms are configured to use image processing for a specific type of license plate to divide individual areas of a character within the plate to recognize each character. However, as the number of Korean vehicle license plates increases, the law is amended, there are old-fashioned license plates, new license plates, and different types of plates are used for each type of vehicle. Therefore, it is necessary to update the VLPR system every time, which incurs costs. In this paper, we use an object detection algorithm to detect character regardless of the format of the vehicle license plate, and apply a handwritten Hangul recognition(HHR) algorithm to enhance the recognition accuracy of a single Hangul character, which is called a Hangul unit. Since Hangul unit is recognized by combining initial consonant, medial vowel and final consonant, so it is possible to use other Hangul units in addition to the 40 Hangul units used for the Korean vehicle license plate.

• Journal of information and communication convergence engineering
• /
• v.21 no.2
• /
• pp.167-173
• /
• 2023

Hangul is unique compared to other Asian languages because of its simple letter forms that combine to create syllabic shapes. There are 24 basic letters that can be combined to form 27 additional complex letters. This produces 51 graphemes. Hangul optical character recognition has been a research topic for some time; however, handwritten Hangul recognition continues to be challenging owing to the various writing styles, slants, and cursive-like nature of the handwriting. In this study, a dataset containing thousands of samples of 51 Hangul graphemes was gathered from 110 freshmen university students to create a robust dataset with high variance for training an artificial neural network. The collected dataset included 2200 samples for each consonant grapheme and 1100 samples for each vowel grapheme. The dataset was normalized to the MNIST digits dataset, trained in three neural networks, and the obtained results were compared.

• Korean Journal of Cognitive Science
• /
• v.7 no.4
• /
• pp.63-74
• /
• 1996

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.3
• /
• pp.385-392
• /
• 2006

This paper proposes a new stroke extraction algorithm for phoneme segmentation, which is one of main techniques for off-line handwritten Hangul recognition. The proposed algorithm extracts vertical, slant, and horizontal strokes from phonemes using run-length. The run-length of vertical or slant strokes becomes the width, and also the number of horizontal run-lengths the width. After extracting horizontal strokes from phonemes, the algorithm links two continuous vertical or slant stokes with run-lengths of the strokes' width to represent the features of a character. The extracted strokes can be utilized to recognize a character, using template matching of strokes, which is being adopted in on-line handwritten Hangul recognition.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1019-1022
• /
• 1999

In this paper, we analysis the effect of a dictionary in a handwritten Hangul word recognition problem in terms of its size and the length of the words in it. With our experimental results, we can account for the word recognition rate depending not only on character recognition performance, but also much on the amount of the information that the dictionary contains, as well as the reduction rate of a dictionary.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.1-8
• /
• 1994

In this paper, we propose an efficient two-step pattern matching method which promises shape distortion-tolerant recognition of handwritten of handwritten Hangul syllables. In the first step, nonlinear shape normalization is carried out to compensate for global shape distortions in handwritten characters, then a preliminary classification based on simple pattern matching is performed. In the next step, nonlinear pattern matching which achieves best matching between input and reference pattern is carried out to compensate for local shape distortions, then detailed classification which determines the final result of classification is performed. As the performance of recognition systems based on pattern matching methods is greatly effected by the quality of reference patterns. we construct reference patterns by combining the proposed nonlinear pattern matching method with a well-known averaging techniques. Experimental results reveal that recognition performance is greatly improved by the proposed two-step pattern matching method and the reference pattern construction scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.1
• /
• pp.25-30
• /
• 2000

Hangul is regarded as one of the difficult character set due to the large number of classes and the shape similarity among different characters. Most of the conventional researches attempted to recognize the 2,350 characters which are popularly used, but this approach has a problem or low recognition performance while it provides a generality. On the contrary, recognition of a small character set appearing in specific fields like postal address or bank checks is more practical approach. This paper describes a research for recognizing the handwritten Hangul characters appearing in monetary fields. The modular neural network is adopted for the classification and three kinds of feature are tested. The experiment performed using standard Hangul database PE92 showed the correct recognition rate 91.56%.