본문 바로가기

컴퓨터 & 프로그래밍/My Papers

The Recognition of Grapheme 'ㅁ', 'ㅇ' Using Neighbor Angle Histogram and Modified Hausdorff Distance

[KJ 1] Do-Hyeon Kim, Won-Du Chang, Ha-Young Kim, Eui-Young Cha, "The Recognition of Grapheme 'ㅁ', 'ㅇ' Using Neighbor Angle Histogram and Modified Hausdorff Distance", Journal of Korea Multimedia Society, Vol.8, No.2, pp. 181-191. (Written in Korean) [1st author's WebPage]


Abstract: The classification error of ‘ㅁ’, ‘ㅇ’ is one of the main causes of incorrect recognition in Korean characters, but there haven't been enough researches to solve this problem. In this paper, a new feature extraction method from Korean grapheme is proposed to recognize ‘ㅁ’, ‘ㅇ’ effectively. First, we defined an optimal neighbor-distance selection measure using modified Hausdorff distance, which we determined the optimal neighbor-distance by. And we extracted neighbor-angle feature which was used as the effective feature to classify the two graphemes ‘ㅁ’, ‘ㅇ’. Experimental results show that the proposed feature extraction method worked efficiently with the small number of features and could recognize the untrained patterns better than the conventional methods. It proves that the proposed method has a generality and stability for pattern recognition.