Shape Decomposition and Stroke Extraction of Handwritten Korean Characters.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 9473991 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Shape Decomposition and Stroke Extraction of Handwritten Korean Characters. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Park%2C+Jeong-Sun%22">Park, Jeong-Sun</searchLink><br /><searchLink fieldCode="AR" term="%22Hong%2C+Ki-Cheon%22">Hong, Ki-Cheon</searchLink><br /><searchLink fieldCode="AR" term="%22Oh%2C+Il-Seok%22">Oh, Il-Seok</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Computer+Processing+of+Oriental+Languages%22">International Journal of Computer Processing of Oriental Languages</searchLink>. Dec2002, Vol. 15 Issue 4, p469. 24p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Decomposition+method%22">Decomposition method</searchLink><br /><searchLink fieldCode="DE" term="%22Korean+character+sets+%28Data+processing%29%22">Korean character sets (Data processing)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=9473991 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 24 StartPage: 469 Subjects: – SubjectFull: Decomposition method Type: general – SubjectFull: Korean character sets (Data processing) Type: general – SubjectFull: Algorithms Type: general Titles: – TitleFull: Shape Decomposition and Stroke Extraction of Handwritten Korean Characters. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Park, Jeong-Sun – PersonEntity: Name: NameFull: Hong, Ki-Cheon – PersonEntity: Name: NameFull: Oh, Il-Seok IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec2002 Type: published Y: 2002 Identifiers: – Type: issn-print Value: 02194279 Numbering: – Type: volume Value: 15 – Type: issue Value: 4 Titles: – TitleFull: International Journal of Computer Processing of Oriental Languages Type: main |
| ResultId | 1 |
