• International Journal of Automotive Technology
• /
• v.7 no.3
• /
• pp.361-367
• /
• 2006

This paper describes a novel stereo vision based localization of free parking site, which recognizes the target position of automatic parking system. Pixel structure classification and feature based stereo matching extract the 3D information of parking site in real time. The pixel structure represents intensity configuration around a pixel and the feature based stereo matching uses step-by-step investigation strategy to reduce computational load. This paper considers only parking site divided by marking, which is generally drawn according to relevant standards. Parking site marking is separated by plane surface constraint and is transformed into bird's eye view, on which template matching is performed to determine the location of parking site. Obstacle depth map, which is generated from the disparity of adjacent vehicles, can be used as the guideline of template matching by limiting search range and orientation. Proposed method using both the obstacle depth map and the bird's eye view of parking site marking increases operation speed and robustness to visual noise by effectively limiting search range.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.800-808
• /
• 2008

A fingerprint verification system based on a set of invariant moment features and a nonlinear Back Propagation Neural Network(BPNN) verifier is proposed. An image-based method with invariant moment features for fingerprint verification is used to overcome the demerits of traditional minutiae-based methods and other image-based methods. The proposed system contains two stages: an off-line stage for template processing and an on-line stage for testing with input fingerprints. The system preprocesses fingerprints and reliably detects a unique reference point to determine a Region-of-Interest(ROI). A total of four sets of seven invariant moment features are extracted from four partitioned sub-images of an ROI. Matching between the feature vectors of a test fingerprint and those of a template fingerprint in the database is evaluated by a nonlinear BPNN and its performance is compared with other methods in terms of absolute distance as a similarity measure. The experimental results show that the proposed method with BPNN matching has a higher matching accuracy, while the method with absolute distance has a faster matching speed. Comparison results with other famous methods also show that the proposed method outperforms them in verification accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.308-314
• /
• 2006

A line scan camera is applied to enhance COG(Chip On Glass) inspection accuracy to be measured a few micro unit. The foreign substance detection among various faulty factors has been the most difficult technology in the faulty automatic inspection step since COG pattern is very miniature and complexity. In this paper, we proposed two step area segmentation template matching method to increase matching speed. Futhermore to detect foreign substance(such as dust, scratch) with a few micro unit, the new method using gradient mask and AND operation was proposed. The proposed 2 step template matching method increased 0.3 - 0.4 second matching speed compared with conventional correlation coefficient. Also, the proposed foreign substance applied masks enhanced $5-8\%$ faulty detection rate compared with conventional no mask application method.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.223-226
• /
• 2003

When we detect side-view face in color image, we decide a candidate face region using skin-tone color, and confirm to the face by template matching. Cang Wei use a left and a right template of face, calculate to similarity value by hausdorff method, and decide the final side-view face. It has a characteristic that side-view face is wide spreading neck region. To get exactly result, face region is separated vertically by 3 pixel unit, and matched template. In this paper, we assume that a side-view face is a right side-view or a left side-view face. We separate a half of the candidate face region vertically, and regard a left side as left candidate face, a right side as right candidate face by template matching. This method detect faster than Gang Wei method.

• The KIPS Transactions:PartB
• /
• v.13B no.6 s.109
• /
• pp.579-584
• /
• 2006

This paper proposes a nonlinear template matching measure, called counting measure, as a signal detection measure that is defined as the number of on pixels in the spot area. It is applied to classify probes for an on-off type DNA chip, where each probe spot is classified as hybridized or not. The counting measure also incorporates the maximum response search method, where the expected signal is obtained by taking the maximum among the measured responses of the various positions and sizes of the spot template. The counting measure was compared to existing signal detection measures such as the normalized correlation and the median for 2390 patient samples tested on the human papiliomavirus (HPV) DNA chip. The counting measure performed the best regardless of whether or not the maximum response search method was used. The experimental results showed that the counting measure combined with the positional search was the most preferable.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_3
• /
• pp.1351-1367
• /
• 2018

