• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.400-402
• /
• 2001

오프라인 필기체 한글 문자인식에서 대부분의 연구들은 영상획득 장비로부터 얻어진 이진영상(Binary image)을 바탕으로 이루어진다. 이 과정 중 영상에 잡음이나 영상패턴의 훼손을 가져오는 경우가 많다. 획이 끊기거나 영상 내 홀(holes)이 발생한 경우 인식에 많은 질적인 문제를 가져온다. 오프라인 필기체 한글 문자인식 과정 중 영상 내 골격을 추출하는 연구는 아직도 많은 난제를 가지고 있다. 또한 골격추출과정은 인식에 많은 영향을 준다. 잡영이 포함된 영상은 잘못된 골격선 추출에 기인한다. 본 논문에 사용된 Binary Watershed Algorithm은 잡영이 포함된 영상개선에 사용하였고, 이 Algorithm은 많은 다양성을 가지고 있어 여러 분야의 응용에 사용되어지고 있다. 본 논문은 이러한 잡영이 포함된 영상의 개선을 통해 기존의 Morphological 세선화 방법과 Zang-Suen 세선화 방법을 통해 골격선 추출을 평가하였다. 여기에는 아직도 자소의 교차 획에 있어서 효과적인 골격선을 추출하는 문제를 가지고 있다.

• Annual Conference on Human and Language Technology
• /
• 1994.11a
• /
• pp.195-200
• /
• 1994

본 논문에서는 글자 구분선 없이 자유로이 쓰여진 필기체 한글의 인식 방안을 보인다. 즐단위의 한글 입력 영상에서 글자의 골격선을 추출하는 새로운 방법과 골격선들 간의 접촉점과 끝점을 그래프의 노드로 표현하고, 획은 그래프의 가지로 표현하는 방안을 보인다. 한글의 글자 구성 원리는 모음을 중심으로 모아쓰므로, 그래프로 표현된 즐단위의 한글에서 모음의 시작위치 및 속성을 가지는 로드로부터 한글의 모음을 가장 먼저 유도하여 인식하고, 우측 글자 및 자소끼리의 접촉을 분리하여 초성 자음 및 종성 자음을 인식하여, 좌에서 우의 방향으로 한 문자씩 인식해 나간다. 본 논문에서의 자유로이 필기된 한글의 인식 실험은 우리나라의 주소 50개를 서로 다른 25인이 필기한 영상 데이터를 사용하였고 한글 문자의 인식율은 89%이다.

• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.660-667
• /
• 2000

In this paper, a word segmentation method for handwritten Korean text line images is proposed. The method uses gap information to segment words in line images, where the gap is defined as a white run obtained after vertical projection of line images. Each gap is assigned to one of inter-word gap and inter-character gap based on gap distance. We take up three distance measures which have been proposed for the word segmentation of handwritten English text line images. Then we test three clustering techniques to detect the best combination of gap metrics and classification techniques for Korean text line images. The experiment has been done with 305 text line images extracted manually from live mail pieces. The experimental result demonstrates the superiority of BB(Bounding Box) distance measure and sequential clustering approach, in which the cumulative word segmentation accuracy up to the third hypothesis is 88.52%. Given a line image, the processing time is about 0.05 second.

• Journal of The Korean Association of Information Education
• /
• v.1 no.1
• /
• pp.28-37
• /
• 1997

This paper presents a new neural network based on fuzzy set and its application to invariant character recognition. The fuzzy neural network consists of five layers. The results of simulation show that the network can recognize characters in the case of distortion, translation, rotation and different sizes of handwritten characters and even with noise(8${\sim}$30%)). Translation, distortion, different sizes and noise are achieved by layer L2 and rotation invariant by layer L5. The network can recognize 108 examples of training with 100% recognition rate when they are shifted in eight directions by 1 pixel and 2 pixels. Also, the network can recognize all the distorted characters with 100% recognition rate. The simulations show that the test patterns cover a ${\pm}20^{\circ}$ range of rotation correctly. The proposed network can also recall correctly all the learned characters with 100% recognition rate. The proposed network is simple and its learning and recall speeds are very fast. This network also works for the segmentation and recognition of handwritten characters.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.54-64
• /
• 1999

This paper proposes an efficient handwritten English word recognition scheme which can be applied practical applications. To effectively use the lexicon which is available in most handwriting related applications, the lexicon entries are introduced in the early stage of the recognition. Dynamic programming is used for matching between over-segmented character segments and letters in the lexicon entries. Character segmentation statistics which can be obtained while the training is being performed are used to adjust the matching window size. Also, the matching results between the character segments and the letters in the lexicon entries are cached to avoid repeat of the same computation. In order to verify the effectiveness of the proposed methods, several experiments were performed using thousands of word images with various writing styles. The results show that the proposed methods significantly improve the matching speed as well as the accuracy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.141-146
• /
• 2014

This paper describes the implementation and algorithm of handwritten character recognition using mobile touch screen. The system is consisted of PXA320 processor, capacitive touch panel and QT4 interface. The proposed algorithm extracts pattern characteristics with straight, left circle, right circle on the inputting character. The definition of character is determined by 3-way tree searching method. The performance of proposed algorithm is verified using alphabet character. It is suitable to apply the mobile touch screen because of simple algorithm.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.481-490
• /
• 2002

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic information has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing for off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods that effectively extracts skeleton through conditional test mask considering routing time and quality of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.904-911
• /
• 2003

In this paper, we propose an effective method for the distinction between machine-printed and handwritten Korean address images. It is important to know whether an input image is handwritten or machine-printed, because methods for handwritten image are quite different from those of machine-printed image in such applications as address reading, form processing, FAX routing, and so on. Our method consists of three blocks: valid connected components grouping, feature extraction, and classification. Features related to width and position of groups of valid connected components are used for the classification based on a neural network. The experiment done with live Korean address images has demonstrated the superiority of the proposed method. The correct classification rate for 3,147 testing images was about 98.85%.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.401-408
• /
• 1997

Human gets almist all of his knoweledge from the recognition and the accumulation of input patterns,image or sound,the he gets theough his eyes and through his ears.Among these means,his chracter recognition,an ability that allows him to recognize characters and understand their meanings through visual information, is now applied to a pattern recognition system using neural network in computer. Recurrent neural network is one of those models that reuse the output value in neural network learning.Recently many studies try to apply this recurrent neural network to the classification of static patterns like off-line handwritten characters. But most of their efforts are not so drrdtive until now.This stusy suggests a new type of recurrent neural network for an deedctive classification of the static patterns such as off-line handwritten chracters.Using the new J-E(Jordan-Elman)neural network model that enlarges and combines Jordan Model and Elman Model,this new type is better than those of before in recobnizing the static patterms such as figures and handwritten-characters.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.1002-1013
• /
• 1996

The segmentation of characters is an important step in the automatic recognition of handwritten text. This paper proposes the segmenting method of off-line handwritten Hangul. The suggested approach is based on the structural characteristics of Hangul. The first step extracts the local features. connected component and strokes from the imput word. In the second step we identify the class of strokes. The third segmenting step specifies WRC(White Run Column) before consonant or horizontal vowel. If the segment is longer than threshold, the system estimates segmenting columns using the consonant-vowel information and column features, and then finds a cornered boundary along the strokes within the estimated segmenting columns.