• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.119-124
• /
• 2001

In this pattern recognition on the large volumes of remote sensing satellite images, the inference time is much increased. In the case of the remote sensing data [5] having 4 wavebands, the 778 training patterns are learned. Each land cover pattern is classified by using 159, 900 patterns including the trained patterns. For the fuzzy classification, the 778 fuzzy rules are generated. Each fuzzy rule has 4 fuzzy variables in the condition part. Therefore, high performance parallel fuzzy inference system is needed. In this paper, we propose a novel parallel fuzzy inference system on T3E parallel computer. In this, fuzzy rules are distributed and executed simultaneously. The ONE_To_ALL algorithm is used to broadcast the fuzzy input to the all nodes. The results of the MIN/MAX operations are transferred to the output processor by the ALL_TO_ONE algorithm. By parallel processing of the fuzzy rules, the parallel fuzzy inference algorithm extracts match parallelism and achieves a good speed factor. This system can be used in a large expert system that ha many inference variables in the condition and the consequent part.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.320-328
• /
• 2006

Using biometrics to verify a person's identity has several advantages over the present practice of personal identification numbers (PINs) and passwords. To gain maximum security in a verification system using biometrics, the computation of the verification as well as the storing of the biometric pattern has to take place in a smart card. However, there is an open issue of integrating biometrics into a smart card because of its limited resources (processing power and memory space). In this paper, we propose a speaker verification algorithm using a support vector machine (SVM) with a very few features, and implemented it on a 32-bit smart card. The proposed algorithm can reduce the required memory space by a factor of more than 100 and can be executed in real-time. Also, we propose a hardware design for the algorithm on a field-programmable gate array (FPGA)-based platform. Based on the experimental results, our SVM solution can provide superior performance over typical speaker verification solutions. Furthermore, our FPGA-based solution can achieve a speed-up of 50 times over a software-based solution.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.4
• /
• pp.120-126
• /
• 1989

IC chip layout pattern recognition algorithms using image processing techniques are being developed for the automation of manufacturing and inspecting chips. Recognitioin of chip pattern requires feature extraction from nach rrame of chip image adn needs to match the feature data through all frames. In this paper, vertex position and form having layout information are extracted by the feature straightening algorithm, and global coordinates of layout pattern are extracted by the feature straightening algorithm, and global coordinates of layout pattern are obtainnd by vertex form matching from the overlapped area of neighbour frame.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.29-35
• /
• 2010

While diversification of the use of video in the prevalence of cheap video equipment, augmented reality can print additional real-world images and video image. Although many recent advent augmented reality techniques, currently attempting to correct the character recognition is performed. In this paper characters marked with a visual marker recognition, and the color to match the marker color of the characters finds. And, it was shown on the screen by the character recognition. In this paper, by applying the phoneme pattern segmentation algorithm by the horizontal projection, we propose to segment the phoneme to match the six types of Hangul representation. Throughout the experiment sample of phoneme segmentation using augmented reality showed proceeding result at each step, and the experimental results was found to be that detection rate was above 90%.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.290-291
• /
• 2008

The most popular speech feature used in speech recognition today is the Mel-Frequency Cepstral Coefficients (MFCC) algorithm, which could reflect the perception characteristics of the human ear more accurately than other parameters. This paper adopts MFCC and its first order difference, which could reflect the dynamic character of speech signal, as synthetical parametric representation. Furthermore, we quote Dynamic Time Warping (DTW) algorithm to search match paths in the pattern recognition process. We use the software "GoldWave" to record English digitals in the lab environments and the simulation results indicate the algorithm has higher recognition accuracy than others using LPCC, etc. as character parameters in the experiment for Digital Isolated Word Recognition (DIWR) system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.714-717
• /
• 1996

This paper presents a fault detection and diagnosis methodologies based on weighted symptom model and pattern matching between the coming fault propagation trend and the simulated one. At the first step, backward chaining is used to find the possible cause candidates for the faults. The weighted symptom model(WSM) is used to generate those candidates. The weight is determined from dynamic simulation. Using WSMs, the methodology can generate the cause candidates and rank them according to the probability. Secondly, the fault propagation trends identified from the partial or complete sequence of measurements are compared to the standard fault propagation trends stored a priori. A pattern matching algorithm based on a number of triangular episodes is used to effectively match those trends. The standard trends have been generated using dynamic simulation and stored a priori. The proposed methodology has been illustrated using two case studies and showed satisfactory diagnostic resolution.

• 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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.9
• /
• pp.475-482
• /
• 2005

String data containing wildcard characters may represent certain patterns in texts. A subsumption relation between two patterns can be defined by a subset relation between sets of strings that match those patterns. Thus, the subsumption relation check is important to determine whether each pattern represents a set of strings without any overlap with another pattern. In this paper, we propose an effective algorithm that can determine subsumption relation between strings with wildcard characters. First, we consider a simple extension of the suffix tree algorithm so that it nay include wildcard characters and then we propose another method that checks the subsumption relation by dividing a suffix tree structure at each location of string data.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.420-432
• /
• 2020

The reconstruction of archaeological fragments in 3D geometry is an important problem in pattern recognition and computer vision. Therefore, we implement an algorithm with the help of a 3D model to perform reconstruction from the real datasets using the slope features. This approach avoids the problem of gaps created through the loss of parts of the artifacts. Therefore, the aim of this study is to assemble the object without previous knowledge about the form of the original object. We utilize the edges of the fragments as an important feature in reconstructing the objects and apply multiple procedures to extract the 3D edge points. In order to assign the positions of the unknown parts that are supposed to match, the contour must be divided into four parts. Furthermore, to classify the fragments under reconstruction, we apply a backpropagation neural network. We test the algorithm on several models of ceramic fragments. It achieves highly accurate results in reconstructing the objects into their original forms, in spite of absent pieces.