• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.1-10
• /
• 2005

In this Paper, we propose a new block matching a1gorithm that extracts motion vectors from consecutive range data. The proposed method defines a matching metric that integrates intensity, hue, and range. Our algorithm begins matching with a small matching template. If the matching degree is not good enough, we slightly expand the size of a matching template and then repeat the matching process until our matching criterion is satisfied or the predetermined maximum size has been reached. As the iteration proceeds, we adaptively adjust weights of the matching metric by considering the importance of each feature. In the experiments, we show that our block matching approach can work as a promising solution by comparing the proposed method with previously known method in terms of performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1429-1436
• /
• 2009

In this paper, we propose a robust eye detection method using template matching based on genetic algorithm in the single facial image. The previous works for detecting pupil using genetic algorithm had a problem that the detection accuracy is influnced much by the initial population for it's random value. Therefore, their detection result is not consistent. In order to overcome this point we extract local minima in the facial image and generate initial populations using ones that have high fitness with a template. Each chromosome consists of geometrical informations for the template image. Eye position is detected by template matching. Experiment results verify that the proposed eye detection method improve the precision rate and high accuracy in the single facial image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.166-169
• /
• 2017

Currently, studies using Deep Learning are actively carried out showing good results in many fields. A template matching method is mainly used to recognize parts mounted on PCB(Printed Circuit Board). However, template matching should have multiple templates depending on the shape, orientation and brightness. And it takes long time to perform matching because it searches for the entire image. And there is also a disadvantage that the recognition rate is considerably low. In this paper, we use the Faster-RCNN method for recognizing PCB components as machine learning for classifying several objects in one image. This method performs better than the template matching method, execution time and recognition.

• Journal of the Korean Wood Science and Technology
• /
• v.37 no.6
• /
• pp.556-565
• /
• 2009

Automated visual grading system of lumber needs correct input image. In order to create a correct image of domestic red pine lumber 3.6 m long feeding on a conveyer, part images were captured using area sensor and template matching algorithm was applied to merge part images. Two kinds of template matching algorithms and six kinds of template sizes were adopted in this operation. Feature extracted method appeared to have more excellent image merging performance than fixed template method. Error length was attributed to a decline of similarity related by difference of partial brightness on a part image, specific pattern and template size. The mismatch part was repetitively generated at the long grain. The best size of template for image merging was $100{\times}100$ pixels. In a further study, assignment of exact template size, preprocessing of image merging for reduction of brightness difference will be needed to improve image merging.

• Journal of Korea Multimedia Society
• /
• v.18 no.6
• /
• pp.701-709
• /
• 2015

Image stitching method is a technique for obtaining an high-resolution image by combining two or more images. In X-ray image for clinical diagnosis, the size of the imaging region taken by one shot is limited due to the field-of-view of the equipment. Therefore, in order to obtain a high-resolution image including large regions such as a whole body, the synthesis of multiple X-ray images is required. In this paper, we propose a rapid stitching method of digital X-ray images using template-based registration. The proposed algorithm use principal component analysis(PCA) and k-nearest neighborhood(k-NN) to determine the location of input images before performing a template-based matching. After detecting the overlapping position using template-based matching, we synthesize input images by alpha blending. To improve the computational efficiency, reduced images are used for PCA and k-NN analysis. Experimental results showed that our method was more accurate comparing with the previous method with the improvement of the registration speed. Our stitching method could be usefully applied into the stitching of 2D or 3D multiple images.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.623-632
• /
• 2009

In this paper, we propose a pulmonary nodule registration for the tracking of lung nodules in sequential CT scans. Our method consists of following five steps. First, a translational mismatch is corrected by aligning the center of optimal bounding volumes including each segmented lung. Second, coronal maximum intensity projection(MIP) images including a rib structure which has the highest intensity region in baseline and follow-up CT series are generated. Third, rigid transformations are optimized by normalized average density differences between coronal MIP images. Forth, corresponding nodule candidates are defined by Euclidean distance measure after rigid registration. Finally, template matching is performed between the nodule template in baseline CT image and the search volume in follow-up CT image for the nodule matching. To evaluate the result of our method, we performed the visual inspection, accuracy and processing time. The experimental results show that nodules in serial CT scans can be rapidly and correctly registered by coronal MIP-based rigid registration and local template matching.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.7-15
• /
• 2014

This paper proposed a recognition algorithm of human facial expressions using the PCA and the template matching. Firstly, face image is acquired using the Haar-like feature mask from an input image. The face image is divided into two images. One is the upper image including eye and eyebrow. The other is the lower image including mouth and jaw. The extraction of facial components, such as eye and mouth, begins getting eye image and mouth image. Then an eigenface is produced by the PCA training process with learning images. An eigeneye and an eigenmouth are produced from the eigenface. The eye image is obtained by the template matching the upper image with the eigeneye, and the mouth image is obtained by the template matching the lower image with the eigenmouth. The face recognition uses geometrical properties of the eye and mouth. The simulation results show that the proposed method has superior extraction ratio rather than previous results; the extraction ratio of mouth image is particularly reached to 99%. The face recognition system using the proposed method shows that recognition ratio is greater than 80% about three facial expressions, which are fright, being angered, happiness.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.100-107
• /
• 2012

Recently the need for advanced security technologies are increasing as the occurrence of intelligent crime is growing fastly. Previous methods for face disguise detection are required for the improvement of accuracy in order to be put to practical use. In this paper, we propose a new disguise detection method using the template matching and Adaboost algorithm. The proposed system detects eyes based on multi-scale Gabor feature vector in the first stage, and uses template matching technique in oreder to increase the detection accuracy in the second stage. The template matching plays a role in determining whether or not the person of the captured image has sunglasses on. Adaboost algorithm is used to determine whether or not the person of the captured image wears a mask. Experimental results indicate that the proposed method is superior to the previous methods in the detection accuracy of disguise faces.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.461-472
• /
• 2005

In this paper, we propose face feature extraction algorithm through stereo image's matching value. The proposed algorithm detected face region by change the RGB color space of skin color information to the YCbCr color space. Applying eye-template from extracted face region geometrical feature vector of feature about distance and lean, nose and mouth between eye extracted. And, Proposed method could do feature of eyes, nose and mouth through stereo image's matching as well as 2D feature information extract. In the experiment, the proposed algorithm shows the consistency rate of 73% in distance within about 1m and the consistency rate of 52%in distance since about 1m.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.119-128
• /
• 2014

In this paper, a fast human detection method using adaptive UV-histogram and template matching is proposed. The proposed method improves the detection rate in the scene of complex environment. The method firstly generates U-histogram to extract human candidates and adaptively generates V-histogram for each labled U-histogram, thus it could extract humans correctly, which was impossible in the previous method. The method tries to match the human candidates with the adaptively sized omega shape template to the focal length and distance in order to improve the detection accuracy. It also detects false positives by rematching the template with accumulated foreground images and hence is robust to the occlusion. Experimental results showed that the proposed method has superior performance to the Bae's method in the complex environment with about 15% improvement in precision and 80% in recall and has 20 times faster processing time than Xia's method.