• Title/Summary/Keyword: 패턴 매칭 알고리즘

Search Result 156, Processing Time 0.024 seconds

The Classification of Arrhythmia Using Similarity Analysis Between Unit Patterns at ECG Signal (ECG 신호에서 단위패턴간 유사도분석을 이용한 부정맥 분류 알고리즘)

  • Bae, Jung-Hyoun;Lim, Seung-Ju;Kim, Jeong-Ju;Park, Sung-Dae;Kim, Jeong-Do
    • The KIPS Transactions:PartD
    • /
    • v.19D no.1
    • /
    • pp.105-112
    • /
    • 2012
  • Most methods for detecting PVC and APC require the measurement of accurate QRS complex, P wave and T wave. In this study, we propose new algorithm for detecting PVC and APC without using complex parameter and algorithms. Proposed algorithm have wide applicability to abnormal waveform by personal distinction and difference as well as all sorts of normal waveform on ECG. To achieve this, we separate ECG signal into each unit patterns and made a standard unit pattern by just using unit patterns which have normal R-R internal. After that, we detect PVC and APC by using similarity analysis for pattern matching between standard unit pattern and each unit patterns.

Adaptive Region Segmentation using Static/Dynamic Pattern Matching (정적/동적 패턴을 이용한 적응적 영역 분할 방법)

  • Park, Kyoung-Hwan;Lee, Chi-Won;Lee, Chang-Woo
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2010.07a
    • /
    • pp.145-148
    • /
    • 2010
  • 본 논문에서 우리는 도로 영역과 하늘 영역, 그리고 도로와 하늘이 아닌 나머지 영역으로 분할하기 위해 동적인(dynamic) 패턴을 이용한 적응적인(adaptive) 병합 방법을 제안한다. 원본영상에서 Mean Shift 알고리즘과 라벨링(Labeling)을 수행하고 영역을 과분할 한다. 컬러에 의해서 도로와 하늘영역이 검출되지 못하는 영역을 위해서 도로 영역과 하늘 영역에서 동적인 패턴 추출한 후 매칭을 통해 유사 영역을 병합한다. 이것은 도로와 하늘의 정보를 현재 환경에서 적응적으로 추출하는 방법이다. 실험에서 정적인(static) 패턴을 사용해서 병합하는 방법과 동적인 패턴을 사용해서 병합하는 방법을 비교하였다. 그 결과, 동적인 패턴을 사용하였을 때 8.12%의 향상된 성능을 보였다.

  • PDF

A Novel Algorithm for Dot Pattern Recognition with Reading Pen (펜학습기의 도트 패턴 인식을 위한 새로운 알고리즘)

  • Park, Hye-bin;Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.165-171
    • /
    • 2017
  • Reading Pen is used mostly in educational purpose, yet its possibility is great as an input device for various IT devices. Reading Pen recognizes tiny dot patterns printed in papers, converts the patterns to corresponding codes, and plays audio contents that match the codes. Recognizing dot patterns and converting to the codes are the main function of Reading Pens, on which we focus and propose a novel algorithm. Such technology is never open to public and this paper is the first open attempt in this area. We test the algorithm and obtain 85% recognition ratio.

An Improved Signature Hashing Algorithm for High Performance Network Intrusion Prevention System (고성능 네트워크 침입방지시스템을 위한 개선된 시그니처 해싱 알고리즘)

  • Ko, Joong-Sik;Kwak, Hu-Keun;Wang, Jeong-Seok;Kwon, Hui-Ung;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.449-460
    • /
    • 2009
  • The signature hashing algorithm[9] provides the fast pattern matching speed for network IPS(Intrusion Prevention System) using the hash table. It selects 2 bytes from all signature rules and links to the hash table by the hash value. It has an advantage of performance improvement because it reduces the number of inspecting rules in the pattern matching. However it has a disadvantage of performance drop if the number of rules with the same hash value increases when the number of rules are large and the corelation among rules is strong. In this paper, we propose a method to make all rules distributed evenly to the hash table independent of the number of rules and corelation among rules for overcoming the disadvantage of the signature hashing algorithm. In the proposed method, it checks whether or not there is an already assigned rule linked to the same hash value before a new rule is linked to a hash value in the hash table. If there is no assigned rule, the new rule is linked to the hash value. Otherwise, the proposed method recalculate a hash value to put it in other position. We implemented the proposed method in a PC with a Linux module and performed experiments using Iperf as a network performance measurement tool. The signature hashing method shows performance drop if the number of rules with the same hash value increases when the number of rules are large and the corelation among rules is strong, but the proposed method shows no performance drop independent of the number of rules and corelation among rules.

