• 대한전자공학회논문지TC
• /
• 제46권4호
• /
• pp.86-94
• /
• 2009

현재 위치기반서비스(LBS : Location Based Service) 를 위해 사용되고 있는 위치측위 방식은 GPS 기반의 측위 방식과 이동통신망을 이용한 네트워크 기반의 측위기술들이 있다. 그러나 GPS 와 네트워크기반의 측위 방식은 비가시선 효과(NLOS) 와 중계기에 의한 전파 지연 발생 때문에 위치측위 정확도가 저하되는 문제점이 있다. 이러한 단점을 보완하기 위해 현재 CDMA 시스템에서는 패턴매칭(Pattern Matching) 알고리즘을 사용한다. 패턴매칭 알고리즘은 GPS 에 의한 위치측위 시 측정된 RF 신호의 전파 특성을 측위 된 위치와 함께 데이터베이스로 구축하여, 사용자의 측위 요청이 있을 때 수신신호의 전파특성과 데이터베이스를 비교하여 위치를 제공하는 방식이다. 그러나 패턴매칭 알고리즘은 GPS 신호를 수신할 수 없는 음영 지역과 실내 에서는 데이터베이스가 구축되어지지 않는다. 패턴매칭 알고리즘은 데이터베이스의 위치 정보가 위치측위를 요청하는 사용자의 위치를 결정하기 때문에 데이터베이스가 구축이 되지 않는 지역에서는 측위정확도의 오차가 발생하게 된다. 따라서 본 논문에서는 현재 CDMA 시스템에서 사용하는 패턴매칭 알고리즘의 위치측위 성능을 분석하고 패턴매칭 알고리즘을 이용한 위치측위 시스템의 성능을 향상시키기 위해서 신호세기 예측 알고리즘을 이용하여 현재 구축이 되지 않은 지역의 데이터베이스를 구축하기 위한 알고리즘을 제안하였다. 제안하는 알고리즘으로 데이터베이스가 없는 지역의 신호세기를 예측하여 데이터베이스를 구축한 후 패턴매칭 알고리즘의 위치측위 성능을 분석하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.2821-2823
• /
• 1999

In this paper we proposed an algorithm for rotation-invariant pattern recognition and rotated angle estimation between two patterns by employing selective template matching. Generally template matching has been used in determining the location of pattern but template matching requires a number of calculating correlation. To reduce the number of correlation we used steady-state genetic algorithm which is effective in optimization problem. We apply this method to distinguish specific pattern from similar coin patterns and estimate rotated angle between patterns. Our result leads us to the conclusion that proposed method performed faster than classical template matching

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.659-661
• /
• 1988

SPM is MDC Processor for string pattern expressed in directional chain code. In this paper we consider the string pattern matching algorithm (Leve-nstein Algorithm) whitch is portion of Dynamic Programing, and propose architecture of SPM and simulate it on the R-T level to evaluate its architecture. We used the C language as the hardware description language, and developed it on the IBM PC/AT Zenix system V OS environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.711-725
• /
• 2013

A heuristic with multi-byte suffix matching plays an important role in real pattern matching algorithms. By skipping many characters at a time in the process of comparing a given pattern with the text, the pattern matching algorithm based on a heuristic with multi-byte suffix matching shows a faster average search time than algorithms based on deterministic finite automata. Based on various experimental results and simulations, the previous works show that the pattern matching algorithms with multi-byte suffix matching performs well. However, there have been limited studies on the mathematical model for analyzing the performance in a standard manner. In this paper, we propose a new probabilistic model, which evaluates the performance of a heuristic with multi-byte suffix matching in an average-case search. When the theoretical analysis results and experimental results were compared, the proposed probabilistic model was found to be sufficient for evaluating the performance of a heuristic with suffix matching in the real pattern matching algorithms.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.196-202
• /
• 2021

DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

• 한국컴퓨터산업학회논문지
• /
• 제4권12호
• /
• pp.953-964
• /
• 2003

서로 다른 형태와 크기를 가지는 탐색패턴과 움직임 벡터의 분포는 블록 정합 알고리즘에서 탐색 속도와 화질을 좌우하는 중요한 요소이다. 본 논문에서는 크로스패턴과 납작한 육각패턴을 이용한 새로운 고속 블록 정합 알고리즘을 제안한다. 이 알고리즘은 초기에 크로스 패턴을 이용하여 탐색영역의 중심 주위에 분포 확률이 높은 움직임이 작은 벡터를 우선 찾은 다음에 움직임이 큰 벡터에 대해서는 납작한 육각패턴을 이용하여 고속으로 움직임 벡터를 찾게 하였다. 실험결과, 제안된 알고리즘은 육각패턴 탐색 알고리즘에 비하여 움직임 벡터 추정의 속도에 있어서 약 0.2-6.2% 의 성능 향상을 보였으며 화질 또한 PSNR 기준으로 약 0.02-0.3105 의 향상을 보였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 춘계학술발표대회
• /
• pp.521-524
• /
• 2005

This paper proposes a fusion algorithm which merges multiple vein pattern images into a single image, larger than those images. As a preprocessing step of template matching, during the verification of biometric data such as fingerprint image, vein pattern image of hand, etc., the fusion technique is used to make reference image larger than the candidate images in order to enhance the matching performance. In this paper, a new algorithm, called BSA (Boundary Stitching Algorithm) is proposed, in which the boundary rectilinear parts extracted from the candidate images are stitched to the reference image in order to enlarge its matching space. By applying BSA to practical vein pattern verification system, its verification rate was increased by about 10%.

• Nuclear Engineering and Technology
• /
• 제36권3호
• /
• pp.219-228
• /
• 2004

[1] and [2] present an approach to diagnosing possible defects in the mechanical systems of a nuclear power plant. In this paper, by using a fault library as a database and training data, we develop a diagnostic algorithm 1) to decide whether an Air Operated Valve system is sound or not and 2) to identify the defect from which an Air-Operated Valve system suffers, if any. This algorithm is composed of three stages: a neural net stage, a non-neural net stage, and an integration stage. The neural net stage is a simple perceptron, a pattern-recognition module, using a neural net. The non-neural net stage is a simple pattern-matching algorithm, which translates the degree of matching into a corresponding number. The integration stage collects each output and makes a decision. We present a simulation result and confirm that the developed algorithm works accurately, if the input matches one in the database.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 V
• /
• pp.2533-2536
• /
• 2003

In this paper, we suggest the 3D Vision Inspection Algorithm which is based on the external shape feature, and is able to recognize the object. Because many objects made by human have the regular shape, if we posses the database of pattern and we recognize the object using the database of the object's pattern, we could inspect the objects of many fields. Thus, this paper suggest the 3D Vision inspection Algorithm using the Geometrical Pattern Matching by making the 3D database.

• 디지털산업정보학회논문지
• /
• 제9권4호
• /
• pp.135-141
• /
• 2013

String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.