Image registration is an essential process for image fusion, change detection and time series analysis using multi-sensor images. For this purpose, we need to detect accurately the difference of scale and rotation between the multi-sensor images with difference spatial resolution. In this paper, we propose a new feature matching method using variable circular template for image registration between multi-resolution images. The proposed method creates a circular template at the center of a feature point in a coarse scale image and also a variable circular template in a fine scale image, respectively. After changing the scale of the variable circular template, we rotate the variable circular template by each predefined angle and compute the mutual information between the two circular templates and then find the scale, the angle of rotation and the center location of the variable circular template, respectively, in fine scale image when the mutual information between the two circular templates is maximum. The proposed method was tested using Kompsat-2, Kompsat-3 and Kompsat-3A images with different spatial resolution. The experimental results showed that the error of scale factor, the error of rotation angle and the localization error of the control point were less than 0.004, $0.3^{\circ}$ and one pixel, respectively.

• Korean Journal of Remote Sensing
• /
• v.30 no.5
• /
• pp.547-557
• /
• 2014

This paper presents a method for designing circular template used in similarity measurement for image registration. Circular template has translation and rotation invariant property, which results in correct matching of control points for image registration under the condition of translation and rotation between reference and sensed images. Circular template consisting of the pixels located on the multiple circumferences of the circles whose radii vary from zero to a certain distance, is converted to two-dimensional Discrete Polar Coordinate Matrix (DPCM), whose elements are the pixels of the circular template. For sensed image, the same type of circular template and DPCM are created by rotating the circular template repeatedly by a certain degree in the range between 0 and 360 degrees and then similarity is calculated using mutual information of the two DPCMs. The best match is determined when the mutual information for each rotation angle at each pixel in search area is maximum. The proposed algorithm was tested using KOMPSAT-2 images acquired at two different times and the results indicate high accurate matching performance under image rotation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1119-1128
• /
• 2013

In this paper, we propose an algorithm to detect and track the human face with a GPU-based high speed. Basically the detection algorithm uses the existing Adaboost algorithm but the search area is dramatically reduced by detecting movement and skin color region. Differently from detection process, tracking algorithm uses only depth information. Basically it uses a template matching method such that it searches a matched block to the template. Also, In order to fast track the face, it was computed in parallel using GPU about the template matching. Experimental results show that the GPU speed when compared with the CPU has been increased to up to 49 times.

• Journal of Internet Computing and Services
• /
• v.23 no.1
• /
• pp.31-38
• /
• 2022

An electrocardiogram(ECG) is a recoding of electrical signals of the heart's cyclic activity and an important body information for diagnosing myocardial rhythm. Large amount of information are generated continuously and a significant period of cumulative signal is required for the purpose of diagnosing a specific disease. Therefore, research on compression including clinically acceptable lossy technique has been developed to reduce the amount of information significantly. Recently, wearable smart heart monitoring devices that can transmit electrocardiogram(ECG) are being developed. The use of electrocardiogram, an important personal information for healthcare service, is rapidly increasing. However, devices generally have limited capability and power consumption for user convenience, and it is often difficult to apply the existing compression method directly. It is essential to develop techniques that can process and transmit a large volume of signals in limited resources. A method for compressing and transmitting the ECG signals efficiently by using the cumulative average (template) of the unit waveform is proposed in the paper. The ECG is coded lovelessly using template matching. It is analyzed that the proposed method is superior to the existing compression methods at high compression ratio, and its complexity is not relatively high. And it is also possible to apply compression methods to template matching values.

• The KIPS Transactions:PartB
• /
• v.14B no.2
• /
• pp.81-88
• /
• 2007

We implement automobile license plates recognition system. These days automobile license plate recognition systems are widely used for tracing stolen cars. managing parking facilities, ticketing speeding cars, and so on. Recognition systems largely consist of three parts plates extraction, segments extraction, and segment recognition. For plates extraction, we measure the degree of inclination of plate. We use filters that extract only the horizontal components of the front of an automobile to measure the degree of inclination. For segment extraction, we trace the change of the number of blocks that consist solely of foreground pixels or background pixels as the horizontal scanning line moves along upward. For recognition of each individual letter or digit, we devise a variant of template matching method, called comparative template matching. Through experiments, we show that comparative template matching is less prone misled by noises and exhibits higher performance compared to the traditional method of template matching or histogram based recognition.