• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.394-397
• /
• 2007

본 논문에서는 문자 인식의 특징 선별 방법으로 중간점 알고리즘을 이용하는 방법을 제안한다. 영상자료의 특징들로부터 중간점을 선별하고 심볼패턴을 이용하여 필기체 문자를 인식한다. 이 방법은 사전에 많은 심볼 패턴을 학습해야 하지만 한글과 영어의 높은 인식률을 보이고 있으며, 특히 복잡한 문자들의 경우 좋은 결과를 낸다. 여기서는 중간점 알고리즘으로 입력된 데이터를 심볼 패턴과 비교하고, 심볼 영역에 의해 최적 판별 기저를 탐색한 후, 그것을 특징으로 선택한다. 또한 사전 기능과 투명도 기능을 구현하여 필기체 인식을 이용한 여러 활용 방안을 제시한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.248-251
• /
• 2016

This thesis has discussed how to recognize and convert raised letters on tire to data and collect such data. Unlike the existing recognition system, the system presented by this thesis recognizes raised letters on tire through detecting letters after converting the Kinect camera image into image data in the preprocessing stage. After then, numbers and letters are analyzed through image improvement by use of binary images, noise filter, etc. In the recognition stage, letter distinction is used and raised letters on tire are recognized 100% through correction of errors by way of the correction algorithm for tire data recognition errors. In this paper it will be the development of a method of recognizing characters and the tire technology. Although there are many ways to the already recognized characters, Tire characters requires a technique different from the more general character recognition. For this reason and to develop additional technical methods and algorithms for character recognition.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.31-39
• /
• 2003

It is often assumed that text regions in images are characterized by some distinctive or characteristic spatial frequencies. This feature is highly intuitive, and thus appealing as much. We propose a method of detecting horizontal texts in natural scene images. It is based on the use of two features that can be employed separately or in succession: the frequency of edge pixels across vertical and horizontal scan lines, and the fundamental frequency in the Fourier domain. We confirmed that the frequency features are language independent. Also addressed is the detection of quadrilaterals or approximate rectangles using Hough transform. Since texts that is meaningful to many viewers usually appear within rectangles with colors in high contrast to the background. Hence it is natural to assume the detection rectangles may be helpful for locating desired texts correctly in natural outdoor scene images.

• The Journal of the Korea Contents Association
• /
• v.14 no.2
• /
• pp.1-9
• /
• 2014

Image inpainting is the widely used technique to restore a damaged region or to fill a hole in an image. The exemplar-based technique effectively generates new texture by copying colour values of the most correlated patch in the source into the empty region of the current patch. In traditional exemplar-based synthesis, the patch correlation is computed using only the already filled pixels of the current patch. Thus, by ignoring the correlation between the hole regions of the two patches, an undesirable patch which is highly correlated with the current patch in the already filled area but considerably dissimilar in the area to be filled can be selected, which results in bad texture propagation. To avoid such problems, a new exemplar-based inpainting method using patch extrapolation is proposed. The empty part of the current patch is extrapolated beforehand, and then the complete patch is used for finding its exemplar. Experimental results show that the proposed method provides more natural synthesis results than the conventional ones.

• Annual Conference on Human and Language Technology
• /
• 1997.10a
• /
• pp.194-199
• /
• 1997

본 논문에서는 글꼴의 변화와 잡영을 흡수할 수 있도록 자소의 탐색 영역을 정의 하였으며 이 영역에 나타나는 횡모음과 종모음의 주획을 추출하는 방법을 기술하였다. 종모음 영역에서 추출한 수직획들과 횡모음 영역에서 추출한 수평획들을 각각 종모음과 횡모음의 주획이 될 수 있는 후보들로써 이들로 부터 종모음과 횡모음의 존재를 파악하는 것이 한글 유형 분류의 주된 내용이다. 그러나 다양한 글꼴에 나타나는 수평획들로부터 곧바로 횡모음의 존재를 파악하는 것은 쉬운 문제가 아니다 본 논문에서는 기존의 트리 분류기를 확장하여 복잡하고 다양한 특징을 단계별로 단순화시키고 트리 분류기의 상위 노드에서 결정된 정보와 제약 조건을 이용하여 유형을 분류하는 방법을 제안하였다. 제안된 방법은 한글 상위 빈도 1405자, 3가지 글꼴에 대하여 99.8 %의 유형 분류율을 보이고 있다.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.218-225
• /
• 2007

