한글 문자의 인식을 위한 대수적 구조

Algebraic Structure for the Recognition of Korean Characters

이 논문은 한글문자의 자동인식을 위한 기초적인 연구로서 기본문자의 구조에 대해서 검토하였다. 기본문자를 구조, 선분구조 및 물자 graph의 node와의 연결곤계 들 구조를 세가지 측면에서 집합 및 군론에 의한 대수적인 분석을 하고 또 그들의 각 구조의 복잡성에 대한 계릉을 고찰하였다. 나아가서 10개의 모음은 한 요소의 Affine 변환에 의한 연속회전으로 이루어지는 회전변환군 속에서 다수의 동치관계가 존재한다는 것을 기술하므로써, 한글문자의 인식에 있어서는 topological 골격외에 기하적 성질이 특히 중요하다는 것을 아울러 지적 하였다. The paper examined the character structure as a basic study for the recognition of Korean characters. In view of concave structure, line structure and node relationship of character graph, the algebraic structure of the basic Korean characters is are analized. Also, the degree of complexities in their character structure is discussed and classififed. Futhermore, by describing the fact that some equivalence relations are existed between the 10 vowels of rotational transformation group by Affine transformation of one element into another, it could be pointed out that the geometrical properting in addition to the topological properties are very important for the recognition of Korean characters.

The paper examined the character structure as a basic study for the recognition of Korean characters. In view of concave structure, line structure and node relationship of character graph, the algebraic structure of the basic Korean characters is are analized. Also, the degree of complexities in their character structure is discussed and classififed. Futhermore, by describing the fact that some equivalence relations are existed between the 10 vowels of rotational transformation group by Affine transformation of one element into another, it could be pointed out that the geometrical properting in addition to the topological properties are very important for the recognition of Korean characters.