• Title/Summary/Keyword: Handwriting Recognition

Search Result 73, Processing Time 0.029 seconds

Character Segmentation in Chinese Handwritten Text Based on Gap and Character Construction Estimation

  • Zhang, Cheng Dong;Lee, Guee-Sang
    • International Journal of Contents
    • /
    • v.8 no.1
    • /
    • pp.39-46
    • /
    • 2012
  • Character segmentation is a preprocessing step in many offline handwriting recognition systems. In this paper, Chinese characters are categorized into seven different structures. In each structure, the character size with the range of variations is estimated considering typical handwritten samples. The component removal and merge criteria are presented to remove punctuation symbols or to merge small components which are part of a character. Finally, the criteria for segmenting the adjacent characters concerning each other or overlapped are proposed.

Analysis of Elm Topology Optimization Criteria for Handwriting Recognition (필기 데이터 인식을 위한 HMM 구조 최적화 기준에 대한 분석)

  • 박미나;하진영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.571-573
    • /
    • 2002
  • 음성인식과 온라인 필기인식에서 우수한 성능을 보이는 은닉 마르코프(HMM)의 HMM의 구조는 휴리스틱 한 방법에 의해 결정되는 것이 일반적이기 때문에 최적의 모델을 선택하는데 어려움이 있다. 이에 본 논문에서는 HMM의 구조를 체계적인 방법으로 정함과 동시에 변별력의 단점을 개선 할 수 있는 방법으로 Anti-likelihood를 이용한 모델간의 변별력을 살펴보고 최적의 모델 선택 기준인 BIC와의 결합하여, 체계적이고 효율적인 최적 모델 선택이 가능한 방법론에 대해 연구하고 필기데이터에 대해 검증한 결과, 기존의 방법보다 파라미터의 수는 감소되고 인식률이 향상됨을 알 수 있다.

  • PDF

Recognition of Handwriting Chinese Characters Based on DP matching (DP 정합을 이용한 필기체 한자 인식)

  • 전상엽;권희용
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2004.05a
    • /
    • pp.285-288
    • /
    • 2004
  • 온라인 필기체 한자는 동일인의 동일 문자조차도 회수, 획순 및 형태의 변화가 다양할 뿐만 아니라 인식 대상이 방대하여 인식이 매우 어렵다. 또한 한자는 기본 자소의 조합에 의한 글자가 아닌 각각의 글자가 독립적으로 이루어져 있어 연속된 획들 간의 관련도를 파악하기 어렵고 획수도 1획에서 28획까지 다양하게 분포를 한다. 따라서 본 연구에서는 대분류 단계로 시작획 비교를 하고 이어진 세분류 단계에서 문자의 특징으로 방향코드와 특이점을 추출해내고 획수를 고려하여 DP 정합을 하는 2단계 인식 시스템을 제안하였다. 이로써 최적의 속도로 입력한 문자를 찾아낼 수 있도록 하였다.

  • PDF

On-line Handwriting Chinese Character Recognition for PDA Using a Unit Reconstruction Method (유닛 재구성 방법을 이용한 PDA용 온라인 필기체 한자 인식)

  • Chin, Won;Kim, Ki-Doo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.1
    • /
    • pp.97-107
    • /
    • 2002
  • In this paper, we propose the realization of on-line handwritten Chinese character recognition for mobile personal digital assistants (PDA). We focus on the development of an algorithm having a high recognition performance under the restriction that PDA requires small memory storage and less computational complexity in comparison with PC. Therefore, we use index matching method having computational advantage for fast recognition and we suggest a unit reconstruction method to minimize the memory size to store the character models and to accomodate the various changes in stroke order and stroke number of each person in handwriting Chinese characters. We set up standard model consisting of 1800 characters using a set of pre-defined units. Input data are measured by similarity among candidate characters selected on the basis of stroke numbers and region features after preprocessing and feature extracting. We consider 1800 Chinese characters adopted in the middle and high school in Korea. We take character sets of five person, written in printed style, irrespective of stroke ordering and stroke numbers. As experimental results, we obtained an average recognition time of 0.16 second per character and the successful recognition rate of 94.3% with MIPS R4000 CPU in PDA.

Recognizing Hand Digit Gestures Using Stochastic Models

  • Sin, Bong-Kee
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.6
    • /
    • pp.807-815
    • /
    • 2008
  • A simple efficient method of spotting and recognizing hand gestures in video is presented using a network of hidden Markov models and dynamic programming search algorithm. The description starts from designing a set of isolated trajectory models which are stochastic and robust enough to characterize highly variable patterns like human motion, handwriting, and speech. Those models are interconnected to form a single big network termed a spotting network or a spotter that models a continuous stream of gestures and non-gestures as well. The inference over the model is based on dynamic programming. The proposed model is highly efficient and can readily be extended to a variety of recurrent pattern recognition tasks. The test result without any engineering has shown the potential for practical application. At the end of the paper we add some related experimental result that has been obtained using a different model - dynamic Bayesian network - which is also a type of stochastic model.

  • PDF

