• Title/Summary/Keyword: 문자열 알고리즘

Search Result 165, Processing Time 0.028 seconds

Two-Dimensional Model of Hidden Markov Lattice (이차원 은닉 마르코프 격자 모형)

  • 신봉기
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.6
    • /
    • pp.566-574
    • /
    • 2000
  • Although a numbed of variants of 2D HMM have been proposed in the literature, they are, in a word, too simple to model the variabilities of images for diverse classes of objects; they do not realize the modeling capability of the 1D HMM in 2D. Thus the author thinks they are poor substitutes for the HMM in 2D. The new model proposed in this paper is a hidden Markov lattice or, we can dare say, a 2D HMM with the causality of top-down and left-right direction. Then with the addition of a lattice constraint, the two algorithms for the evaluation of a model and the maximum likelihood estimation of model parameters are developed in the theoretical perspective. It is a more natural extension of the 1D HMM. The proposed method will provide a useful way of modeling highly variable patterns such as offline cursive characters.

  • PDF

Extraction of Text Regions from Spam-Mail Images Using Color Layers (색상레이어를 이용한 스팸메일 영상에서의 텍스트 영역 추출)

  • Kim Ji-Soo;Kim Soo-Hyung;Han Seung-Wan;Nam Taek-Yong;Son Hwa-Jeong;Oh Sung-Ryul
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.409-416
    • /
    • 2006
  • In this paper, we propose an algorithm for extracting text regions from spam-mail images using color layer. The CLTE(color layer-based text extraction) divides the input image into eight planes as color layers. It extracts connected components on the eight images, and then classifies them into text regions and non-text regions based on the component sizes. We also propose an algorithm for recovering damaged text strokes from the extracted text image. In the binary image, there are two types of damaged strokes: (1) middle strokes such as 'ㅣ' or 'ㅡ' are deleted, and (2) the first and/or last strokes such as 'ㅇ' or 'ㅁ' are filled with black pixels. An experiment with 200 spam-mail images shows that the proposed approach is more accurate than conventional methods by over 10%.

A Study on primitive polynomial in stream cipher (스트림암호에서 원시다항식에 대한 고찰)

  • Yang, Jeong-mo
    • Convergence Security Journal
    • /
    • v.18 no.4
    • /
    • pp.27-33
    • /
    • 2018
  • Stream cipher is an one-time-pad type encryption algorithm that encrypt plaintext using simple operation such as XOR with random stream of bits (or characters) as symmetric key and its security depends on the randomness of used stream. Therefore we can design more secure stream cipher algorithm by using mathematical analysis of the stream such as period, linear complexity, non-linearity, correlation-immunity, etc. The key stream in stream cipher is generated in linear feedback shift register(LFSR) having characteristic polynomial. The primitive polynomial is the characteristic polynomial which has the best security property. It is used widely not only in stream cipher but also in SEED, a block cipher using 8-degree primitive polynomial, and in Chor-Rivest(CR) cipher, a public-key cryptosystem using 24-degree primitive polynomial. In this paper we present the concept and various properties of primitive polynomials in Galois field and prove the theorem finding the number of irreducible polynomials and primitive polynomials over $F_p$ when p is larger than 2. This kind of research can be the foundation of finding primitive polynomials of higher security and developing new cipher algorithms using them.

  • PDF

Error Correction Methode Improve System using Out-of Vocabulary Rejection (미등록어 거절을 이용한 오류 보정 방법 개선 시스템)

  • Ahn, Chan-Shik;Oh, Sang-Yeob
    • Journal of Digital Convergence
    • /
    • v.10 no.8
    • /
    • pp.173-178
    • /
    • 2012
  • In the generated model for the recognition vocabulary, tri-phones which is not make preparations are produced. Therefore this model does not generate an initial estimate of parameter words, and the system can not configure the model appear as disadvantages. As a result, the sophistication of the Gaussian model is fall will degrade recognition. In this system, we propose the error correction system using out-of vocabulary rejection algorithm. When the systems are creating a vocabulary recognition model, recognition rates are improved to refuse the vocabulary which is not registered. In addition, this system is seized the lexical analysis and meaning using probability distributions, and this system deactivates the string before phoneme change was applied. System analysis determine the rate of error correction using phoneme similarity rate and reliability, system performance comparison as a result of error correction rate improve represent 2.8% by method using error patterns, fault patterns, meaning patterns.

Application and Evaluation of Object-Oriented Educational Programming Language 'Dolittle' for Computer Science Education in Secondary Education (중등 컴퓨터과학교육을 위한 객체지향형 EPL '두리틀'의 적용 및 평가)

  • Kwon, Dae-Yong;Gil, Hye-Min;Yeum, Yong-Cheul;Yoo, Seoung-Wook;Kanemune, Susumu;Kuno, Yasushi;Lee, Won-Gyu
    • The Journal of Korean Association of Computer Education
    • /
    • v.7 no.6
    • /
    • pp.1-12
    • /
    • 2004
  • Current computer education is difficult to educate basic concepts and principals of the computer science because the 7th curriculum of computer education is focused on the application of software. According to the ACM K-12 report about the computer science education model, current computer education is taking the wrong way and we should put the highly priority on the education of the fundamentals through programming languages for a better computer education oriented to the computer science. This paper introduces a new object-oriented educational programming language "Dolittle". The design principals of Dolittle are simple syntax of Korean, incremental programming, text based programming, aliasing of function, and object-oriented programming. Being applied to middle school classes, we can confirm that Dolittle is easy to learn, and gives rise to high interest and keeps interest through a course, and also is of great practical use in class for programming novice.

  • PDF

