• Title/Summary/Keyword: Hangul matching

Search Result 27, Processing Time 0.018 seconds

An Image-based Word Matching Method for Large volume Printed Hangul Document Retrieval (대용량 인쇄 한글 문서 검색을 위한 영상 기반 단어 매칭 방법)

  • 진영범;오일석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10b
    • /
    • pp.461-463
    • /
    • 2000
  • 기계 인쇄된 문서 영상에서 주제어를 탐색하는 문제는 여러 응용 분야에 필수적인 핵심 기술이지만 수작업 또는 OCR 소프트웨어를 이용하여 텍스트로 변환하는 방법은 많은 비용 때문에 한계를 가지고 있다. 요즘 영상 형태로 원문을 저장하는 경우가 많으므로 본 논문은 영상-기반 매칭을 통한 검색 방법을 채택하였다. 문자 또는 단어 매칭에서 가장 중요한 요소가 특징인데 본 논문에서는 디지털도서관과 같이 매칭 대상 단어가 수천만∼수십억에 달하는 대용량 한글 문서 검색에 이용될 수 있도록 비교적 간단히 추출할 수 있고 차원수 조절이 용이한 4방향 프로파일 특징을 이용하는 빠른 검색 방법을 제안한다. 실험결과 8-차원 정도의 간단한 특징으로도 의미 있는 검색 성능을 얻을 수 있음을 보였다.

  • PDF

A Fast Recognition System of Gothic-Hangul using the Contour Tracing (윤곽선 추적에 의한 고딕체 한글의 신속인식에 관한 연구)

  • 정주성;김춘석;박충규
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.8
    • /
    • pp.579-587
    • /
    • 1988
  • Conventional methods of automatic recognition of Korean characters consist of the thinning processing, the segmentation of connected fundamental phonemes and the recognition of each fundamental character. These methods, however require the thinning processing which is complex and time consuming. Also several noise components make worse effects on the recognition of characters than in the case of no thinning. This paper describes the extraction method of the feature components of Korean fundamental characters of the Gothic Korean letter without the thinning. We regard line-components of the contour which describes the character's external boundary as the feature-components. The line-component includes the directional code, the length and the start point in the image. Each fundamental character is represented by the string of directional codes. Therefore the recognition process is only the string pattern matching. We use the Gothic-hangul in the experiment. The ecognition rate is 92%.

Implementation of the Automatic Segmentation and Labeling System (자동 음성분할 및 레이블링 시스템의 구현)

  • Sung, Jong-Mo;Kim, Hyung-Soon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.5
    • /
    • pp.50-59
    • /
    • 1997
  • In this paper, we implement an automatic speech segmentation and labeling system which marks phone boundaries automatically for constructing the Korean speech database. We specify and implement the system based on conventional speech segmentation and labeling techniques, and also develop the graphic user interface(GUI) on Hangul $Motif^{TM}$ environment for the users to examine the automatic alignment boundaries and to refine them easily. The developed system is applied to 16kHz sampled speech, and the labeling unit is composed of 46 phoneme-like units(PLUs) and silence. The system uses both of the phonetic and orthographic transcription as input methods of linguistic information. For pattern-matching method, hidden Markov models(HMM) is employed. Each phoneme model is trained using the manually segmented 445 phonetically balanced word (PBW) database. In order to evaluate the performance of the system, we test it using another database consisting of sentence-type speech. According to our experiment, 74.7% of phoneme boundaries are within 20ms of the true boundary and 92.8% are within 40ms.

  • PDF

A Study on Equation Recognition Using Tree Structure (트리 구조를 이용한 수식 인식 연구)

  • Park, Byung-Joon;Kim, Hyun-Sik;Kim, Wan-Tae
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.4
    • /
    • pp.340-345
    • /
    • 2018
  • The Compared to general sentences, the Equation uses a complex structure and various characters and symbols, so that it is not possible to input all the character sets by simply inputting a keyboard. Therefore, the editor is implemented in a text editor such as Hangul or Word. In order to express the Equation properly, it is necessary to have the learner information which can be meaningful to interpret the syntax. Even if a character is input, it can be represented by another expression depending on the relationship between the size and the position. In other words, the form of the expression is expressed as a tree model considering the relationship between characters and symbols such as the position and size to be expressed. As a field of character recognition application, a technique of recognizing characters or symbols(code) has been widely known, but a method of inputting and interpreting a Equation requires a more complicated analysis process than a general text. In this paper, we have implemented a Equation recognizer that recognizes characters in expressions and quickly analyzes the position and size of expressions.

Design of Postal Address File for Address Interpretation and Retrieval (주소해석 및 검색을 위한 우편주소파일 설계)

  • Chang, Tai-Woo;Kim, Ho-Yon;Lim, Kil-Taek
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.4
    • /
    • pp.74-88
    • /
    • 2007
  • In order to automate the process of mail sorting by delivery sequence, it is necessary to prepare a postal address database and to interpret written addresses on the mail-pieces with the database and OCR technology. The address database is a critical factor of automation and informatization of postal service since it could be used not only in address recognition but also in various mail processing. In this study, we design the schema of postal address database, design the postal address file based on it and explain the method of address interpretation and retrieval using it. We analyze infonnation requirements for transformation of postal address into the standardized format and consider them in the process of design. The postal address file can be used by address matching or retrieval system as well as by Hangul address recognition system for automation of delivery sequence mail-sorting.

  • PDF

Meter Numeric Character Recognition Using Illumination Normalization and Hybrid Classifier (조명 정규화 및 하이브리드 분류기를 이용한 계량기 숫자 인식)

  • Oh, Hangul;Cho, Seongwon;Chung, Sun-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.1
    • /
    • pp.71-77
    • /
    • 2014
  • In this paper, we propose an improved numeric character recognition method which can recognize numeric characters well under low-illuminated and shade-illuminated environment. The LN(Local Normalization) preprocessing method is used in order to enhance low-illuminated and shade-illuminated image quality. The reading area is detected using line segment information extracted from the illumination-normalized meter images, and then the three-phase procedures are performed for segmentation of numeric characters in the reading area. Finally, an efficient hybrid classifier is used to classify the segmented numeric characters. The proposed numeric character classifier is a combination of multi-layered feedforward neural network and template matching module. Robust heuristic rules are applied to classify the numeric characters. Experiments using meter image database were conducted. Meter image database was made using various kinds of meters under low-illuminated and shade-illuminated environment. The experimental results indicates the superiority of the proposed numeric character recognition method.

Design and Implementation of Web-Based Dictionary of Computing for Efficient Search Interface (효율적인 검색 인터페이스를 위한 웹 기반 컴퓨터 용어사전의 설계 및 구현)

  • Hwang, Byeong-Yeon;Park, Seong-Cheol
    • The KIPS Transactions:PartD
    • /
    • v.9D no.3
    • /
    • pp.457-466
    • /
    • 2002
  • In this paper, we designed and implemented a web-based dictionary of computing which keeps the data up-to-date. This dictionary shows the English information based on the FOLDOC (Free On-Line Dictionary Of Computing) dictionary file at the beginning of searching, and then one or more users can translate the information into Korean. This function is the new one only this dictionary has. Also, we can easily find any words we want to took up, even if we don't know the spelling completely, because the dictionary has various searching interfaces (searching for the words starting with inputted characters, searching for the words including inputted characters in the description, etc.) using a SQL Server DBMS and SQL. The performance test for CPU load factor shows that the server can support at least 1780 users at the same time.