Iris Verification Using Pattern Features in Iris Radii (홍채반지름별 패턴특징에 따른 홍채검증)

  • 조성원;김태훈
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.170-174
    • /
    • 2000
  • 본 논문의 목적은 여러 생리학적 특징중 높은 신뢰성을 갖는 것으로 알려진 홍채로부터 고유한 특징을 추출하고, 인식/검증하는 알고리즘을 개발하는데 있다. 홍채패턴은 크게 주름과 주름내부의 패턴부분으로 구성되며 그 고유한 패턴은 주로 내부에 집중되어 있다. 본 논문에서는 홍채의 주름윤곽과 주름내부의 패턴 특징의 추출을 위해, 동공중심을 기준으로 반지름길이에 따라 홍채영역을 분리하여 ID신호를 추출하여 특징으로 사용하였으며, 전처리부에서는 thresholding 방법에 의해 안구로부터 홍채영상을 획득하고, 획득된 반지름별 ID 홍채특징으로부터 매칭시험을 수행하였다. 제안된 방법은 주름윤곽으로부터 ID 특징신호를 사용한 방법에서 무시한 홍채내부 패턴을 고려하였으며, 홍채 전체영역에 대해 2D 웨이블렛을 이용한 홍채특징추출 방법과 비교시보다 신속한 특징추출이 가능하다.

  • PDF

Modified Weight Filter Algorithm using Pixel Matching in AWGN Environment (AWGN 환경에서 화소매칭을 이용한 변형된 가중치 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.10
    • /
    • pp.1310-1316
    • /
    • 2021
  • Recently, with the development of artificial intelligence and IoT technology, the importance of video processing such as object tracking, medical imaging, and object recognition is increasing. In particular, the noise reduction technology used in the preprocessing process demands the ability to effectively remove noise and maintain detailed features as the importance of system images increases. In this paper, we provide a modified weight filter based on pixel matching in an AWGN environment. The proposed algorithm uses a pixel matching method to maintain high-frequency components in which the pixel value of the image changes significantly, detects areas with highly relevant patterns in the peripheral area, and matches pixels required for output calculation. Classify the values. The final output is obtained by calculating the weight according to the similarity and spatial distance between the matching pixels with the center pixel in order to consider the edge component in the filtering process.

A Study on the Recognition of Hand Vein Pattern using Graph Theory (그래프 이론에 의한 손 정맥 패턴 인식에 관한 연구)

  • Cho, Meen-Hwan
    • Journal of the Korea Computer Industry Society
    • /
    • v.10 no.5
    • /
    • pp.187-192
    • /
    • 2009
  • In this paper, we proposed an algorithm for personal identification of dorsal surface pattern of hand vein pattern using graph theory. Using dense ranee data images of the hand vein pattern, we used matching algorithm within the frame work of graph theory for the determination of the desired correspondence. Through preprocessing, the captured images are more sharp, clear and thinning. After thinning, the images are normalized and make graph with node and edge set. This normalized graph can make adjacent matrix. Each adjacent matrix from individual vein pattern are different. From examining the performance of individual vein patterns, we can approach performances well kind biometric technique.

  • PDF

Digital Filter Algorithm based on Local Steering Kernel and Block Matching in AWGN Environment (AWGN 환경에서 로컬 스티어링 커널과 블록매칭에 기반한 디지털 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.7
    • /
    • pp.910-916
    • /
    • 2021
  • In modern society, various digital communication equipment is being used due to the influence of the 4th industrial revolution. Accordingly, interest in removing noise generated in a data transmission process is increasing, and research is being conducted to efficiently reconstruct an image. In this paper, we propose a filtering algorithm to remove the AWGN generated in the digital image transmission process. The proposed algorithm classifies pixels with high similarity by selecting regions with similar patterns around the input pixels according to block matching to remove the AWGN that appears strongly in the image. The selected pixel determines the estimated value by applying the weight obtained by the local steering kernel, and obtains the final output by adding or subtracting the input pixel value according to the standard deviation of the center mask. In order to evaluate the proposed algorithm, it was simulated with existing AWGN removal algorithms, and comparative analysis was performed using enlarged images and PSNR.

Defects detection of TCP / COF using real-time line scanner (실시간 라인 스캐너를 이용한 TCP / COF의 불량 검출)

  • Kim, Yong-Sam;Moon, Hee-Jeong;Song, Chang-Kyu;Chun, Myung-Geun
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.153-154
    • /
    • 2007
  • 본 논문에서는 반도체 패키징 기술의 일종인 TCP와 COF의 패턴 결함을 검출하는 영상 처리 알고리즘을 제안한다. 제안된 방법은 우선, TCP와 COF의 양품 패턴을 기준 영상으로 취득한다. 라인 스캐너에서 취득된 실시간 영상을 그레이로 변환한 후, 평균화 필터를 적용하고 임계값을 이용해서 검사하고자 하는 필름 영상의 이진화를 수행한다. 이진화 된 기준 영상과 검사하고자 하는 필름 영상을 이용해서 차영상을 구한 후에 라벨링을 하여 필름의 불량을 검출하게 된다. 제안된 패턴 매칭 방법이 TCP와 COF의 다양한 불량 항목 중에서 10여 가지의 불량 패턴을 대상으로 제안된 방법의 타당성을 검증하였다.

  • PDF

A Fast Motion Estimation Algorithm using Probability Distribution of Motion Vector and Adaptive Search (움직임벡터의 확률분포와 적응적인 탐색을 이용한 고속 움직임 예측 알고리즘)

  • Park, Seong-Mo;Ryu, Tae-Kyung;Kim, Jong-Nam
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.162-165
    • /
    • 2010
  • In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2/4 AVC standards.