Character Segmentation and Recognition Algorithm for Various Text Region Images (다양한 문자열영상의 개별문자분리 및 인식 알고리즘)

  • Koo, Keun-Hwi;Choi, Sung-Hoo;Yun, Jong-Pil;Choi, Jong-Hyun;Kim, Sang-Woo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.4
    • /
    • pp.806-816
    • /
    • 2009
  • Character recognition system consists of four step; text localization, text segmentation, character segmentation, and recognition. The character segmentation is very important and difficult because of noise, illumination, and so on. For high recognition rates of the system, it is necessary to take good performance of character segmentation algorithm. Many algorithms for character segmentation have been developed up to now, and many people have been recently making researches in segmentation of touching or overlapping character. Most of algorithms cannot apply to the text regions of management number marked on the slab in steel image, because the text regions are irregular such as touching character by strong illumination and by trouble of nozzle in marking machine, and loss of character. It is difficult to gain high success rate in various cases. This paper describes a new algorithm of character segmentation to recognize slab management number marked on the slab in the steel image. It is very important that pre-processing step is to convert gray image to binary image without loss of character and touching character. In this binary image, non-touching characters are simply separated by using vertical projection profile. For separating touching characters, after we use combined profile to find candidate points of boundary, decide real character boundary by using method based on recognition. In recognition step, we remove noise of character images, then recognize respective character images. In this paper, the proposed algorithm is effective for character segmentation and recognition of various text regions on the slab in steel image.

High-Speed Search Mechanism based on B-Tree Index Vector for Huge Web Log Mining and Web Attack Detection (대용량 웹 로그 마이닝 및 공격탐지를 위한 B-트리 인덱스 벡터 기반 고속 검색 기법)

  • Lee, Hyung-Woo;Kim, Tae-Su
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.11
    • /
    • pp.1601-1614
    • /
    • 2008
  • The number of web service users has been increased rapidly as existing services are changed into the web-based internet applications. Therefore, it is necessary for us to use web log pre-processing technique to detect attacks on diverse web service transactions and it is also possible to extract web mining information. However, existing mechanisms did not provide efficient pre-processing procedures for a huge volume of web log data. In this paper, we proposed both a field based parsing and a high-speed log indexing mechanism based on the suggested B-tree Index Vector structure for performance enhancement. In experiments, the proposed mechanism provides an efficient web log pre-processing and search functions with a session classification. Therefore it is useful to enhance web attack detection function.

  • PDF

The Algorithm of implementation for genome analysis ecosystems : Mitochondria's case (유전체 생태계 분석을 위한 알고리즘 구현: 미토콘드리아 사례)

  • Choi, Sung-Ja;Cho, Han-Wook
    • Journal of Digital Convergence
    • /
    • v.14 no.4
    • /
    • pp.349-353
    • /
    • 2016
  • The studies on the human environment and ecosystem analysis is being actively researched. In recent years, The service of genome analysis has been offering the customized service to prevent the disease as reading an individual's genome information. The genome information by analyzing technology is being required accurate and fast analyses of ecosystem-dielectrics due to the spread of the disease, the use of genetically modified organism and the influx of exotic. In this paper the algorithm of K-Mean clustering for a new classification system was utilized. It will provide new dielectrics information as quickly and accurately for many biologists.

Efficient Evaluation of Path Expressions Using Connectivity of Nodes (노드의 연결성을 이용한 패스 표현의 효과적인 처리)

  • Lee, Tae-Gyeong
    • The KIPS Transactions:PartD
    • /
    • v.9D no.3
    • /
    • pp.337-344
    • /
    • 2002
  • Recently, there has been a lot of research on graph-type data because it can model seamless the application domains such as GIS, network, WWW, multimedia presentations etc., and domain in which the data sequence is important. In this paper, an efficient code system, called node code system, is proposed to evaluate paths of DAG in a multimedia presentation graph. The node code system assigns a unique binary string to each node of a graph. The comparison of node codes of two nodes tells the connectivity between the nodes without actual traversal of a graph. The method using the property of the node code system allows us to construct the paths between two nodes more efficiently than the method using conventional graph traversals. The algorithms to construct paths using the node code system are provided.

Structural Optimization for Improvement of Thermal Conductivity of Woven Fabric Composites (열전도도 향상을 위한 직물섬유 복합재의 최적구조 설계)

  • Kim, Myungsoo;Sung, Dae Han;Park, Young-Bin;Park, Kiwon
    • Composites Research
    • /
    • v.30 no.1
    • /
    • pp.26-34
    • /
    • 2017
  • This research presents studies on an improved method to predict the thermal conductivity of woven fabric composites, the effects of geometric structures of woven fabric composites on thermal conductivity, and structural optimization to improve the thermal conductivity using a genetic algorithm. The geometric structures of woven fabric composites were constructed numerically using the information generated on waviness, thickness, and width of fill and warp tows. Thermal conductivities of the composites were obtained using a thermal-electrical analogy. In the genetic algorithm, the chromosome string consisted of thickness and width of the fill and warp tows, and the objective function was the maximum thermal conductivity of woven fabric composites. The results confirmed that an improved method to predict the thermal conductivity was built successfully, and the inter-tow gap effect on the composite's thermal conductivity was analyzed suggesting that thermal conductivity of woven fabric composites was reduced as the gap between tows increased. For structural design, optimized structures for improving the thermal conductivity were analyzed and proposed. Generally, axial thermal conductivity of the fiber tow contributed more to thermal conductivity of woven fabric composites than transverse thermal conductivity of the tows.