• Title/Summary/Keyword: multiple pattern matching

Search Result 70, Processing Time 0.031 seconds

Hybrid SVM/ANN Algorithm for Efficient Indoor Positioning Determination in WLAN Environment (WLAN 환경에서 효율적인 실내측위 결정을 위한 혼합 SVM/ANN 알고리즘)

  • Kwon, Yong-Man;Lee, Jang-Jae
    • Journal of Integrative Natural Science
    • /
    • v.4 no.3
    • /
    • pp.238-242
    • /
    • 2011
  • For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. The system that uses the artificial neural network(ANN) falls in a local minima when it learns many nonlinear data, and its classification accuracy ratio becomes low. To make up for this risk, the SVM/ANN hybrid algorithm is proposed in this paper. The proposed algorithm is the method that ANN learns selectively after clustering the SNR data by SVM, then more improved performance estimation can be obtained than using ANN only and The proposed algorithm can make the higher classification accuracy by decreasing the nonlinearity of the massive data during the training procedure. Experimental results indicate that the proposed SVM/ANN hybrid algorithm generally outperforms ANN algorithm.

Multi-point displacement monitoring of bridges using a vision-based approach

  • Ye, X.W.;Yi, Ting-Hua;Dong, C.Z.;Liu, T.;Bai, H.
    • Wind and Structures
    • /
    • v.20 no.2
    • /
    • pp.315-326
    • /
    • 2015
  • To overcome the drawbacks of the traditional contact-type sensor for structural displacement measurement, the vision-based technology with the aid of the digital image processing algorithm has received increasing concerns from the community of structural health monitoring (SHM). The advanced vision-based system has been widely used to measure the structural displacement of civil engineering structures due to its overwhelming merits of non-contact, long-distance, and high-resolution. However, seldom currently-available vision-based systems are capable of realizing the synchronous structural displacement measurement for multiple points on the investigated structure. In this paper, the method for vision-based multi-point structural displacement measurement is presented. A series of moving loading experiments on a scale arch bridge model are carried out to validate the accuracy and reliability of the vision-based system for multi-point structural displacement measurement. The structural displacements of five points on the bridge deck are measured by the vision-based system and compared with those obtained by the linear variable differential transformer (LVDT). The comparative study demonstrates that the vision-based system is deemed to be an effective and reliable means for multi-point structural displacement measurement.

Road Surface Marking Detection for Sensor Fusion-based Positioning System (센서 융합 기반 정밀 측위를 위한 노면 표시 검출)

  • Kim, Dongsuk;Jung, Hogi
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.22 no.7
    • /
    • pp.107-116
    • /
    • 2014
  • This paper presents camera-based road surface marking detection methods suited to sensor fusion-based positioning system that consists of low-cost GPS (Global Positioning System), INS (Inertial Navigation System), EDM (Extended Digital Map), and vision system. The proposed vision system consists of two parts: lane marking detection and RSM (Road Surface Marking) detection. The lane marking detection provides ROIs (Region of Interest) that are highly likely to contain RSM. The RSM detection generates candidates in the regions and classifies their types. The proposed system focuses on detecting RSM without false detections and performing real time operation. In order to ensure real time operation, the gating varies for lane marking detection and changes detection methods according to the FSM (Finite State Machine) about the driving situation. Also, a single template matching is used to extract features for both lane marking detection and RSM detection, and it is efficiently implemented by horizontal integral image. Further, multiple step verification is performed to minimize false detections.

Memory-Efficient High Performance Parallelization of Aho-Corasick Algorithm on Intel Xeon Phi (Intel Xeon Phi 에서의 Aho-Corasick 알고리즘을 위한 메모리 친화적인 고성능 병렬화)

  • Tran, Nhat-Phuong;Jeong, Yosang;Lee, Myungho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.87-89
    • /
    • 2014
  • Aho-Corasick (AC) algorithm is a multiple patterns string matching algorithm commonly used in many applications with real-time performance requirements. In this paper, we parallelize the AC algorithm on the Intel's Many Integrated Core (MIC) Architecture, Xeon Phi Coprocessor. We propose a new technique to compress the Deterministic Finite Automaton structure which represents the set of pattern strings again which the input data is inspected for possible matches. The new technique reduces the cache misses and leads to significantly improved performance on Xeon Phi.

