• Title/Summary/Keyword: Printed Korean characters recognition

Search Result 44, Processing Time 0.024 seconds

A study on Machine-Printed Korean Character Recognition by the Character Composition form Information of the Graphemes and Graphemes using the Connection Ingredient and by the Vertical Detection Information in the Weight Center of Graphemes

  • Lee, Kyong-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.3
    • /
    • pp.97-105
    • /
    • 2017
  • This study is the realization study recognizing the Korean gothic printing letter. This study defined the new grapheme by using the connection ingredient and had the graphemes recognized by means of the feature dots of the isolated dot, end dot, 2-line gathering dots, more than 3 lines gathering dots, and classified the characters by means of the arrangement information of the graphemes and the layers that the graphemes form within the characters, and made the character database for the recognition by using them. The layers and the arrangement information of the graphemes consisting in the characters were presumed by using the weight center position information of the graphemes extracted from the characters to recognize and the information of the graphemes obtained by vertically exploring from the weight center of each grapheme, and it recognized the characters by judging and comparing the character groups of the database by means of the information which was secured this way. 350 characters were used for the character recognition test and about 97% recognition result was obtained by recognizing 338 characters.

Hangul Character Recognition Using Fuzzy Reasoning:Hangul Character Type Classification by Maximum Run Length Projenction (퍼지추론을 이용한 한글 문자 인식:최대 길이 투영에 의한 한글 문자 유형 분류)

  • 이근수;최형일
    • Korean Journal of Cognitive Science
    • /
    • v.3 no.2
    • /
    • pp.249-270
    • /
    • 1992
  • The purpose of this paper is to classify the types of input characters,printed Hangul characters,using Maximum Run Length Projection(MRLP)that is used to extract features of input character.Because the number of Hangul characters is large and its structure is complex,there exists close similarities among characters.This paper,therefore,tried to increment the type classification rate using fuzzy resoning.The Maximum Run Length Projection is very immune to noise,and also useful to extracting the demanding information efficiently.In a test case with the most frequently use 917 printed Hangul characters,it achieved 98.58%correct classification rate.

Adaptive Character Segmentation to Improve Text Recognition Accuracy on Mobile Phones (모바일 시스템에서 텍스트 인식 위한 적응적 문자 분할)

  • Kim, Jeong Sik;Yang, Hyung Jeong;Kim, Soo Hyung;Lee, Guee Sang;Do, Luu Ngoc;Kim, Sun Hee
    • Smart Media Journal
    • /
    • v.1 no.4
    • /
    • pp.59-71
    • /
    • 2012
  • Since mobile phones are used as common communication devices, their applications are increasingly important to human's life. Using smart-phones camera to collect daily life environment's information is one of targets for many applications such as text recognition, object recognition or context awareness. Studies have been conducted to provide important information through the recognition of texts, which are artificially or naturally included in images and movies acquired from mobile phones. In this study, a character segmentation method that improves character-recognition accuracy in images obtained from mobile phone cameras is proposed. The proposed method first classifies texts in a given image to printed letters and handwritten letters since segmentation approaches for them are different. For printed letters, rough segmentation process is conducted, then the segmented regions are integrated, deleted, and re-segmented. Segmentation for the handwritten letters is performed after skews are corrected and the characters are classified by integrating them. The experimental result shows our method achieves a successful performance for both printed and handwritten letters as 95.9% and 84.7%, respectively.

  • PDF

A Hierarchical Neural Network for Printed Hangul Character Recognition (인쇄체 한글문자 인식을 위한 계층적 신경망)

  • 조성배;김진형
    • Korean Journal of Cognitive Science
    • /
    • v.2 no.1
    • /
    • pp.33-50
    • /
    • 1990
  • Recently, neural networks have been proposed as computaional models for hard prlblems that the brain appears to solve easily. This paper proposes a hierarchical network which practically recognizes printed Hangul characters based on the various psychological stueies. This system is composed of a type classification netwotk and six recognition networks. The former clessifier input character images into one of the six thper by their overall sturcture, and the latter further classify them into character code. Extperiments with most frequently used 990 printed hangul characters conform the superiority of the propsed system. After all, neural nework approach turns out to be very reasonable through a comparison with statistical classifier and an analysis of mis-classification and generalization capability.

