• Journal of IKEEE
• /
• v.23 no.2
• /
• pp.448-453
• /
• 2019

Under the conflicting objectives of maximum user satisfaction and fast launching, there exist great needs for automated mobile app testing. In automated app testing, detection of usage-state changes is one of the most important issues for minimizing human intervention and testing of various usage scenarios. Because conventional approaches utilizing pre-collected training examples can not handle the rapid evolution of apps, we propose a novel method detecting changes in usage-state through graph-entropy. In the proposed method, widgets in a screen shot are recognized through DNNs and 'onverted graphs. We compared the performance of the proposed method with a SIFT (Scale-Invariant Feature Transform) based method on 20 real-world apps. In most cases, our method achieved superior results, but we found some situations where further improvements are required.

• The KIPS Transactions:PartB
• /
• v.17B no.5
• /
• pp.333-344
• /
• 2010

This paper addresses the way to compose paronamic images from images taken the same objects. With the spread of digital camera, the panoramic image has been studied to generate with its interest. In this paper, we propose a panoramic image generation method using scaling and rotation invariant features. First, feature points are extracted from input images and matched with a RANSAC algorithm. Then, after the perspective model is estimated, the input image is registered with this model. Since the SURF feature extraction algorithm is adapted, the proposed method is robust against geometric distortions such as scaling and rotation. Also, the improvement of computational cost is achieved. In the experiment, the SURF feature in the proposed method is compared with features from Harris corner detector or the SIFT algorithm. The proposed method is tested by generating panoramic images using $640{\times}480$ images. Results show that it takes 0.4 second in average for computation and is more efficient than other schemes.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.699-706
• /
• 2015

In recent years, as near-duplicate image has been increasing explosively by the spread of Internet and image-editing technology that allows easy access to image contents, related research has been done briskly. However, BoF (Bag-of-Feature), the most frequently used method for near-duplicate image detection, can cause problems that distinguish the same features from different features or the different features from same features in the quantization process of approximating a high-level local features to low-level. Therefore, a post-verification method for BoF is required to overcome the limitation of vector quantization. In this paper, we proposed and analyzed the performance of a post-verification method for BoF, which converts SIFT (Scale Invariant Feature Transform) descriptors into 128 bits binary codes and compares binary distance regarding of a short ranked list by BoF using the codes. Through an experiment using 1500 original images, it was shown that the near-duplicate detection accuracy was improved by approximately 4% over the previous BoF method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2363-2371
• /
• 2015

In this paper, we propose a new feature matching algorithm which is robust to the viewpoint change by using the FAST(Features from Accelerated Segment Test) feature detector and the SIFT(Scale Invariant Feature Transform) feature descriptor. The original FAST algorithm unnecessarily results in many feature points along the edges in the image. To solve this problem, we apply the principal curvatures for refining it. We use the SIFT descriptor to describe the extracted feature points and calculate the homography matrix through the RANSAC(RANdom SAmple Consensus) with the matching pairs obtained from the two different viewpoint images. To make feature matching robust to the viewpoint change, we classify the matching pairs by calculating the Euclidean distance between the transformed coordinates by the homography transformation with feature points in the reference image and the coordinates of the feature points in the different viewpoint image. Through the experimental results, it is shown that the proposed algorithm has better performance than the conventional feature matching algorithms even though it has much less computational load.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.13-23
• /
• 2009

In this paper we propose an approach for localizing objects in satellite images. Our method exploits matching features based on description vectors. We applied Scale Invariant Feature Transform (SIFT) to object localization. First, we find keypoints of the satellite images and the objects and generate description vectors of the keypoints. Next, we calculate the similarity between description vectors, and obtain matched keypoints. Finally, we weight the adjacent pixels to the keypoints and determine the location of the matched object. The experiments of object localization by using SIFT show good results on various scale and affine transformed images. In this paper the proposed methods use Google Earth satellite images.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.927-934
• /
• 2014

