Online cursive hangul character recognition based on dynamic programming

Author

Shin, Jungpil

Author_Institution

Dept. of Comput. Software, Aizu Univ., Fukushima, Japan

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

810

Lastpage

814

Abstract

In this paper a new algorithm for the on-line recognition of cursive Korean characters (hangul) is investigated for the problem of searching the segmentation points to divide the phonemes. The segmentation points searching is systematically performed by two-level DP matching algorithm, that is, one algorithm targets the phoneme unit level, and the other the whole character unit level. Based on the composition characteristics of hanguls, effective syntax is introduced as part of the character level process. Fine discrimination is effectively realized for both phonemes and characters including the individual information of each stroke and mutual information among strokes. Experiments demonstrate real time feasibility, high recognition and segmentation performance

Keywords

character recognition; dynamic programming; image segmentation; characters; cursive Korean characters; dynamic programming; hangul; hangul character recognition; on-line recognition; phonemes; segmentation; segmentation points; Character recognition; Cities and towns; Dynamic programming; Hidden Markov models; Joining processes; Mutual information; Performance analysis; Shape; Software algorithms; Speech recognition;

fLanguage

English

Publisher

ieee

Conference_Titel

Document Analysis and Recognition, 2001. Proceedings. Sixth International Conference on

Conference_Location

Seattle, WA

Print_ISBN

0-7695-1263-1

Type

conf

DOI

10.1109/ICDAR.2001.953900

Filename

953900