• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.7
• /
• pp.158-165
• /
• 2019

Although evaluation of writing disabilities identification and timely intervention are required, clinicians adopt a manual scoring method and there is a possibility of error due to subjective evaluation. In this study, the size ratio and position of letters are digitized and quantified through image processing of offline handwritten characters. We tried to evaluate objectively and accurately the performance of writing through comparison with existing methods. From November 12th to 16th, 2018, 20 adults without neurological injury were selected. They used a pencil to follow the 10 words, 2 sentence stimuli after keeping the usual habit, and we collected the writing test data. The results showed that the height of the word was 1.2 times larger than the width and it tilted to the lower left. The spacing interval was 9mm on average. In the Paired T test, a high correlation was showed between our system and existing methods in the word and sentence 2. This demonstrated the possibility as a testing tool. This study evaluated objectively and precisely writing performance of offline handwritten characters through image processing and provided preliminary data for performance standards. In the future, it can be suggested as a basic data on writing diagnosis of various ages.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1417-1426
• /
• 2011

Business still relies heavily on pen and paper for legal reasons or convenience. The handwritten document is to be converted into digitalized document for IT system to manage and process in real time. Because the previous document digitalization systems convert the handwritten documents into digitalized documents by scanning and post-processing the documents, it is difficult to seamlessly proceed the work process. This paper proposes the LiveForm, a framework for digitalizing handwritten document using digital pen and handwriting recognition technology. To prove the applicability of the proposed LiveForm, we also implement a LiveForm based service in industrial gas distribution process and analyze effects of the system. The LiveForm generates the same digital image as the handwritten document by writing up the paper with absolute coordinates by digital pen and converts the handwriting data to digital text to insert the information into back-end system. The LiveForm based system eliminates scanning for document digitalization and data input with keyboard into back-end system in paper-based information gathering. Therefore, it is possible for the LiveForm to improve work process in various business areas.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.36 no.12
• /
• pp.1009-1015
• /
• 2009

Handwriting verification is a technique of distinguishing the same person's handwriting specimen from imitations with any two or more texts using one's handwriting individuality. This paper suggests an effective verification method for the handwritten signature or text on the off-line environment using pattern recognition technology. The core processes of the method which has been researched in this paper are extraction of letter area, extraction of features employing structural characteristics of handwritten text, feature analysis employing DTW(Dynamic Time Warping) algorithm and PCA(Principal Component Analysis). The experimental results show a superior performance of the suggested method.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.121-124
• /
• 2011

본 논문에서는 다양한 형태의 장애인을 대상으로 유연하게 적용 가능한 공공자격시험의 표준화 시스템을 설계하고 개발한다. 1차적으로 4 ~ 6급의 저시력 시각장애인, 뇌병변 장애인, 손부위 등에 대한 지체 장애인을 대상으로 제안시스템을 개발하여 적용한다. 물리적 조건으로 공공자격에 응시하는 장애가 있는 수험자는 수검사항에 위반되지 않는 상태에서 일반 응시자와 별도로 키보드를 지참하여 응시 가능하나 행망용 다기능 한글 모아치기 키보드로 제한되어지고 최소 17인치 이상의 모니터가 제공되어지며 수험 장소에 대하여 특정좌석을 지정할 수 있다. 시험적 조건으로는 장애를 가진 수험자에 대하여 장애상태를 구분하여 일반인 대비 20 ~ 30%의 추가시간이 할당되어지고 실기시험에 대하여는 150%의 확대문자가 기본적으로 제공되어진다. 상위 조건으로 필기시험과 실기시험이 실시되며 특별하게 시각장애인에 대한 실기시험에서는 일반인에 대한 시험 종료 후 제안시스템 제어 하에서 별도의 추가시험 절차가 부가적으로 자동진행 되어진다. 본 구현시스템은 장애인을 위한 8단계의 세부기능 설정 후 13가지의 평가 항목을 설정하여 실제 공공자격시스템에 시험 적용한 결과, 평균적으로 매우우수의 최상급 평가를 받았으며 장애인에 기반 한 공공자격분야 글로벌 표준화 시스템으로 제시하기 위한 후속 연구를 진행하고 있다.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.566-574
• /
• 2000

Although a numbed of variants of 2D HMM have been proposed in the literature, they are, in a word, too simple to model the variabilities of images for diverse classes of objects; they do not realize the modeling capability of the 1D HMM in 2D. Thus the author thinks they are poor substitutes for the HMM in 2D. The new model proposed in this paper is a hidden Markov lattice or, we can dare say, a 2D HMM with the causality of top-down and left-right direction. Then with the addition of a lattice constraint, the two algorithms for the evaluation of a model and the maximum likelihood estimation of model parameters are developed in the theoretical perspective. It is a more natural extension of the 1D HMM. The proposed method will provide a useful way of modeling highly variable patterns such as offline cursive characters.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.439-441
• /
• 2019