In this paper, we propose an effective method for recognizing daily human activities from a stream of three dimensional body poses, which can be obtained by using Kinect-like RGB-D sensors. The body pose data provided by Kinect SDK or OpenNI may suffer from both the view variance problem and the scale variance problem, since they are represented in the 3D Cartesian coordinate system, the origin of which is located on the center of Kinect. In order to resolve the problem and get the view-invariant and scale-invariant features, we transform the pose data into the spherical coordinate system of which the origin is placed on the center of the subject's hip, and then perform on them the scale normalization using the length of the subject's arm. In order to represent effectively complex internal structures of high-level daily activities, we utilize Hidden state Conditional Random Field (HCRF), which is one of probabilistic graphical models. Through various experiments using two different datasets, KAD-70 and CAD-60, we showed the high performance of our method and the implementation system.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.5
• /
• pp.1639-1644
• /
• 2014

SAR satellite can acquire clear imagery regardless of weather and the images are widely used for land management, natural hazard monitoring and many other applications. Automatic image matching technique is necessary for management of a huge amount of SAR data. Nevertheless, it is difficult to assure the accuracy of image matching due to the difference of image-capturing attitude and time. In this paper, we compared performances of MI method, FMT method and SIFT method by applying arbitrary displacement and rotation to TerraSAR-X images and changing resolution of the images. As a result, when the features having specific intensity were distributed well in SAR imagery, MI method could assure 0~2 pixels accuracy even if the images were captured in different geometry. But the accuracy of FMT method was significantly poor for the images having different spatial resolutions and the error was represented by tens or hundreds pixels. Moreover, the ratio of corresponding matching points for SIFT method was only 0~17% and it was difficult for SIFT method to apply to SAR images captured in different geometry.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.1
• /
• pp.15-22
• /
• 2005

In this paper, we propose a face recognition system by using the CCD color image. We first get the face candidate image by using YCbCr color model and adaptive skin color information. And we use it initial curve of active contour model to extract face region. We use the Eye map and mouth map using color information for extracting facial feature from the face image. To obtain center point of Log-polar image, we use extracted facial feature from the face image. In order to obtain feature vectors, we use extracted coefficients from DCT and wavelet transform. To show the validity of the proposed method, we performed a face recognition using neural network with BP learning algorithm. Experimental results show that the proposed method is robuster with higher recogntion rate than the conventional method for the rotation and scale variant.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.163-172
• /
• 2014

The Scale Invariant Feature Transform (SIFT) has been widely used in a lot of applications for image feature matching. Such a transform allows us to strong matching ability, stability in rotation, and scaling with the variety of different scales. Recently, it has been made one of the most successful algorithms in the research areas of copy-move forgery detections. Though this transform is capable of identifying copy-move forgery, it does not widely address the possibility that counter-forensics operations may be designed and used to hide the evidence of image tampering. In this paper, we propose a targeted counter-forensics method for impeding SIFT-based copy-move forgery detection by applying a semantically admissible distortion in the processing tool. The proposed method allows the attacker to delude a similarity matching process and conceal the traces left by a modification of SIFT keypoints, while maintaining a high fidelity between the processed images and original ones under the semantic constraints. The efficiency of the proposed method is supported by several experiments on the test images with various parameter settings.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.10
• /
• pp.194-202
• /
• 1999

A method for pattern recognition based on wavelet transform is proposed in this paper. The boundary of the object to be recognized includes shape information for object of machine parts. The contour is first represented using a one-dimensional signal and normalized about translation, rotation and scale, then is used to build the wavelet transform representation of the object. Wavelets allow us to decompose a function into multi-resolution hierarchy of localized frequency bands. The recognition of 2-dimensional object based on the wavelet is described to analyze the shape of analysis technique; the discrete wavelet transform(DWT). The feature vectors obtained using wavelet analysis is classified using a multi-layer neural network. The results show that, compared with the use of fourier descriptors, recognition using wavelet is more stable and efficient representation. And particularly the performance for objects corrupted with noise is better than that of other method.