• Title/Summary/Keyword: string pattern

Search Result 112, Processing Time 0.025 seconds

Performance Comparison on Pattern Recognition Between DNA Coding Method and GA Coding Method (DNA 코딩방법과 GA 코딩방법의 패턴인식 성능 비교에 관한 연구)

  • 백동화;한승수
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.12a
    • /
    • pp.383-386
    • /
    • 2002
  • In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.

An Index Data Structure for String Search in External Memory (외부 메모리에서 문자열을 효율적으로 탐색하기 위한 인덱스 자료 구조)

  • Na, Joong-Chae;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.598-607
    • /
    • 2005
  • We propose a new external-memory index data structure, the Suffix B-tree. The Suffix B-tree is a B-tree in which the key is a string like the String B-tree. While the node in the String B-tree is implemented with a Patricia trio, the node in the Suffix B-tree is implemented with an array. So the Suffix B-tree is simpler and easier to be Implemented than the String B-tree. Nevertheless, the branching algorithm of the Suffix B-tree is as efficient as that of the String B-tree. Consequently, the Suffix B-tree takes the same worst-case disk accesses as the String B-tree to solve the string matching problem, which is fundamental and important in the area of string algorithms.

String extraction from text-background mixed documents using mathematical morphology (텍스트-배경무늬 혼합문서로부터 수리형태학을 이용한 문자열 추출)

  • 성연진;어진우
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.10
    • /
    • pp.104-111
    • /
    • 1997
  • It is known as a difficult problem to recognize text-background mixed documents. In this paper a new string extraction algorithm, using mathematical morphology for the document consisting of text and overlapped periodic background pattern, is proposed. The algorithm consists of pattern periodicity feature extraction and background removal. The extracted pattern periodicity feature is used to determine the shape of structuring elements for morphological pre- and post-processing to remove background. The effectiveness of the proposed algorithm over the existing one is also verified through the experiments with various test documents.

  • PDF

A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection

  • Kim, HyunJin;Lee, Seung-Woo
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.154-157
    • /
    • 2013
  • This letter proposes a memory-based parallel string matching engine using the compressed state transitions. In the finite-state machines of each string matcher, the pointers for representing the existence of state transitions are compressed. In addition, the bit fields for storing state transitions can be shared. Therefore, the total memory requirement can be minimized by reducing the memory size for storing state transitions.

Constant Time RMESH Algorithm for Computing Longest Common Substring and Maximal Repeat of String (문자열의 최장 공통 부분문자열과 최대 반복자를 구하기 위한 상수시간 RMESH 알고리즘)

  • Han, Seon-Mi;Woo, Jin-Woon
    • The KIPS Transactions:PartA
    • /
    • v.16A no.5
    • /
    • pp.319-326
    • /
    • 2009
  • Since string operations were applied to computational biology area, various data structures and algorithms for computing efficient string operations have been studied. The longest common substring problem is an operation to find the longest matching substring in more than two strings, and maximal repeat of string problem is an operation to find substrings repeated more than once in the given string. These operations are importantly used in the string processing area such as pattern matching and likelihood measurement. In this paper, we present algorithms to compute the longest common substring of two strings and to find the maximal repeat of string using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). Our algorithms have O(1) time complexity.

Pattern Recognition Method Using Fuzzy Clustering and String Matching (퍼지 클러스터링과 스트링 매칭을 통합한 형상 인식법)

  • 남원우;이상조
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.11
    • /
    • pp.2711-2722
    • /
    • 1993
  • Most of the current 2-D object recognition systems are model-based. In such systems, the representation of each of a known set of objects are precompiled and stored in a database of models. Later, they are used to recognize the image of an object in each instance. In this thesis, the approach method for the 2-D object recognition is treating an object boundary as a string of structral units and utilizing string matching to analyze the scenes. To reduce string matching time, models are rebuilt by means of fuzzy c-means clustering algorithm. In this experiments, the image of objects were taken at initial position of a robot from the CCD camera, and the models are consturcted by the proposed algorithm. After that the image of an unknown object is taken by the camera at a random position, and then the unknown object is identified by a comparison between the unknown object and models. Finally, the amount of translation and rotation of object from the initial position is computed.

Numeric Pattern Recognition Using Genetic Algorithm and DNA coding (유전알고리즘과 DNA 코딩을 이용한 Numeric 패턴인식)

  • Paek, Dong-Hwa;Han, Seung-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.1
    • /
    • pp.37-44
    • /
    • 2003
  • In this paper, we investigated the performance of both DNA coding method and Genetic Algorithm(GA) in numeric pattern (from 0 to 9) recognition. The performance of the DNA coding method is compared to the that of the GA. GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by Adenine(A), Cytosine(C), Guanine(G) and Thymine(T). To compare the performance of both method, the same genetic operators(crossover and mutation) are applied and the probabilities of crossover and mutation are set the same values. The results show that the DNA coding method has better performance over GA. The reasons for this outstanding performance are multiple candidate solution presentation in one string and variable solution string length.

Analysis on Rehabilitation of Elbow Joint Using Elastic String (탄성 줄을 이용한 팔꿈치 관절 재활 분석)

  • Kim, Byoung-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.3
    • /
    • pp.196-201
    • /
    • 2016
  • This paper analyses the characteristics of a stiffness-based rehabilitation mechanism for improving the function of the elbow joint of a human. We consider an elastic string as a tool for the elbow joint rehabilitation, where the string has been modeled as a linear spring with a stiffness. For effective rehabilitation training by using such a mechanism, we need to analyse the available torque characteristics of the elbow joint according to the stiffness of the string. Through various simulations, the torque pattern and its range of the elbow joint by assigning the stiffness of the string have been identified for a pre-defined trajectory of motion of the elbow joint. Finally, we show that the specified stiffness-based rehabilitation scheme can be used for effective rehabilitation of the elbow joint.

Development of Pulse Wave Analysis Model with Skin Effect (손목의 피부특성을 고려한 맥상파 해석모델 개발)

  • Shin, Sang-Hoon
    • The Journal of the Society of Korean Medicine Diagnostics
    • /
    • v.15 no.2
    • /
    • pp.159-168
    • /
    • 2011
  • Objectives: The purpose of this study is to develop the pulse wave analysis model with the palpation pressure and the skin effect. Methods: The position of pulse diagnosis was modeled with elastic string system. The skin was modeled with the elastic string, the palpation pressure with tension in the string, and the blood vessel pressure with external force on the string. Using the wave equation in the physics, the simplified pulse model was transformed to the mathematical model. Results: To the verification of the model, the effects of the palpation pressure and the skin effect were tested. Conclusions: There was optimal palpation pressure, describing the exact vessel pressure pattern and maximizing the amplitude of the skin displacement. For the optimal condition, the increased palpation pressure was needed with the increased skin thickness. Therefore, the developed pulse wave analysis model showed the good results.

A Study of ECG Pattern Classification of Using Syntactic Pattern Recognition (신택틱 패턴 인식 알고리즘에 의한 심전도 신호의 패턴 분류에 관한 연구)

  • 남승우;이명호
    • Journal of Biomedical Engineering Research
    • /
    • v.12 no.4
    • /
    • pp.267-276
    • /
    • 1991
  • This paper describes syntactic pattern recognition algorithm for pattern recognition and diagnostic parameter extraction of ECG signal. ECG signal which is represented linguistic string is evaluated by pattern grammar and its interpreter-LALR(1) parser for pattern recognition. The proposed pattern grammar performs syntactic analysis and semantic evaluation simultaneously. The performance of proposed algorithm has been evaluated using CSE database.

  • PDF