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

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

Korean has a large set of characters, and has a two-dimensional formation: each character is composed of graphemes in two dimensions. Whereas connections between characters are rare, connections inside a grapheme and between graphemes happen frequently and these connections generate many cursive strokes. To deal with the large character set and the cursive strokes, using the graphemes as a recognition unit is an efffective approach, because it naturally accommodates the structural characteristics of the characters. In this paper, we propose a grapheme-based on-line recognition method for cursive korean characters. Our method uses a TDNN recognition engine to segment cursive strokes into graphemes and a graph-algorithmic postprocessor based on korean grapheme composition rule and viterbi search algorithm to find the best recognition score path. We experimented the method on freely hand-written charactes and obtained a recognition rate of 94.5%.

• International Journal of Advanced Culture Technology
• /
• v.10 no.2
• /
• pp.69-78
• /
• 2022

The purpose of this paper is to summarize the cursive script of traditional calligraphy and develop further possibilities based on the study of the painting and postscript of Ink bambooo, which was painted by wu zhen(吳鎮) during the Yuan Dynasty. The second section in this paper provides a summary of wu zhen(吳鎮)'s life, in addition to "Ink bambooo" and its painting postscript. The third and fourth sections are focused on analyzing the cursive script in the painting postscript of Ink bambooo, including the left-and-right structure, head prefix symbols, and bottom prefix symbols. The aim of this paper is the study of cursive script, and the theories and methods of the characters proposed by Dr. Cai Yonggui (from Fujian Normal University) and Dr. Liu Dongqin (from Southeast University) will be used to provide a summary. The presentation of the research results of this paper is designed to develop further possibilities for this type of traditional calligraphy.

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

This paper presents the algorithm of an on-line cursive Hangeul recognition by means of the DP matching with structural information. In the proposed method, the penalty represents the similarity between input character and reference character. The penalty is dynamically computed with types of strokes, directions of strokes, and the length rations of fragment during the process that searchs for an optimal path using 3$\times$3 matrix. As the result, this method can be exactly matched for even greatly deformed characters. The computer simulation shows that the proposed algorithm can be utilized in recognizing cursive Hangeul as well as correct Hangeul.

• 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 the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.116-129
• /
• 1993

This paper proposes an on-line Recognition scheme of cursive Korean characters based on the DP matching and fuzzy concept. The proposed algorithm, invariant to rotation and size, reduces greatly the computational requirement of dynamic programming by matching phonemes rather than character patterns, where the angle difference and the ration of lengths between input and reference patterns are adopted as matching features. The correct matching of poorly written cursive characters becomes possible by introducing the fuzzy concept in representing the features of phonemes and the ralative position between adjacent phonemes. Computer simulation results are observed to show the effectiveness of the proposed algorithm.

• Korean Journal of Heritage: History & Science
• /
• v.50 no.2
• /
• pp.80-93
• /
• 2017

This study proposes a new scientific measurement method for damaged epigraph. In this new method, the Chinese characters are converted and coordinates are created for this measurement. This method is then used to decipher partially damaged characters from the parts of the coordinated characters that are damaged and intact. The Chinese characters are divided into 9 square parts by the position of their Chinese Radicals. The unknown characters are then compared and deciphered dependent upon the character shape in 9 square parts that have been created. This method is more scientific, accurate, and makes it easier to find related characters than deciphering through contexts, which is current method. When creating a new software based on this algorithm, it will be especially useful in deciphering an old manuscript or a epigraph that made ancient Chinese characters which are not currently in use. This study will also be helpful in deciphering semi-cursive styled or cursive styled epigraph, as well as semi-cursive styled or cursive styled damaged characters during follow-up research.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.546-550
• /
• 2010

In this paper, we propose a method for the postprocessing of cursive script recognition in Wine Label Images. The proposed method mainly consists of three steps: combination matrix generation, character combination filtering, string matching. Firstly, the combination matrix generation step detects all possible combinations from a recognition result for each of the pieces. Secondly, the unnecessary information in the combination matrix is removed by comparing with bigram of word in the lexicon. Finally, string matching step decides the identity of result as a best matched word in the lexicon based on the levenshtein distance. An experimental result shows that the recognition accuracy is 85.8%.

• Bulletin of the Korean Mathematical Society
• /
• v.7 no.1
• /
• pp.13-19
• /
• 1970

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.1
• /
• pp.29-37
• /
• 1989

This paper presents an application of the extended DP matching method to the on-line recognition of cursive Hangeul (Korean characters). We decrease the number of matching's objects by performing rough classification matching which makes the best use of features in the first and the last segment of Hangeul. By adding the extraction function of the basic character patterns to DP matching method, we try to calculate precisely the difference among Hangeul. The extraction of the basic character patterns is done by examining the features of segments in character. Applying the extended DP matching method to the on-line recognition of cursive Hangeul, absorption of writing motion and stable separation of strokes can be performed with flexibility.