Recognition of Raised Characters for Automatic Classification of Rubber Tires (고무타이어 자동분류를 위한 돌출문자 인식)

  • 함영국;강민석;정홍규;박래홍;박귀태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.77-87
    • /
    • 1994
  • This paper presents recognition of raised alphanumeric markings on rubber tires for their automatic classification. Raised alphanumeric markings on rubber tires have different characteristics as compared to those of printed characters. In the preprocessing step, we first determine the rotation angle using the Hough transform and align markings, then separate each character using vertical and horizontal projections. In the recognition step, we use several features such as width of a character, cross point, partial projection, and distance feature to recognize characters hierarchically. The computer simulation result shows that the proposed system can be successfully applied to the industrial automation of rubber tires classification.

  • PDF

A Study on Classification into Hangeul and Hanja in Text Area of Printed Document (인쇄체 문서의 문자영역에서 한글과 한자의 구별에 관한 연구)

  • 심상원;이성범;남궁재찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.6
    • /
    • pp.802-814
    • /
    • 1993
  • This paper propose an algorithm for preprocessing of character recognition, which classify characters into Hangeul and Hanja. In this study, we use the 9 structural chacteristics of Hanja which isn't affected by deformation of size and style of characters and rates based on character size to classify characters. Firstly, we process the blocking to segment each characters. Secondly, on this segmented characters, we apply algorithm proposed in this paper to classify Hangeul and Hanja. Finally, we classify characters into Hangeul and Hanja, respectively. An experiment with 2350 Hangeul and 4888 Hanja printed Gothic and Mincho style of KS-C 5601 are carried out. We experiment on typeface sample book, newspapers, academic society's papers, magazines, textbooks and documents written out word processor to obtain the classifying rates of 98.8%, 92%, 96%, 98% and 98%, respectively.

  • PDF

An recognition of printed chinese character using neural network (신경망을 이용한 인쇄체 한자의 인식)

  • 이성범;오종욱;남궁재찬
    • 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.

  • PDF

High Speed Character Recognition by Multiprocessor System (멀티 프로세서 시스템에 의한 고속 문자인식)

  • 최동혁;류성원;최성남;김학수;이용균;박규태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.2
    • /
    • pp.8-18
    • /
    • 1993
  • A multi-font, multi-size and high speed character recognition system is designed. The design principles are simpilcity of algorithm, adaptibility, learnability, hierachical data processing and attention by feed back. For the multi-size character recognition, the extracted character images are normalized. A hierachical classifier classifies the feature vectors. Feature is extracted by applying the directional receptive field after the directional dege filter processing. The hierachical classifier is consist of two pre-classifiers and one decision making classifier. The effect of two pre-classifiers is prediction to the final decision making classifier. With the pre-classifiers, the time to compute the distance of the final classifier is reduced. Recognition rate is 95% for the three documents printed in three kinds of fonts, total 1,700 characters. For high speed implemention, a multiprocessor system with the ring structure of four transputers is implemented, and the recognition speed of 30 characters per second is aquired.

  • PDF

Recognition of Printed Hangeul Characters Based on the Stable Structure Information and Neural Networks (안정된 구조정보와 신경망을 기반으로 한 인쇄체 한글 문자 인식)

  • 장희돈;남궁재찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.11
    • /
    • pp.2276-2290
    • /
    • 1994
  • In this paper, we propose an algorithm for character recognition using the subdivided type and the stable structure information. The subdivided type of character is acquired from the stable structure information of character which is extracted from an input character. Firstly, the character is obtained from a scanner and classified into on of 6 types by using directional density vector. And then, the stable structure information is extracted from each character and the character is subdivided into on of 26 types. Finally, the classified character is recognized by using neural network which is inputted the directional density vector equivalent to JASO area or recognized direct. Aa a result of experiment with KS C 5601 2350 printed Hangeul characters, we obtain the recognition rate of 94%.

  • PDF