• Annual Conference on Human and Language Technology
• /
• 1992.10a
• /
• pp.533-542
• /
• 1992

손으로 쓴 글씨는 인쇄체와 달리 많은 변형이 있다는 점이 한글 필기 인식에서 가장 큰 장애물로 통한다. 본 논문에서는 이점을 해결하면서 필기에 대한 제한을 대폭 줄인 온라인 한글 인식 방법을 제시하고자 한다. 봉넷(BongNet)은 온라인 한글 필기를 인식하기 위한 네트워크 모델이다. 글씨 인식에 들어가는 여러가지 정보를 네트워크라는 틀 안에 표현한 것 인데, 기본적으로 네트워크 구조 자체가 표현하는 정적 글자 구조 정보와, 글꼴에 따라 달라지는 것으로써 노드간 확률적 이동을 나타내는 동적 정보를 포함한다. 본 모델에 따르면 한글 인식은 네트워크 안에서 최적 경로를 따라 초, 중, 종성 자소열을 찾는 문제로 변환된다. 동적 프로그래밍 기법을 이용하여 그 경로를 찾는 인식 알고리즘은 입력 데이타의 양에 정비례하는 효율성을 갖는다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.496-500
• /
• 2010

본 논문에서는 SIFT(Scale Invariant Feature Transform) 기술자를 이용하여 오프라인 필기체 문자 인식을 위한 특징 추출방법을 제안한다. 제안하는 방법은 문자의 획의 방향 정보를 제공하는 특징 벡터를 추출함으로써 오프라인 문자 인식에서 성능 향상을 기대할 수 있다. 테스트를 위해 MNIST 필기체 데이터베이스와 UJI Penchar2 필기체 데이터베이스를 이용하였고, BP(backpropagation)신경망과 LDA(Linear Discriminant Analysis), SVM(Support Vector Machine) 분류기에서 성능 테스트를 하였다. 본 논문의 실험결과에서는 일반적으로 사용되는 특징추출로부터 얻어진 특징에 제안된 특징추출을 정합하여 성능항샹을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.171-174
• /
• 2007

최근에 인간과 컴퓨터의 상호작용을 위한 입력장치 중 테이블-탑 디스플레이라는 멀티터치 입력장치가 활발히 연구되고 있다. 본 논문에서는 테이블-탑 디스플레이라는 환경에서 인간에게 가장 직관적인 도구인 손을 사용하여 입력된 온라인 필기 숫자를 전처리하는 방법을 제안한다. 테이블-탑 디스플레이 환경에 적합한 전처리 기법으로 대표점 추출을 위한 거리 필터링과 획 구분 및 잡음제거 등을 사용하였고, 데이터를 16방향 체인코드로 변환하였다. 이는 실제 필기운동 시의 궤적을 크게 왜곡 시키지 않으면서 테이블-탑 디스플레이가 갖는 환경에 기인한 잡음을 없애고, 데이터양을 줄일 수 있는 장점이 있다. 총450개의 필기 숫자 데이터를 사용하여 실험한 결과, 잡음이 제거되고 데이터양이 줄어들었으며 인식에 용이한 체인코드를 형성해 내었다.

• Journal of the Korean Data and Information Science Society
• /
• v.9 no.2
• /
• pp.345-355
• /
• 1998

The back propagation(BP) algorithm allows multilayer feedforward neural networks to learn input-output mappings from training samples. It iteratively adjusts the network parameters(weights) to minimize the sum of squared approximation errors using a gradient descent technique. However, the mapping acquired through the BP algorithm may be corrupt when errorneous training data are employed. In this paper two types of robust backpropagation algorithms are discussed both from a theoretical point of view and in the case studies of nonlinear regression function estimation and handwritten Korean character recognition. For future research we suggest Bayesian learning approach to neural networks and compare it with two robust backpropagation algorithms.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.181-191
• /
• 2005

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.

• Korean Journal of Cognitive Science
• /
• v.7 no.1
• /
• pp.57-74
• /
• 1996

This paper presents a comparison of recognition performance of the features used inthe recent handwritten korean character recognition.This research aims at providing the basis for feature selecion in order to improve not only the recognition rate but also the efficiency of recognition system.For the comparison of feature performace,we analyzed the characteristics of theose features and then,classified them into three rypes:global feature(image transformation)type,statistical feature type,and local/ topological feature type.For each type,we selected four or five features which seem more suitable to represent the characteristics of korean alphabet,and performed recongition experiments for the first consonant,horizontal vowel,and vertical vowel of a korean character, respectively.The classifier used in our experiments is a multi-layered perceptron with one hidden layer which is trained with backpropagation algorithm.The training and test data in the experiment are taken from 30sets of PE92. Experimental results show that 1)local/topological features outperform the other two type features in terms of recognition rates 2)mesh and projection features in statical feature type,walsh and DCT features in global feature type,and gradient and concavity features in local/topological feature type outperform the others in each type, respectively.

