• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.4
• /
• pp.36-47
• /
• 1992

In this paper, a set of TM(template matching) mask using the AM(associative mapping) technique was generated and the edge detection algorithm for a SAR image was proposed. And also, the performance of the proposed edge detection algorithm was tested with the conventional edge detection techniques. The proposed edge detection algorithm created an edge image which was more accurate and clear than the conventional edge detection techniques and the performance of the proposed detection technique was not deteriorated for low intensity area in the image because the uncertainly thresholded value genetated by the conventional detection methods was requested. Also, the number of masks and the detection time were reduced by adjusting resolution of edge detection and the consideration for the threshold value extracting the edge was very intuitive.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.369-375
• /
• 2008

The kinematics and control problem of a visual alignment system is investigated, which plays a crucial role in the fabrication process of flat panel displays. The first solution is the inverse kinematics of a 4PPR parallel alignment mechanism. It determines the driving distance of each joint to compensate the misalignment between mask and panel. Second, an efficient vision algorithm for fast alignment mark recognition is suggested, where by extracting essential feature points to represent the geometry of a mark, the geometric template matching enables much faster object recognition comparing with the general template matching. Finally, the overall visual alignment process including the kinematic solution, vision algorithm, and joint control is implemented and experimental results are given.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.171-180
• /
• 2013

Generally, when we apply zernike moments value for matching, we can use those moments value obtained from projecting image information under circumscribed circle to zernike basis function. However, the problem is that the power of discrimination can be reduced because hand images include lots of overlapped information due to its special characteristic. On the other hand, when distinguishing hand poses, information in specific area of image information except for overlapped information can increase the power of discrimination. In this paper, in order to solve problems like those, we design R3 ring mask by combining image obtained from R2 ring mask, which can weight information of the power of discrimination and image obtained from R1 ring mask, which eliminate the overlapped information. The moments which are obtained by R3 ring mask decrease operational time by reducing dimension through principle component analysis. In order to confirm the superiority of the suggested method, we conducted some experiments by comparing our method to other method using seven different hand poses.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.403-406
• /
• 2009

In this paper, we propose a method for deciding permission from the ATM(Automated Teller Machine) using face detection. First, we extract skin areas and make candidate face images from an input image, and then detect a face using Adaboost(Adaptive Boosting) algorithm. Next, proposed method executes a template matching for making a decision on whether to wear accessories like sunglasses or a mask in detected face image. Finally, this method decides whether to permit ATM service using this result. Experimental results show that proposed method performed well at indoors ATM environment for detecting whether to wear accessories.

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

An region of interest processing technique is to handle preferentially some part of an image dynamically according to region of interest of the users in JPEG2000 image. A small image is not important, but in a big image the specified region that the user indicated has to be handled preferentially because it takes long time to display the whole image. If the user indicates a region of the outline image, the browser masks the region and sends the mask information to the source that transmitted the image. The server which got the mask information preferentially sends the code blocks matching the masks. Here, quickly generating mask information is important, so, in this paper using predefined 48 mask patterns, selecting one of the patterns according to the distribution of ROI(Region-of-Interest) and background, we remarkably reduced the time computing the mask region. Blocks that the patterns are applied are the blocks mixed of ROI and background in a block. If a whole block is an ROI or a background, these patterns are not applied. As results, comparing to the method that precisely handles ROI and background, the quality is unsatisfactory but the processing time remarkably reduced.

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

• ETRI Journal
• /
• v.39 no.1
• /
• pp.97-107
• /
• 2017

A fast and accurate building-level visual place recognition method built on an image-retrieval scheme using street-view images is proposed. Reference images generated from street-view images usually depict multiple buildings and confusing regions, such as roads, sky, and vehicles, which degrades retrieval accuracy and causes matching ambiguity. The proposed practical database refinement method uses informative reference image and keypoint selection. For database refinement, the method uses a spatial layout of the buildings in the reference image, specifically a building-identification mask image, which is obtained from a prebuilt three-dimensional model of the site. A global-positioning-system-aware retrieval structure is incorporated in it. To evaluate the method, we constructed a dataset over an area of $0.26km^2$. It was comprised of 38,700 reference images and corresponding building-identification mask images. The proposed method removed 25% of the database images using informative reference image selection. It achieved 85.6% recall of the top five candidates in 1.25 s of full processing. The method thus achieved high accuracy at a low computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5419-5435
• /
• 2017

The construction of panoramic images on smartphones and low-powered devices is a challenging task. In this paper, we propose a new approach for smoothly stitching images on mobile phones in the presence of moving objects in the scene. Our main contributions include handling moving object problems, reducing processing time, and generating rectangular panoramic images. First, unique and robust feature points are extracted using fast ORB method and a feature matching technique is applied to match the extracted feature points. After obtaining good matched feature points, we employ the non-deterministic RANSAC algorithm to discard wrong matches, and the hommography transformation matrix parameters are estimated with the algorithm. Afterward, we determine precise overlap regions of neighboring images and calculate their absolute differences. Then, thresholding operation and noise removal filtering are applied to create a mask of possible moving object regions. Sequentially, an optimal seam is estimated using dynamic programming algorithm, and a combination of linear blending with the mask information is applied to avoid seam transition and ghosting artifacts. Finally, image-cropping operation is utilized to obtain a rectangular boundary image from the stitched image. Experiments demonstrate that our method is able to produce panoramic images quickly despite the existence of moving objects.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.263-265
• /
• 2003

The computation cost of image registration is affected by searching data size and space. This paper proposes an efficient image registration algorithm that uses multi-resolution wavelet decomposed image to reduce the data size search. The algorithm determines the correlation detection at low resolution on low-pass sub bands of wavelet and generate mask for higher resolution as part of a coarse to fine registration algorithm. The correlation matching is defined for coarse resolution similarity measurement, while mutual information (MI) is used at fine resolution. The results show that the new efficient mask-based algorithm improves computational efficiency and yields robust and consistent image registration results.