Deep learning has become a powerful and robust algorithm in Artificial Intelligence. One of the most impressive forms of Deep learning tools is that of the Convolutional Neural Networks (CNN). CNN is a state-of-the-art solution for object recognition. For instance when we utilize CNN with MNIST handwritten digital dataset, mostly the result is well. Because, in MNIST dataset, all digits are centralized. Unfortunately, the real world is different from our imagination. If digits are shifted from the center, it becomes a big issue for CNN to recognize and provide result like before. To solve that issue, we have created frequency images from spatial images by a Fast Fourier Transform (FFT).

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2400-2410
• /
• 2000

Many researches on recognition of Korean characters have been undertaken. But while the majority are done on Korean character recognition, tasks for developing document recognition system have seldom been challenged. In this paper, I designed a recognizer of Korean courtesy amounts to improve error correction in recognized character string. From the very first step of Korean character recognition, we face the enormous scale of data. We have 2350 characters in Korean. Almost the previous researches tried to recognize about 1000 frequently-used characters, but the recognition rates show under 80%. Therefore using these kinds of recognizers is not efficient, so we designed a statistical multiple recognizer which recognize 16 Korean characters used in courtesy amounts. By using multiple recognizer, we can prevent an increase of errors. For the Postprocessor of Korean courtesy amounts, we use the properties of Korean character strings. There are syntactic rules in character strings of Korean courtesy amounts. By using this property, we can correct errors in Korean courtesy amounts. This kind of error correction is restricted only to the Korean characters representing the unit of the amounts. The first candidate of Korean character recognizer show !!i.49% of recognition rate and up to the fourth candidate show 99.72%. For Korean character string which is postprocessed, recognizer of Korean courtesy amounts show 96.42% of reliability. In this paper, we suggest a method to improve the reliability of Korean courtesy amounts recognition by using the Korean character recognizer which recognize limited numbers of characters and the postprocessor which correct the errors in Korean character strings.

• Annual Conference on Human and Language Technology
• /
• 1995.10a
• /
• pp.131-136
• /
• 1995

최근들어 자연스럽게 필기된 한글을 인식함으로써 정보 입력 과정을 자동화하기 위한 오프라인 한글 글씨 인식에 관한 연구가 활발히 진행되고 있다. 오프라인 한글 글씨 인식에 관한 연구에 있어서 반드시 확보되어야 하는 연구 환경으로 대용량 오프라인 한글 글씨 데이타베이스의 구축을 들 수 있는데, 본 논문에서는 시스템공학연구소 국어공학센터의 국어 정보 베이스 개발사업의 일환으로 추진중인 오프라인 한글 글씨 데이타베이스의 구축현황에 대해 간략히 소개하고자 한다. 오프라인 한글 글씨 데이타베이스의 구축은 크게 글씨 데이타베이스 설계, 글씨 데이타 수집, 용지 스캔 및 문자 단위 분할, 데이타베이스 검증의 4 단계로 구성된다. 본 연구에서는 다양한 변형을 갖는 글씨체의 수집을 데이타베이스 구축시 가장 고려해야 할 요소로 삼았으며, 고품질의 일관성 있는 글씨 데이타베이스 구축을 위해 데이타베이스 설계 단계와 검증 단계에 많은 시간을 할애했다. 마지막으로 본 연구에서는 WWW(World Wide Web)의 HTML(Hyper Text Markup Language)을 이용하여 편리 한 사용자 인터페이스를 구현함으로써 사용자들이 쉽게 한글 글씨 영상을 검색 할 수 있음은 물론 인식 알고리즘의 개발에 사용 가능한 형태의 화일을 제공받을 수 있도록 구성하고 있다. 현재는 KS C 완성형 한글 2,350자 중에서 사용 빈도순 상위 520자에 대한 한글 글씨 1,000벌을 수집하여 명도영상 데이타베이스를 구축 중에 있으며, 향후 2년간 나머지 1,830자에 대한 한글 글씨 데이타를 수집하여 데이타베이스를 완성하고자 한다. 구축된 글씨 데이타베이스는 조만간 국내의 오프라인 한글 글씨 인식 연구자들에게 제공되어 우수한 인식 알고리즘의 개발을 위한 중요한 실험 데이타로서 사용될 예정이며, 개발된 인식 시스템에 대한 객관적인 성능 평가에 있어서도 크게 기여하여 국내의 오프라인 한글 글씨 인식에 관한 연구를 활성화시켜주는 계기가 될 것으로 기대된다.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.439-448
• /
• 2006

Previous recognition/clustering algorithms such as Kohonen SOM(Self-Organizing Map), MLP(Multi-Layer Percecptron) and SVM(Support Vector Machine) might not adapt to unexpected input pattern. And it's recognition rate depends highly on the complexity of own training patterns. We could make up for and improve the weak points with lowering complexity of original problem without losing original characteristics. There are so many ways to lower complexity of the problem, and we chose a kernel concepts as an approach to do it. In this paper, using a kernel concepts, original data are mapped to hyper-dimension space which is near infinite dimension. Therefore, transferred data into the hyper-dimension are distributed spasely rather than originally distributed so as to guarantee the rate to be risen. Estimating ratio of recognition is based on a new similarity-probing and learning method that are proposed in this paper. Using CEDAR DB which data is written in cursive letters, 0 to 9, we compare a recognition/clustering performance of kSOM that is proposed in this paper with previous SOM.