• Journal of KIISE:Software and Applications
• /
• v.29 no.10
• /
• pp.684-693
• /
• 2002

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(PDAs) for supporting natural and convenient data input. One of the most Important issue is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique. We did various experiments and our algorithm showed high matching rate over 97.7% for only the Korean script and 94% for the data mixed Korean with the Chinese character.

• Korean Journal of Cognitive Science
• /
• v.3 no.1
• /
• pp.61-78
• /
• 1991

This paper descibes the study of application of a modified Neocognitron model with backward path for the recognition of Hangul(Korean) syllabic characters. In this original report, Fukushima demonstrated that Neocognitron can recognize hand written numerical characters of $19{\times}19$ size. This version accepts $61{\times}61$ images of handwritten Hangul syllabic characters or a part thereof with a mouse or with a scanner. It consists of an input layer and 3 pairs of Uc layers. The last Uc layer of this version, recognition layer, consists of 24 planes of $5{\times}5$ cells which tell us the identity of a grapheme receiving attention at one time and its relative position in the input layer respectively. It has been trained 10 simple vowel graphemes and 14 simple consonant graphemes and their spatial features. Some patterns which are not easily trained have been trained more extrensively. The trained nerwork which can classify indivisual graphemes with possible deformation, noise, size variance, transformation or retation wre then used to recongnize Korean syllabic characters using its selective attention mechanism for image segmentation task within a syllabic characters. On initial sample tests on input characters our model could recognize correctly up to 79%of the various test patterns of handwritten Korean syllabic charactes. The results of this study indeed show Neocognitron as a powerful model to reconginze deformed handwritten charavters with big size characters set via segmenting its input images as recognizable parts. The same approach may be applied to the recogition of chinese characters, which are much complex both in its structures and its graphemes. But processing time appears to be the bottleneck before it can be implemented. Special hardware such as neural chip appear to be an essestial prerquisite for the practical use of the model. Further work is required before enabling the model to recognize Korean syllabic characters consisting of complex vowels and complex consonants. Correct recognition of the neighboring area between two simple graphemes would become more critical for this task.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.30 no.1
• /
• pp.97-107
• /
• 2024

Despite the rapid advancement in image recognition technology, achieving perfect digitization of tabular documents and handwritten documents still challenges. The purpose of this study is to improve the accuracy of digitizing the logbook by correcting errors by utilizing associated rules considered during logbook entries. Through this, it is expected to enhance the accuracy and reliability of data extracted from logbook through OCR programs. This model is to improve the accuracy of digitizing the logbook of the training ship "Saenuri" at the Mokpo Maritime University by correcting errors identified after Optical Character Recognition (OCR) program recognition. The model identified and corrected errors by utilizing associated rules considered during logbook entries. To evaluate the effect of model, the data before and after correction were divided by features, and comparisons were made between the same sailing number and the same feature. Using this model, approximately 10.6% of errors out of the total estimated error rate of about 11.8% were identified, and 56 out of 123 errors were corrected. A limitation of this study is that it only focuses on information from Dist.Run to Stand Course sections of the logbook, which contain navigational information. Future research will aim to correct more information from the logbook, including weather information, to overcome this limitation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.589-592
• /
• 2001

본 논문에서는 고속 필기 한글 주소 인식을 위한 낱자 인식기를 제안한다. 인식 대상은 우편번호 여섯 자리에 할당된 주소에 출현 빈도가 높은 필기 한글 469 자이다. 제안된 방법은 낱자 인식 기법을 채택하고 있으며, 인식률과 처리속도를 향상시키기 위하여 2 단계 인식 전략을 채택하였다. 인식기로는 다층퍼셉트론, 최소거리분류기, Subspace 방법을 고려한다. 다층퍼셉트론은 비교적 높은 인식률과 처리속도를 보유하지만 출력값이 확률이 아님으로써 후처리를 필요로 하는 시스템에서 사용하기 어렵다. 최소거리분류기는 간단한 알고리즘으로 처리속도가 높고 확률을 출력하는 장점을 갖지만 인식률이 낮아 활용되기 어렵다. 또한 Subspace 방법은 인식률이 높고 확률을 출력하지만 처리속도가 매우 느리다는 단점이 있다. 따라서 제안방법에서는 처리속도가 높은 인식기 - 다층퍼셉트론, 최소거리분류기 - 를 사용하여 선인식을 수행한 후, 이 결과를 활용하여 인식 대상을 제한한 후 Subspace 방법을 사용하여 정확하게 인식하는 전략을 도입함으로써, 높은 인식결과를 유지하면서 처리속도를 높이고 후처리에 적합하도록 하였다. PE92 데이터베이스를 사용하여 실험한 결과 제안방법이 한글 469 자에 대하여 비교적 높은 인식률과 처리속도를 갖음을 알 수 있었다.