Deep Learning based Human Recognition using Integration of GAN and Spatial Domain Techniques

  • Sharath, S;Rangaraju, HG
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.8
    • /
    • pp.127-136
    • /
    • 2021
  • Real-time human recognition is a challenging task, as the images are captured in an unconstrained environment with different poses, makeups, and styles. This limitation is addressed by generating several facial images with poses, makeup, and styles with a single reference image of a person using Generative Adversarial Networks (GAN). In this paper, we propose deep learning-based human recognition using integration of GAN and Spatial Domain Techniques. A novel concept of human recognition based on face depiction approach by generating several dissimilar face images from single reference face image using Domain Transfer Generative Adversarial Networks (DT-GAN) combined with feature extraction techniques such as Local Binary Pattern (LBP) and Histogram is deliberated. The Euclidean Distance (ED) is used in the matching section for comparison of features to test the performance of the method. A database of millions of people with a single reference face image per person, instead of multiple reference face images, is created and saved on the centralized server, which helps to reduce memory load on the centralized server. It is noticed that the recognition accuracy is 100% for smaller size datasets and a little less accuracy for larger size datasets and also, results are compared with present methods to show the superiority of proposed method.

A Parallel Implementation of the Order-Preserving Multiple Pattern Matching Algorithm using Fingerprints of Texts (텍스트의 핑거프린트를 이용한 순위다중패턴매칭 알고리즘 병렬 구현)

  • Park, Somin;Kim, Youngho;Sim, Jeong Seop
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.11a
    • /
    • pp.57-60
    • /
    • 2020
  • 순위다중패턴매칭문제는 길이가 n인 텍스트 T와 패턴들의 집합 P' = {P1,P2…,Pk}가 주어졌을 때, P'에 속하는 패턴들과 상대적인 순위가 일치하는 T의 모든 부분문자열들의 위치를 찾는 문제이다. P'에서 가장 짧은 패턴의 길이가 m, 가장 긴 패턴의 길이를 $\bar{m}$, 모든 패턴들의 길이의 합을 M, q개의 연속된 문자들을 q-그램이라 할 때, 기존에 텍스트의 핑거프린트를 이용하여 순위다중패턴매칭문제를 $O(q!+nqlogq+Mlog\bar{m}+nM)$ 시간에 해결하는 알고리즘이 제시되었다. 본 논문에서는 텍스트의 핑거프린트를 활용하여 O(max(q!,M,n))개의 스레드를 이용하여 순위다중패턴매칭문제를 평균적으로 $O(\bar{m}+qlogq+n/q!)$ 시간에 해결하는 병렬 구현 방법을 제시한다. 실험 결과, n = 1,000,000, k = 1,000, m = 5, q = 3일 때, 본 논문에서 제시하는 병렬 구현 방법은 기존의 순차 알고리즘보다 약 19.8배 빠르게 수행되었다.

Performance Improvement of Adaptive Hierarchical Hexagon Search by Extending the Search Patterns (탐색 패턴 확장에 의한 적응형 계층 육각 탐색의 성능 개선)

  • Kwak, No-Yoon
    • Journal of Digital Contents Society
    • /
    • v.9 no.2
    • /
    • pp.305-315
    • /
    • 2008
  • Pre-proposed AHHS(Adaptive Hierarchical Hexagon Search) is a kind of the fast hierarchical block matching algorithm based on the AHS(Adaptive Hexagon Search). It is characterized as keeping the merits of the AHS capable of fast estimating motion vectors and also adaptively reducing the local minima often occurred in the video sequences with higher spatio-temporal motion activity. The objective of this paper is to propose the method effectively extending the horizontal biased pattern and the vertical biased pattern of the AHHS to improve its predictive image quality. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive image quality and the computational time. The simulation results indicated that the proposed method was both suitable for (quasi-) stationary and large motion searches. While the proposed method increased the computational load on the process extending the hexagon search patterns, it could improve the predictive image quality so as to cancel out the increase of the computational load.

  • PDF