Staff-line and Measure Detection using a Convolutional Neural Network for Handwritten Optical Music Recognition (손사보 악보의 광학음악인식을 위한 CNN 기반의 보표 및 마디 인식)

  • Park, Jong-Won;Kim, Dong-Sam;Kim, Jun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.7
    • /
    • pp.1098-1101
    • /
    • 2022
  • With the development of computer music notation programs, when drawing sheet music, it is often drawn using a computer. However, there are still many use of hand-written notations for educational purposes or to quickly draw sheet music such as listening and dictating. In previous studies, OMR focused on recognizing the printed music sheet made by music notation program. the result of handwritten OMR with camera is poor because different people have different writing methods, and lens distortion. In this study, as a pre-processing process for recognizing handwritten music sheet, we propose a method for recognizing a staff using linear regression and a method for recognizing a bar using CNN. F1 scores of staff recognition and barline detection are 99.09% and 95.48%, respectively. This methodologies are expected to contribute to improving the accuracy of handwriting.

A Study on the Hangul Recognition Using Hough Transform and Subgraph Pattern (Hough Transform과 부분 그래프 패턴을 이용한 한글 인식에 관한 연구)

  • 구하성;박길철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.3 no.1
    • /
    • pp.185-196
    • /
    • 1999
  • In this dissertation, a new off-line recognition system is proposed using a subgraph pattern, neural network. After thinning is applied to input characters, balance having a noise elimination function on location is performed. Then as the first step for recognition procedure, circular elements are extracted and recognized. From the subblock HT, space feature points such as endpoint, flex point, bridge point are extracted and a subgraph pattern is formed observing the relations among them. A region where vowel can exist is allocated and a candidate point of the vowel is extracted. Then, using the subgraph pattern dictionary, a vowel is recognized. A same method is applied to extract horizontal vowels and the vowel is recognized through a simple structural analysis. For verification of recognition subgraph in this paper, experiments are done with the most frequently used Myngjo font, Gothic font for printed characters and handwritten characters. In case of Gothic font, character recognition rate was 98.9%. For Myngjo font characters, the recognition rate was 98.2%. For handwritten characters, the recognition rate was 92.5%. The total recognition rate was 94.8% with mixed handwriting and printing characters for multi-font recognition.

  • PDF

An Approach for Efficient Handwritten Word Recognition Using Dynamic Programming Matching (동적 프로그래밍 정합을 이용한 효율적인 필기 단어 인식 방법)

  • 김경환
    • 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.

  • PDF

Efficient Mobile Writing System with Korean Input Interface Based on Face Recognition

  • Kim, Jong-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.6
    • /
    • pp.49-56
    • /
    • 2020
  • The virtual Korean keyboard system is a method of inputting characters by touching a fixed position. This system is very inconvenient for people who have difficulty moving their fingers. To alleviate this problem, this paper proposes an efficient framework that enables keyboard input and handwriting through video and user motion obtained through the RGB camera of the mobile device. To develop this system, we use face recognition to calculate control coordinates from the input video, and develop an interface that can input and combine Hangul using this coordinate value. The control position calculated based on face recognition acts as a pointer to select and transfer the letters on the keyboard, and finally combines the transmitted letters to integrate them to perform the Hangul keyboard function. The result of this paper is an efficient writing system that utilizes face recognition technology, and using this system is expected to improve the communication and special education environment for people with physical disabilities as well as the general public.

Neural Network-based Real-time End Point Detection Specialized for Accelerometer Signal (신경망을 이용한 실시간 가속도 신호 끝점 검출 방법)

  • Lim, Jong-Gwan;Kwon, Dong-Soo
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.178-185
    • /
    • 2009
  • A signal processing algorithm is proposed for end point detection which is used commonly in accelerometers-based pattern recognition problem. In the conventional method, end points are detected by manual manipulation with an additive button or algorithm based on statistical computation and highpass filtering to cause critical time delay and difficulty for parameters optimization. As an solution, we propose a focused Time Lagged Feedforward Network(TLFN) with respect to a differential signal of acceleration, which is widely applied for time series forecasting. The simple experiment is conducted with handwriting and the detection performance and response characteristic of the proposed algorithm is tested and analyzed.

  • PDF