• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.532-535
• /
• 2003

In this paper, we propose a new algorithm that can enhance the speed of template matching of hand vascular pattern person verification or recognition system. Various template matching algorithms have advantages in the matching accuracy, but most of the algorithms suffer from computational burden. To reduce the computational amount, with accuracy maintained, we propose following template matching scenario as follows. firstly, original hand vascular image is re-sampled in order to reduce spatial resolution. Secondly, reconstructed image is projected to vertical and horizontal direction, being converted to two one dimensional (1D) data. Thirdly, converted data is used to estimate spatial discrepancy between stored template image and target image. Finally, matching begins from where the estimated order is highest, and finishes when matching decision function is computed to be over certain threshold. We've applied the proposed algorithm to hand vascular pattern identification application for biometrics, and observed dramatic matching speed enhancement. This paper presents detailed explanation of the proposed algorithm and evaluation results.

• The Journal of the Korea Contents Association
• /
• v.8 no.2
• /
• pp.33-40
• /
• 2008

In various manners, string pattern matching algorithm has been proven for prominence in speed of searching particular queries and keywords. Whereas, the existing algorithms are limited in terms of various pattern. In this paper, regular expression has been utilized to improve efficiency of pattern matching through efficient execution towards various pattern of queries including particular keywords. Such as this research would enable to search various harmful string pattern more efficiently, rather than matching simple keywords, which also implies excellent speed of string pattern matching compared to that of those existing algorism. In this research, the proposed string search engine generated from the LEX are more efficient than BM & AC algorithm for a string patterns search speed in cases of 1000 with more than patterns, but we have got similar results for the keywords pattern matching.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.509-515
• /
• 2016

Given a text T and a pattern P, the order-preserving pattern matching problem is to find all substrings in T which have the same relative orders as P. The order-preserving pattern matching problem has been studied in terms of finding some patterns affected by relative orders, not by their absolute values. Given a text T and a pattern set $\mathbb{P}$, the order-preserving multiple pattern matching problem is to find all substrings in T which have the same relative orders as any pattern in $\mathbb{P}$. In this paper, we present a hashing-based algorithm for the order-preserving multiple pattern matching problem.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2253-2261
• /
• 1999

ACK generates optimized code using the string pattern matching technique in pattern table generator and peephole optimizer. But string pattern matching method is not effective due to the many comparative actions in pattern selection. We designed and implemented the EM intermediate code optimizer using tree pattern matching algorithm composed of EM tree generator, optimization pattern table generator and tree pattern matcher. Tree pattern matching algorithm practices the pattern matching that centering around root node with refer to the pattern table, with traversing the EM tree by top-down method. As a result, compare to ACK string pattern matching methods, we found that the optimized code effected to pattern selection time, and contributed to improved the pattern selection time by about 10.8%.

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

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.110-116
• /
• 2014

Pattern matching algorithms are widely used in computer security systems such as computer networks, ubiquitous networks, sensor networks, and so on. However, the advances in information technology causes grow on the amount of data and increase on the computation complexity of pattern matching processes. Therefore, there is a strong demand for a novel high performance pattern matching algorithms. In light of this fact, this paper newly proposes a suffix tree based pattern matching algorithm. The suffix tree is constructed based on the suffix values of all patterns. Then, the shift nodes which informs how many characters can be skipped without matching operations are added to the suffix tree in order to boost matching performance. The proposed algorithm reduces memory usage on the suffix tree and the amount of matching operations by the shift nodes. From the performance evaluation, our algorithm achieved 24% performance gain compared with the traditional algorithm named as Wu-Manber.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.1
• /
• pp.54-59
• /
• 2004

We suggest a 3D vision inspection algorithm which is based on the external shape feature. Because many electronic parts have the regular shape, if we have the database of pattern and can recognize the object using the database of the object s pattern, we can inspect many types of electronic parts. Our proposed algorithm uses the geometrical pattern matching method and 3D database on the electronic parts. We applied our suggested algorithm fer inspecting several objects including typical IC and capacitor. Through the experiments, we could find that our suggested algorithm is more effective and more robust to the inspection environment(rotation angle, light source, etc.) than conventional 2D inspection methods. We also compared our suggested algorithm with the feature space trajectory method.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.1
• /
• pp.51-59
• /
• 2013

This paper researches location estimating method in CDMA system. Previously proposed positioning algorithms are difficult to estimate accurate position in indoor environments, and possible to limited position. This paper proposes enhanced algorithm using received PN pilot signals from base stations to enhance previous algorithms. For estimating position, we set the threshold value and use over the threshold value in received signals. After selecting signals, we estimate position using TDOA algorithm. And the cases which TDOA algorithm cannot use to estimate position, we use Pattern Matching algorithm. The proposed method system showed the improved performance in estimating parameters and locating positions by computer simulations.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.307-310
• /
• 2000

The measuring method of large object using the pattern matching is discussed in the paper. It is hard and expensive to get the complete 3D data when the object is large or exceeds the limit of measuring devices. The large object is divided into several smaller areas and is scanned several times to get the data of all the pieces. These data are aligned to get the complete 3D data using the pattern matching method. The point pattern matching method and transform matrix algorithm are used for aligning. The laser slit beam and CCD camera is applied for experimental measurement. Visual C++ on Window98 is implemented in processing the algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.9
• /
• pp.714-719
• /
• 2003

We propose a measuring method of large object using the pattern matching. It is hard and expensive to get the complete 3D data when the object is large and exceeds the limit of measuring devices. The large object is divided into several smaller areas and is scanned several times to get the data of all the pieces. These data are aligned to get the complete 3D data using the pattern matching method such as point pattern matching method and transform matrix algorithm. The laser slit beam and CCD camera are applied for the experimental measurement. Visual C＋＋ on Windows 98 is implemented in processing the algorithm.