• Title/Summary/Keyword: handwritten

Search Result 355, Processing Time 0.022 seconds

Quantitative Evaluation of Nonlinear Shape Normalization Methods for the Recognition of Large-Set Handwrittern Characters (대용량 필기체 문자 인식을 위한 비선형 형태 정규화 방법의 정량적 평가)

  • 이성환;박정선
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.9
    • /
    • pp.84-93
    • /
    • 1993
  • Recently, several nonlinear shape normalization methods have been proposed in order to compensate for the shape distortions in handwritten characters. In this paper, we review these nonlinear shape normalization methods from the two points of view : feature projection and feature density equalization. The former makes feature projection histogram by projecting a certain feature at each point of input image into horizontal-or vertical-axis and the latter equalizes the feature densities of input image by re-sampling the feature projection histogram. A systematic comparison of these methods has been made based on the following criteria: recognition rate, processing speed, computational complexity and measure of variation. Then, we present the result of quantitative evaluation of each method based on these criteria for a large variety of handwritten Hangul syllables.

  • PDF

Developing an On-line Handwritten Word Recognition System Using Stroke Information and Post-processing Techniques (영문 대문자의 획 정보와 후처리를 이용한 온라인 필기 단어 인식기 구현)

  • 윤인구;김우생
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.19-22
    • /
    • 2000
  • This paper presents new on-line handwritten algorithm for continuous alphabet uppercase characters. The algorithm is based on the idea that alphabet uppercase character consists of at most 4 strokes. It tries to determine the maximum output for a recognition result among outputs of four recognizers which have the capacity to discriminate the character using from 1 through 4 stroke information. The recognition module has 4 neural network based recognizers, which can recognize from 1 through 4 stroke character. We also use specialized post-processing techniques for improving the recognition performance. Trained on 440 input data and choosing 390 uppercase words for a recognition test we reached a 92% recognition rate.

  • PDF

Hangul Handwritten Character On-Line Recognition using Multilayer Perceptron (다층 퍼셉트론을 이용한 한글 필기체 온라인 인식)

  • 조정욱;이수영;박철훈
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.1
    • /
    • pp.147-153
    • /
    • 1995
  • In this paper, we propose the position- and size-independent handwritten on-line Korean character recognition system using multilayer neural networks which are trained with error back-propagation learning algorithm and the features of Hanguel consonants and vowels. Starting point, end point, and three vectors from starting point to end point of each stroke of characters inputted from mouse or tablet are applied as inputs of neural networks. If double consonants and vowels are separated by single consonants and vowels, all consonants and vowels have at most four strokes. Therefore, four neural networks learn the consonants and the vowels having each number of strokes. Also, we propose the algorithm of separating the consonants and vowels and constructing a character.

  • PDF

Recognize Handwritten Urdu Script Using Kohenen Som Algorithm

  • Khan, Yunus;Nagar, Chetan
    • International Journal of Ocean System Engineering
    • /
    • v.2 no.1
    • /
    • pp.57-61
    • /
    • 2012
  • In this paper we use the Kohonen neural network based Self Organizing Map (SOM) algorithm for Urdu Character Recognition. Kohenen NN have more efficient in terms of performance as compare to other approaches. Classification is used to recognize hand written Urdu character. The number of possible unknown character is reducing by pre-classification with respect to subset of the total character set. So the proposed algorithm is attempt to group similar character. Members of pre-classified group are further analyzed using a statistical classifier for final recognition. A recognition rate of around 79.9% was achieved for the first choice and more than 98.5% for the top three choices. The result of this paper shows that the proposed Kohonen SOM algorithm yields promising output and feasible with other existing techniques.

A Methodology for Urdu Word Segmentation using Ligature and Word Probabilities

  • Khan, Yunus;Nagar, Chetan;Kaushal, Devendra S.
    • International Journal of Ocean System Engineering
    • /
    • v.2 no.1
    • /
    • pp.24-31
    • /
    • 2012
  • This paper introduce a technique for Word segmentation for the handwritten recognition of Urdu script. Word segmentation or word tokenization is a primary technique for understanding the sentences written in Urdu language. Several techniques are available for word segmentation in other languages but not much work has been done for word segmentation of Urdu Optical Character Recognition (OCR) System. A method is proposed for word segmentation in this paper. It finds the boundaries of words in a sequence of ligatures using probabilistic formulas, by utilizing the knowledge of collocation of ligatures and words in the corpus. The word identification rate using this technique is 97.10% with 66.63% unknown words identification rate.

