• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.362-368
• /
• 2005

This paper is related to the fast block matching algorithm, especially a method for expanding the search pattern using the second local matching point in the adaptive hexagonal search. To reduce the local minima problem in fast motion estimation, the proposed method expands the search pattern by adding new searching points selected by using the second local matching point to conventional search pattern formed by the first local matching point in the adaptive hexagonal search. According to estimating the motion vector by applying block matching algorithm based on hexagonal search to the expanded search pattern, the proposed method can effectively carry out fast motion estimation to improve the performance in terms of compensated image quality.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.4
• /
• pp.161-168
• /
• 2006

In this paper, we propose a method for the pattern inspection of LCD module using the color compensation and pattern matching. The pattern matching is generally used for the inspection method of LCD module at the industry. LCD module has many defections such as the brightness difference of the back light, the optic feature of liquid crystal, the difference of the light penetrated by driving LCD and the color difference by the lighting. The conventional method without the color compensation can not solve these defections and decreases the efficiency of inspecting LCD module. The method proposed to inspect defective badness through the pattern matching after it compensated color difference of the LCD occurred by the various causes. At first, it revises with setting by standard tone of color with the LCD pattern of the reference image. And It perform the preprocessing and pattern matching algorithm on the compensated image. In experiment, we confirmed that this algorithm is useful to detect some defections of LCD module. The proposed methods was easy to detect the faulty product.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.3 no.2
• /
• pp.3-17
• /
• 1993

The fuzzy pattern matching technique has been developed in the framework of fuzzy set and possibility theory in order to take into account the imprecision and the uncertainty pervading values which have to be compared to requirements (which may be fuzzy) in a pattern matching process. This paper restates the basic principles and extends them to situations where (sub)patterns are only required to be satisfied up to a given tolerance (which may be fuzzy), or where the different subparts of a compound pattern may have various levels of importance. Both cases correspond to a weakening of elementary patterns. which can be expressed by a fuzzy relations modelling an approximate equality or an uncertain strict equality respectively. We also study the more sophisticated case where some elementary patterns have not to be satisfied with the highest priority provided that weaker requirements remain satisfied. The fuzzy pattern matching technique applies in a variety of problems including the evaluation of soft queries with respect to a fuzzy database, the evaluation of the fuzzy condition parts of rules in approximate reasoning, or the evaluation of the belonging of an ill-known object to a flexible class in classification problems.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.5
• /
• pp.470-475
• /
• 2009

This paper is the study which is head tracker using pattern matching. Proposal algorithm obtains initial attitude of head tracker using pattern matching. Optical head tracker consists of infrared LEDs(features) which are attached helmet as pattern, stereo infrared cameras. Proposal algorithm analyzes patterns by error rate of feature distance and estimates feature characteristic number. Initial attitude of head tracker is obtained to compare map data and feature characteristic number.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.130-137
• /
• 1992

This paper presents the word recognition method using a neural-fuzzy pattern matching, in order to make a proper speech pattern for a spectrum sequence and to improve a recognition rate. In this method, a frequency variation is reduced by generating binary spectrum patterns through associative memory using a neural network, and a time variation is decreased by measuring the simillarity using a fuzzy pattern matching. For this method using binary spectrum patterns and logic algebraic operations to measure the simillarity, memory capacity and computation requirements are far less than those of DTW using a conventional distortion measure. To show the validity of the recognition performance for this method, word recognition experiments are carried out using 28 DDD city names and compared with DTW and a fuzzy pattern matching. The results show that our presented method is more excellent in the recognition performance than the other methods.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.59-65
• /
• 2002

Recently, lots of researchers work focused on the intrusion detection system. Pattern matching technique is commonly used to detect the intrusion in the system, However, the method requires a lot of time to match between systems rule and inputted packet data. This paper proposes a new intrusion detection system based on the pattern matching technique. Proposed system reduces the required time for pattern matching by using classified system rule. The classified rule is implemented with a general tree for efficient pattern matching. Thereby, proposed system could perform network intrusion detection efficiently.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.2
• /
• pp.320-326
• /
• 2008

In this paper, we propose a new algorithm emulating the DNA characteristics for noise-tolerant pattern matching problem on digital system. The digital pattern matching becomes core technology in various fields, such as, robot vision, remote sensing, character recognition, and medical diagnosis in particular. As the properties of natural DNA strands allow hybridization with a certain portion of incompatible base pairs, DNA-inspired data structure and computation technique can be adopted to bio-signal pattern classification problems which often contain imprecise data patterns. The key feature of noise-tolerance of DNA computing comes from control of reaction temperature. Our hardware system mimics such property to diagnose cardiovascular disease and results superior classification performance over existing supervised learning pattern matching algorithms. The hardware design employing parallel architecture is also very efficient in time and area.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.59-65
• /
• 2002

Recently, lots of researchers work focused on the intrusion detection system. Pattern matching technique is commonly used to detect the intrusion in the system, However, the method requires a lot of time to match between systems rule and inputted packet data. This paper proposes a new intrusion detection system based on the pattern matching technique. Proposed system reduces the required time for pattern matching by using classified system rule. The classified rule is implemented with a general tree for efficient pattern matching. Thereby, proposed system could perform network intrusion detection efficiently.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• 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

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.9
• /
• pp.913-917
• /
• 2010

To inspect the defects of printed markings on the surface of IC package, the OCV (Optical Character Verification) method based on NCC (Normalized Correlation Coefficient) pattern matching is widely used. In order to detect the micro pattern defects appearing on the small portion of the markings, a Partitioned NCC pattern matching method was proposed to overcome the limitation of the NCC pattern matching. In this method, the reference pattern is first partitioned into several blocks and the NCC values are computed and are combined in these small partitioned blocks, rather than just using the NCC value for the whole reference pattern. In this paper, we proposed a method to decide the proper number of partition blocks and a method to inspect and combine the NCC values of each partitioned block to identify the defective markings.