This paper presents a technique to detect a document skew that often occurs during document scanning. To correct a skewed document is essential for automatic processing system including character segmentation, character recognition and so on. The proposed algorithm can detect a skew angle exactly by searching characters baselines that have slant information of the document within a candidated area. To reduce processing time, we resized the image small and then established a ROI (region of interest) by morphology operations and connected components analysis. We compared our method with the existing method based on morphology operations and proved correctness and efficiency of the proposed algorithm through experiments and analysis with various kind of document images.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1121-1130
• /
• 2004

This paper proposes a method for line and word segmentation for machine-printed text blocks. To separate a text region into the unit of lines, it analyses the horizontal projection profile and performs a recursive projection profile cut method. In the word segmentation, between-word gaps are identified by a hierarchical clustering method after finding gaps in the text line by using a connected component analysis. In addition, a special symbol detection technique is applied to find two types of special symbols tying between words using their morphologic features. An experiment with 84 text regions from English and Korean documents shows that the proposed method achieves 99.92% accuracy of word segmentation, while a commercial OCR software named Armi 6.0 Pro$^{TM}$ has 97.58% accuracy.y.

• Journal of Science Education
• /
• v.47 no.2
• /
• pp.211-224
• /
• 2023

The purpose of this study is to suggest how to investigate the reliability of the assessment, which consists of items generated by automatic item generation using empirical example data. To achieve this, we analyzed the illustrative assessment data by applying the multivariate generalizability theory, which can reflect the design of responding to different items for each student and multiple error sources in the assessment score. The result of the G-study showed that, in most designs, the student effect corresponding to the true score of the classical test theory was relatively large after residual effects. In addition, in the design where the content domain was fixed, the ranking of students did not change depending on the item types or items. Similarly, in the design where the item format was fixed, the difficulty showed little variation depending on the content domains. The result of the D-study indicated that the original assessment data achieved a sufficient level of reliability. It was also found that higher reliability than the original assessment data could be obtained by reducing the number of items in the content domains of operation, geometry, and probability and statistics, or by assigning higher weights to the domains of letters and formulas, and function. The efficient measurement conditions presented in this study are limited to the illustrative assessment data. However, the method applied in this study can be utilized to determine the reliability and to find efficient measurement conditions for the various assessment situations using automatic item generation based on measurement traits.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.353-360
• /
• 2006

This paper presents a robust algorithm for segmenting a vehicle license plate area from a road image. We consider the features of license plates in three aspects : 1) edges due to the characters in the plate, 2) colors in the plate, and 3) geometric properties of the plate. In the preprocessing step, we compute the thresholds based on each feature to decide whether a pixel is inside a plate or not. A statistical approach is applied to the sample images to compute the thresholds. For a given road image, our algorithm binarizes it by using the thresholds. Then, we select three candidate regions to be a plate by searching the binary image with a moving window. The plate area is selected among the candidates with simple heuristics. This algorithm robustly detects the plate against the transformation or the difference of color intensity of the plate in the input image. Moreover, the preprocessing step requires only a small number of sample images for the statistical processing. The experimental results show that the algorithm has 97.8% of successful segmentation of the plate from 228 input images. Our prototype implementation shows average processing time of 0.676 seconds per image for a set of $1280{\times}960$ images, executed on a 3GHz Pentium4 PC with 512M byte memory.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.51-62
• /
• 2015

Of recent interests on high capacity DNA storage, DNA watermarking for DNA copyright protection, and DNA steganography for DNA secret communication are augmented, the reversible DNA watermarking is much needed both to embed the watermark without changing the functionality of organism and to perfectly recover the host DNA sequence. In this paper, we address two ways of DE based reversible DNA watermarking using noncoding DNA sequence. The reversible DNA watermarking should consider the string structure of a DNA sequence, the organism functionality, the perfect recovery, and the high embedding capacity. We convert the string sequence of four characters in noncoding region to the decimal coded values and embed the watermark bit into coded values by two ways; DE based multiple bits embedding (DE-MBE) using pairs of neighbor coded values and consecutive DE-MBE (C-DE-MBE). Two ways process the comparison searching to prevent the false start codon that produces false coding region. Experimental results verified that our ways have more high embedding capacity than conventional methods and produce no false start codon and recover perfectly the host sequence without the reference sequence. Especially C-DE-MBE can embed more high two times than DE-MBE.