Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | Substroke matching by segmenting and merging for online Korean cursive character recognition | |
| Author (s): | Kim, Chang-Soo Kang Ryoung Park Byung Hwan Jun Jaihie Kim | |
| Department/Lab Affiliations: | Biological Sciences Electrical and Computer Engineering Intelligent Microsystem Laboratory | |
| Keywords: | alphabet-based method handwritten character recognition image segmentation ligatures merging online Korean cursive character recognition substroke matching | |
| Issue Date: | 1998 | |
| Publisher: | Institute of Electrical and Electronics Engineers | |
| Citation: | Chang Soo Kim; Kang Ryoung Park; Byung Hwan Jun; Jaihie Kim, "Substroke matching by segmenting and merging for online Korean cursive character recognition," Fourteenth International Conference on Pattern Recognition, 1998 Proceedings, vol.2, pp.1110-1113, 16-20 Aug 1998 | |
| Abstract: | The Korean character is composed of several alphabets in two-dimensional formation and the total number of Korean characters exceeds eleven thousand. Therefore, the previous approaches to Korean cursive characters pay most of their attention to segmenting a character into alphabets accurately. However, it is difficult because the boundaries of alphabets are not apparent in most cases. We propose an alphabet-based method without assuming accurate alphabet segmentation. In the proposed method, a cursive character is segmented into substrokes by a set of segmenting conditions. Then it is matched with the reference substrokes generated from alphabet models and ligatures by segmenting and merging in the process of recognition. Among substrokes, a certain substroke can be either an alphabet itself a part of alphabet or a composite of the alphabet and ligature. We applied the proposed method to 5000 Korean characters and got the result of 83.4% for the first rank and 89.2% for the top 5 result candidates with the speed of 0.17 seconds on average per character on a PC which uses Intel Pentium 90 Mhz CPU. | |
| Type: | Article - Conference proceedings text | |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. FULL COPYRIGHT INFORMATION: | |
| Publisher URL: | ||
| Link to this page: | ||
| Full Text: |
|
| title | Substroke matching by segmenting and merging for online Korean cursive character recognition | |
| contributor.author | Kim, Chang-Soo | |
| contributor.author | Kang Ryoung Park | |
| contributor.author | Byung Hwan Jun | |
| contributor.author | Jaihie Kim | |
| contributor.deptlab | Biological Sciences | |
| contributor.deptlab | Electrical and Computer Engineering | |
| contributor.deptlab | Intelligent Microsystem Laboratory | |
| subject | alphabet-based method | |
| subject | handwritten character recognition | |
| subject | image segmentation | |
| subject | ligatures | |
| subject | merging | |
| subject | online Korean cursive character recognition | |
| subject | substroke matching | |
| date.issued | 1998 | |
| date.submitted | 2007 | |
| publisher | Institute of Electrical and Electronics Engineers | |
| identifier.citation | Chang Soo Kim; Kang Ryoung Park; Byung Hwan Jun; Jaihie Kim, "Substroke matching by segmenting and merging for online Korean cursive character recognition," Fourteenth International Conference on Pattern Recognition, 1998 Proceedings, vol.2, pp.1110-1113, 16-20 Aug 1998 | |
| identifier.pub.URI | ||
| description.abstract | The Korean character is composed of several alphabets in two-dimensional formation and the total number of Korean characters exceeds eleven thousand. Therefore, the previous approaches to Korean cursive characters pay most of their attention to segmenting a character into alphabets accurately. However, it is difficult because the boundaries of alphabets are not apparent in most cases. We propose an alphabet-based method without assuming accurate alphabet segmentation. In the proposed method, a cursive character is segmented into substrokes by a set of segmenting conditions. Then it is matched with the reference substrokes generated from alphabet models and ligatures by segmenting and merging in the process of recognition. Among substrokes, a certain substroke can be either an alphabet itself a part of alphabet or a composite of the alphabet and ligature. We applied the proposed method to 5000 Korean characters and got the result of 83.4% for the first rank and 89.2% for the top 5 result candidates with the speed of 0.17 seconds on average per character on a PC which uses Intel Pentium 90 Mhz CPU. | |
| type | Article - Conference proceedings | |
| type.DCMIType | text | |
| type.status | Final version | |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. | |
| rights.URI | ||
| date.accessioned | 2007-04-05T14:04:18Z | |
| date.available | 2007-04-05T14:04:18Z | |
| identifier.persist.URI | ||
| Full Text |
|