Performance Evaluations of the Handwritten Signal Coding Techniques (필화신호 부호화 방식의 성능평가)

  • Ho, Kwang-Chun;Won, Young-Joo;Ryoo, Keun-Ho;Lee, Jong-Su
    • Proceedings of the KIEE Conference
    • /
    • 1989.07a
    • /
    • pp.701-706
    • /
    • 1989
  • This study has been aimed to analize and evaluate the performance of the coding algorithms for the handwritten signals such as the telewriting systems. Zone Coding and Differential Chain Coding algorithms have been analized and evaluated on the basis of time and space complexities. According to the simulation results, Zone Coding algorithm has shown better decoding performance from the viewpoint of the Root Mean Square decoding errors, but Differential Chain Coding algorithm has shown better data compression ratio and flexibility of its usage, along with its moderate decoding RMS errors.

  • PDF

The Main Character and Evaluation of China's New Electronic Signature Legislation (중국 전자서명법의 주요내용 및 평가와 전망)

  • Han, Sang-Hyun
    • The Journal of Information Technology
    • /
    • v.9 no.3
    • /
    • pp.1-14
    • /
    • 2006
  • China has recently (28 August 2004) adopted a new act legalizing the electronic signature. This new act provides electronic signatures with the same legal status as handwritten signatures, and states that on-line certification providers will have to be created in order to ensure the security of on-line operations made using said signatures. This new act is intended to increase Chinese electronic business, and thus to raise the revenue China can expect from said business. And the law grants electronic signatures the same legal effect as handwritten signatures and seals in business transactions, and sets up the market access system for online certification providers to ensure the security of e-commerce. As Internet trade requires a reliable third party to identify the signers, the credibility of online certifying organizations is significant for the transaction security. So, considering the weakness of China's social credibility system, the law regulates that the online signatures certification providers should be approved and administered by governments.

  • PDF

A study on the modified hough transform for hangul feature extraction using generalized sampling rule (한글 특징점 추출을 위한 일반화된 표본화 알고리즘을 이용한 수정된 Hough Transform에 관한 연구)

  • 구하성;고형화
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.9
    • /
    • pp.142-149
    • /
    • 1994
  • Hangul is expressed by the basic elements, twenty-four characters. Because these characters are composed of a circle and lines, Hough transform(HT), which has a powerful performance on the noise in extracting lines, is introduced. Many difficulties often occur when the original HT is used to extract strokes and it's direction, position and length from handwritten Hangul characters. Original HT has eight direction selected as samples in the transformed image should be calculated for these eight directions. In this paper, the generalized sampling rule is suggested. According to the rule, those directions which are possible to a line are the only thing to be calculated. The experoment result turned out to be higher than the method that Chen suggested in sampling rate. Anogher experiment result is done on the 1800 handwritten Hangul characters that 10 persons wrote. By feature extracting the oritinal HT and sampling HT. And as a result of six type classification, the suggested method came out higher than original HT.

  • PDF

Feature Combination and Selection Using Genetic Algorithm for Character Recognition (유전 알고리즘을 이용한 특징 결합과 선택)

  • Lee Jin-Seon
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.5
    • /
    • pp.152-158
    • /
    • 2005
  • By using a combination of different feature sets extracted from input character patterns, we can improve the character recognition system performance. To reduce the dimensionality of the combined feature vector, we conduct the feature selection. This paper proposes a general framework for the feature combination and selection for character recognition problems. It also presents a specific design for the handwritten numeral recognition. Tn the design, DDD and AGD feature sets are extracted from handwritten numeral patterns, and a genetic algorithm is used for the feature selection. Experimental result showed a significant accuracy improvement by about 0.7% for the CENPARMI handwrittennumeral database.

  • PDF

Shape Analysis and Representation of Handwritten Hangul Characters (필기 한글 문자의 모양 분석과 표현)

  • Hong, Ki-Cheon;Oh, Il-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1579-1586
    • /
    • 2000
  • This paper propose a method of shape analysis and representation for the handwritten Hangul character patterns. Each of the connected components composing a Hangul character is decomposed into many parts, and skeletons are extracted from the decomposed parts. Using the results, we represent the shape of Hangul characters using the attributed graph representation. A node of the attributed graph represents a part and an edge represents their relationships and they store valuable informations of the pattern shapes.

  • PDF