• Korean Journal of Cognitive Science
• /
• v.3 no.2
• /
• pp.271-289
• /
• 1992

In this paper,a cursive on-line Hangul recognition system which permits cursive writing between graphemes is presented.In general,the recognition of cursive Hangul writing has a difficulty of graheme segmentation and a complexity in matching procedure due to the increasing number of character candidates.To manage efficiently these problems,we propose a double segmentation method.Based on this segmentation,a recognition algorithm based on the line segment matching is proposed.Through the experimental result,it is show that the proposed recognition method is suitable for the cursive Hangul writings.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.357-364
• /
• 2005

In this paper, we propose an accurate and fast keyword spotting system for searching user-specified keyword in Hangul document images by using two-level image-to-image matching. The system is composed of character segmentation, creating a query image, feature extraction, and matching procedure. Two different feature vectors are used in the matching procedure. An experiment using 1600 Hangul word images from 8 document images, downloaded from the website of Korea Information Science Society, demonstrates that the proposed system is superior to conventional image-based document retrieval systems.

• 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 the Korean Institute of Telematics and Electronics B
• /
• v.31B no.9
• /
• pp.166-177
• /
• 1994

In this paper, an implemenation of on-line continuous recognizer for cursive Hangul handwriting is explained. For the Hangul recognition system, we propose a high speed string matching. The editing process in our proposed string matching is accomplished by single editing path. And the matching results are stored in a heap structure and we decide the user comfortibility of unceasing writing during recognition owing to the high speed matching. In the experimental result, a recongition rate of 86.36% at 1.75 second/character over 21,076 characters collected from 50 persons are abtained. And it is shown that the proposed recognition system is operated properly for the on-line recognition for cursive handwring between graphemes.

• Journal of information and communication convergence engineering
• /
• v.2 no.3
• /
• pp.161-166
• /
• 2004

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(PDA) for supporting natural and convenient data input. One of the most important issue is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.726-736
• /
• 1997

The textual image compression by pattern matching is a coding scheme that exploits the correlations between patterns. When we compress the Hangul (Korean character) text by patern matching, the collerations between patterns may decrease due to randoem contacts between phonemes. Therefore in this paper we separate connected phonemes to exploit effectively the corrlation between patterns by inducting the amtch. In the process of sequation, we decide whether the patterns have vowel component or not, and then vowels connected with consonant ae separated. When we compare the proposed algorithm with the existing algorith, the compression ratio is increased by 1.3%-3.0% than PMS[5] in lossy mode, by 3.4%-9.1% in lossless mode than that of SPM[7] which is submitted to standard committe for second generation binary compression algorithm.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.4
• /
• pp.29-37
• /
• 2010

The change detection of XML documents is a major research area. However, though XML becomes a file format for Hangul documents, research on change detection of Hangul documents based on the characteristics of Hangul documents is rather scarce. Since format data in Hangul documents are very large, which is different from ordinary XML documents, it is not proper to apply general XML change detection algorithms such as X-treeDiff+ to Hangul documents without any change. In this paper, we propose new contents-based matching algorithm and implement it in X-treeDiff+. The result of our testing shows better performance for most documents in editing process.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1546-1552
• /
• 2004

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(Pocket PC) for supporting natural and convenient data input. One of the most important issues is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.2
• /
• pp.1-8
• /
• 1992

This paper is proposed a Modified WLD (Weighted Levenshtein Distance) algorithm for processor desihn of code-string matching. A proposed MWLD (Modified Weighted Levenshtein Distance) algorithm is consist of 1-dimension bit-serial array processor to pattern matching using a Hamming Distance. The proposed processor is applied to recognition of character with real time input. The recognition rate of Hangul strokes is resulted to 98.65$\%$