• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1269-1282
• /
• 1993

In this paper, we propose to method of recognizing printed chinese characters which combine the coventional deterministic methods and the neural networks. Firstly, we extract four directional vector of strokes from chinese characters. Secondly, we make the mesh of the center of gravity in the vector and then constitute the H x8 feature matrix using black pixel lenth from each meshs. This normalized feature matrix value offer as the input of neural network for classifying into the 14 character types. And this calssified character classify again into Busu group by the Busu recognizing neural network. Finally, we recognize each characters using the distance of similarity between input characters and reference characters. The usefulness of the proposed algorithm is evaluated by experimenting with recognizing the chinese characters.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.653-668
• /
• 2012

In this study, an improved HMM based recognition model is proposed for online English and Korean handwritten characters. The pattern elements of the handwriting model are sub character strokes and ligatures. To deal with the problem of handwriting style variations, a modified Hierarchical Clustering approach is introduced to partition different writing styles into several classes. For each of the English letters and each primitive grapheme in Korean characters, one HMM that models the temporal and spatial variability of the handwriting is constructed based on each class. Then the HMMs of Korean graphemes are concatenated to form the Korean character models. The recognition of handwritten characters is implemented by a modified level building algorithm, which incorporates the Korean character combination rules within the efficient network search procedure. Due to the limitation of the HMM based method, a post-processing procedure that takes the global and structural features into account is proposed. Experiments showed that the proposed recognition system achieved a high writer independent recognition rate on unconstrained samples of both English and Korean characters. The comparison with other schemes of HMM-based recognition was also performed to evaluate the system.

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

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.575-584
• /
• 2002

On-line handwritten character recognition be achieved successful results since effectively neural networks divided the letter which is the time ordering of strokes and stroke position. But off-line handwritten character recognition is in difficulty of incomplete preprocessing because has not information of motion or time and has frequently overlap of the letter and many noise occurrence. consequently off-line handwritten character recognition needs study of various methods. This paper apply watershed algorithm to preprocessing for off-line handwritten hangul character recognition. This paper presents effective method in four steps in watershed algorithm as consider execution time of watershed algorithm and quality of result image. As apply watershed algorithm with effective structure to preprocessing, can get to the good result of image enhancement and binarization. In this experiment, this paper is estimate the previous method with this paper method for execution time and quality in image. Average execution time on the previous method is 2.16 second and Average execution time on this paper method is 1.72 second. While this paper method is remove noise effectively with overlap stroke, the previous method does not seem to be remove noise effectively with overlap stroke.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.765-774
• /
• 2002

The purpose of this paper is a design and implementation for korean character and pen-gesture recognition system in multimedia terminal, PDA and etc, which demand both a fast process and a high recognition rate. To recognize writing-types which are written by various users, the korean character recognition system uses a database which is based on the characteristic information of korean and the stroke information Which composes a phoneme, etc. In addition. it has a fast speed by the phoneme segmentation which uses the successive process or the backtracking process. The pen-gesture recognition system is performed by a matching process between the classification features extracted from an input pen-gesture and the classification features of 15 pen-gestures types defined in the gesture model. The classification feature is using the insensitive stroke information. i.e., the positional relation between two strokes. the crossing number, the direction transition, the direction vector, the number of direction code. and the distance ratio between starting and ending point in each stroke. In the experiment, we acquired a high recognition rate and a fart speed.

• The Journal of the Korea Contents Association
• /
• v.14 no.12
• /
• pp.545-554
• /
• 2014

In this paper, we propose online Chinese character learning machine with a depth camera, where a system presents a Chinese character on a screen and a user is supposed to draw the presented Chinese character by his or her hand gesture. We develop the hand tracking method and suggest the adjusted chain code to represent constituent strokes of a Chinese character. For hand tracking, a fingertip is detected and verified. The adjusted chain code is designed to contain the information on order and relative length of each constituent stroke as well as the information on the directional variation of sample points. Such information is very efficient for a real-time match process and checking incorrectly drawn parts of a stroke.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.492-495
• /
• 1999

In this paper, a research is focused on implementation of the handwritten Korean-character recognition system using a neural coprocessor for PDA application. The proposed coprocessor is composed of a digital neural network called DMNN and a RISC-based dedicated controller in order to achieve high speed as well as compactness. Two neural networks are used for recognition, one for stroke classification out of extended 11 strokes and the other for grapheme classification. Our experimental result shows that the successful recognition rate of 92.1% over 3,000 characters written by 10 persons can be obtained. Moreover, it can be improved to 95.3% when four candidates are considered. The design verification of tile proposed neural coprocessor is conducted using the ASIC emulator for further hardware implementation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.1-10
• /
• 1993

In this paper, a new method of phoneme segmentation of handwritten Korean characters using the local graph pattern is proposed. At first, thinning was performed before extracting features. End-point, inflexion-point, branch-point and cross-point were extracted as features. Using these features and the angular relations between these features, local graph pattern was made. When local graph pattern is made, the of strokes is investigated on contacting point. From this process, pattern is simplified as contacting pattern of the basic form and the contacting form we must take into account can be restricted within fixed region, 4therefore phoneme segmentation not influenced by characters form and any other contact in a single character is performed as matching this local graph pattern with base patterns searched ahead. This experiments with 540 characters have been conducted. From the result of this experiment, it is shown that phoneme segmentation is independent of characters form and other contact in a single character to obtain a correct segmentation rate of 95%, manages it efficiently to reduce the time spent in lock operation when the lock.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.657-660
• /
• 2006

자연영상이나 스팸메일 영상으로부터 텍스트 영역을 추출하고 추출한 텍스트 영역에 이진화를 수행하고 나면 가로 방향이나 세로획 방향으로 놓여 있는 "1" 그리고 "ㅡ" 에 해당하는 한글의 종성부분이 이미지 내의 잡영을 지울 때 종종 지워지는 결과를 볼 수 있다. 이렇게 지워진 획 부분을 되살리기 위한 방법으로 텍스트 Hinting 알고리즘을 제안한다. 텍스트 Hinting 알고리즘은 이진화된 이미지의 텍스트 픽셀 위치와 동일한 좌표에 해당하는 원본 이미지의 RGB 값을 추출하여 추출된 텍스트 후보 영역의 색상을 알아낸다. 추출된 텍스트 색상 레이어 이미지와 이진화된 이미지에 OR연산을 수행하게 되면 지워진 획 부분을 복원할 수 있다. 제안한 방법을 스팸 이미지에 적용한 결과 텍스트 추출결과를 획기적으로 개선할 수 있음을 보였다.

• Journal of Korean Library and Information Science Society
• /
• v.25
• /
• pp.295-338
• /
• 1996

The findings from this study are summarized as follows : 1. It is questionable to define the term "Hanja" as "the Chinese Character used independently or used along with Hangul. 2. It is found to be a problem that the validity and objectivity in the selection of Hanja are lacking. 3. It is also a problem that there is neither principles nor consistency in styling of characters. 4. The system of arrangement has problems, too. The adoption of arrangement of Hanja by its Korean pronunciation results in lots of errors and mistakes. Besides, mistaken strokes and radicals produced considerable errors in the arrangement of Hanja. 5. The omission of the abbreviated Hanja in the Code can be considered to neglect the current trend of increased use of them. 6. The issue concerned with the Japanese-origin Hanja is that several number of Hanja deemed unnecessary are included.y are included.