Shape Decomposition and Stroke Extraction of Handwritten Korean Characters.

Saved in:

Bibliographic Details
Title:	Shape Decomposition and Stroke Extraction of Handwritten Korean Characters.
Authors:	Park, Jeong-Sun, Hong, Ki-Cheon, Oh, Il-Seok
Source:	International Journal of Computer Processing of Oriental Languages. Dec2002, Vol. 15 Issue 4, p469. 24p.
Subjects:	Decomposition method, Korean character sets (Data processing), Algorithms
Abstract:	For reliable recognition of the handwritten Korean characters, stroke extraction is one of the most important tasks. Classical approaches are based on the thinning operation and they have a limitation due to the problem of distorting original pattern shape. In this paper, we propose a shape decomposition algorithm that decomposes a handwritten Korean character pattern into a set of near-convex parts. The algorithm is designed based on the observation that Korean character patterns can be decomposed using two shape features called T-junction and B-junction. To handle robustly complex situations in which three or more strokes meet at a joint, we detect joint parts from the shape-decomposed pattern. We classify the parts into several types depending on their interrelationships. A line segment is extracted from a part such that it best represents the part and keeps connectivity with neighboring parts. We develop five criteria for the quality evaluation of our method and the thinning-based methods. The evaluation shows that our method is superior to the thinning methods and our results are very promising for the subsegment processes like recognition. [ABSTRACT FROM AUTHOR]
	Copyright of International Journal of Computer Processing of Oriental Languages is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	For reliable recognition of the handwritten Korean characters, stroke extraction is one of the most important tasks. Classical approaches are based on the thinning operation and they have a limitation due to the problem of distorting original pattern shape. In this paper, we propose a shape decomposition algorithm that decomposes a handwritten Korean character pattern into a set of near-convex parts. The algorithm is designed based on the observation that Korean character patterns can be decomposed using two shape features called T-junction and B-junction. To handle robustly complex situations in which three or more strokes meet at a joint, we detect joint parts from the shape-decomposed pattern. We classify the parts into several types depending on their interrelationships. A line segment is extracted from a part such that it best represents the part and keeps connectivity with neighboring parts. We develop five criteria for the quality evaluation of our method and the thinning-based methods. The evaluation shows that our method is superior to the thinning methods and our results are very promising for the subsegment processes like recognition. [ABSTRACT FROM AUTHOR]
ISSN:	02194279