The effect of brightness contrast on resolving the correspondence problem (상의 대응 문제 해결에 미치는 밝기 대비의 영향)

  • 감기택;정찬섭
    • Korean Journal of Cognitive Science
    • /
    • v.12 no.4
    • /
    • pp.49-56
    • /
    • 2001
  • When multiple features are presented in the image the computational models for stereopsis select the most activated matches through the excitatory and inhibitory interactions among all possible matches. Using the random-dot stereogram with two surfaces. we investigate whether human binocular mechanism selects the most activated matches. The dots consisting a surface lying in a fixation plane were selected randomly while each of the dots consisting the other surface was paired with each of the original dots in the following manner. After finding the position of each dots in the original random pattern we placed an additional dot to the left and to the right of the original position in each of the left and right image of a stereogram respectively. The luminance of additional dots was varied while that of the original random dots was fixed so that the hypothetical matches presumably could be activated differently. Across the luminance condition the depth of each surface was measured to examine whether matches to be selected were changed depending on the activation level of possible matches. When the luminance of two patterns was within 30% of one another observers perceived an opaque surface. Beyond this value two transparent surfaces were seen with the magnitude of perceived depth varying with relative luminance of two patterns. When original pattern was brighter one additional surface was perceived at the depth corresponding to the disparity of original pattern. When original dot was dimmer. however the depth of an additional surface corresponded to the disparity of newly introduced pattern. These results suggest that there are dynamic interactions within the matching process whereby highly activated matches inhibit weaker one.

  • PDF

Miniaturization of UWB Antenna Using Open Ended Stepped Slot (개방 종단된 계단형 슬롯을 사용한 UWB용 안테나의 소형화)

  • Lee, Ki-yong;Lee, Young-soon
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.4
    • /
    • pp.353-358
    • /
    • 2017
  • In order to reduce the size of the previous stepped slot antenna for UWB applications(3.1 ~ 10.6 GHz) to half, an open ended stepped slot antenna is proposed. The proposed antenna consists of a stepped slot etched on the ground plane as radiation part and a microstrip feed-line with rectangular patch on the top plane for wideband impedance matching. The proposed antenna is designed and fabricated on the FR4 substrate with dielectric constant of 4.3, thickness of 1.6 mm and size of $28.5{\times}32mm^2$. The measured impedance bandwidth (${\mid}S_{11}{\mid}{\leq}-10dB$) of the fabricated antenna is 7.99 GHz(3.01~11 GHz) which is sufficient to cover UWB band (3.1 ~ 10.6 GHz). In particular, it has been observed that antenna has a good omnidirectional radiation patterns and high gain over the entire frequency band of interest even though the size of the proposed antenna is reduced to half when compared with the previous antenna.

Optimized KNN/IFCM Algorithm for Efficient Indoor Location (효율적인 실내 측위를 위한 최적화된 KNN/IFCM 알고리즘)

  • Lee, Jang-Jae;Song, Lick-Ho;Kim, Jong-Hwa;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.125-133
    • /
    • 2011
  • For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So intuitive fuzzy c-means(IFCM) clustering algorithm is applied to improve KNN, which is the KNN/IFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of IFCM based on signal to noise ratio(SNR). Then, the k RPs are classified into different clusters through IFCM based on SNR. Experimental results indicate that the proposed KNN/IFCM hybrid algorithm generally outperforms KNN, KNN/FCM, KNN/PFCM algorithm when the locations error is less than 2m.