• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.19-22
• /
• 2000

This paper presents new on-line handwritten algorithm for continuous alphabet uppercase characters. The algorithm is based on the idea that alphabet uppercase character consists of at most 4 strokes. It tries to determine the maximum output for a recognition result among outputs of four recognizers which have the capacity to discriminate the character using from 1 through 4 stroke information. The recognition module has 4 neural network based recognizers, which can recognize from 1 through 4 stroke character. We also use specialized post-processing techniques for improving the recognition performance. Trained on 440 input data and choosing 390 uppercase words for a recognition test we reached a 92% recognition rate.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.103-110
• /
• 1990

This paper studies on an on-line recognition of handwritten Hangeul characters using the fuzzy inference. To solve the ambiguity due to the variations of writing style by writes, these handwri-tten characters are recognized by means of the fuzzy inference on the production rule which is generated with every relative position information between strokes. In order to reduce the processing time, a subgroup which is previously classified with the number of strokes of reference characters is selected according to the number of strokes of input character, and the tolerance limit of distances between input character and reference characters of a subgroup is introduced to reduce the reference characters which is applied to the fuzzy inference. Experimental results for handwritten Hanguel charters 3990 by 10 writers show the recognition rate of $99.5{\%}$and the average processing time of 0.4sec/character.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.413-435
• /
• 2018

Although the accuracy of handwritten character recognition based on deep networks has been shown to be superior to that of the traditional method, the use of an overly deep network significantly increases time consumption during parameter training. For this reason, this paper took the training time and recognition accuracy into consideration and proposed a novel handwritten character recognition algorithm with newly designed network structure, which is based on an extended nonlinear kernel residual network. This network is a non-extremely deep network, and its main design is as follows:(1) Design of an unsupervised apriori algorithm for intra-class clustering, making the subsequent network training more pertinent; (2) presentation of an intermediate convolution model with a pre-processed width level of 2;(3) presentation of a composite residual structure that designs a multi-level quick link; and (4) addition of a Dropout layer after the parameter optimization. The algorithm shows superior results on MNIST and SVHN dataset, which are two character benchmark recognition datasets, and achieves better recognition accuracy and higher recognition efficiency than other deep structures with the same number of layers.

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

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2600-2608
• /
• 1998

This paper proposes an algorithm for off line recognition of handwritten characters, especially effective for large-set characters such as Korean and Chinese characters. The algorithm is based on a minimum distance dlassification method which is simple and easy to implement but suffers from low recognition performance. Two strategies have been developed to improve its performance; one is multi-stage pre-classification and the other is candicate reordering. Effectiveness of the algorithm has been proven by and experimet with the samples of 574 classes in a handwritten Korean character catabase named PE02, where 86.0% of recognition accuracy and 15 characters per second of processing speed have been obtained.

• 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 the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.147-153
• /
• 1995

In this paper, we propose the position- and size-independent handwritten on-line Korean character recognition system using multilayer neural networks which are trained with error back-propagation learning algorithm and the features of Hanguel consonants and vowels. Starting point, end point, and three vectors from starting point to end point of each stroke of characters inputted from mouse or tablet are applied as inputs of neural networks. If double consonants and vowels are separated by single consonants and vowels, all consonants and vowels have at most four strokes. Therefore, four neural networks learn the consonants and the vowels having each number of strokes. Also, we propose the algorithm of separating the consonants and vowels and constructing a character.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.481-490
• /
• 2002

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic information has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing for off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods that effectively extracts skeleton through conditional test mask considering routing time and quality of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.3
• /
• pp.50-59
• /
• 1993

There is basic problem with the current evaluation method for character recognition systems. The current method evaluates the average recognition rate by applying the test data to the target system. The average recognition rate tells no more than and no less than the overall performance and it depends on the data. In this paper we propose a testing method which will analyze the target system and point out its strong points and weak points. This can be made possible through using the data which are generated cy distorting the standard character images according to a carefully controlled manner. This paper will describe how to automatically generate such distorted images. Also we will show the method is actually effective and useful by applying it to evaluating existing recognition algorithms.