• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.201-209
• /
• 2011

This paper suggests a panorama image stitching system which consists of an image matching algorithm: modified SURF (Speeded Up Robust Feature) and an image blending algorithm: multi-band blending. In this paper, first, Modified SURF is described and SURF is compared with SIFT (Scale Invariant Feature Transform), which also gives the reason why modified SURF is chosen instead of SIFT. Then, multi-band blending is described, Lastly, the structure of a panorama image stitching system is suggested and evaluated by experiments, which includes stitching quality test and time cost experiment. According to the experiments, the proposed system can make the stitching seam invisible and get a perfect panorama for large image data, In addition, it is faster than the sift based stitching system.

• International Journal of Contents
• /
• v.9 no.2
• /
• pp.1-7
• /
• 2013

This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2893-2912
• /
• 2013

The design of geometrically invariant watermarking is one of the most challenging work in digital image watermarking research area. To achieve the robustness to geometrical attacks, the inherent characteristic of an image is usually used. In this paper, a geometrically invariant image watermarking scheme using connected objects and gravity center is proposed. First, the gray-scale image is converted into the binary one, and the connected objects according to the connectedness of binary image are obtained, then the coordinates of these connected objects are mapped to the gray-scale image, and the gravity centers of those bigger objects are chosen as the feature points for watermark embedding. After that, the line between each gravity center and the center of the whole image is rotated an angle to form a sector, and finally the same version of watermark is embedded into these sectors. Because the image connectedness is topologically invariant to geometrical attacks such as scaling and rotation, and the gravity center of the connected object as feature points is very stable, the watermark synchronization is realized successfully under the geometrical distortion. The proposed scheme can extract the watermark information without using the original image or template. The simulation results show the proposed scheme has a good invisibility for watermarking application, and stronger robustness than previous feature-based watermarking schemes against geometrical attacks such as rotation, scaling and cropping, and can also resist common image processing operations including JPEG compression, adding noise, median filtering, and histogram equalization, etc.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.241-252
• /
• 2000

In this paper, a translation, rotation and scale invariant system for the recognition of closed 2-D images using the bispectrum of a contour sequence and a weighted fuzzy classifier is derived and compared with the recognition process using one of the competitive neural algorithm, called a LVQ( Loaming Vector Quantization). The bispectrum based on third order cumulants is applied to the contour sequences of an image to extract fifteen feature vectors for each planar image. These bispectral feature vectors, which are invariant to shape translation, rotation and scale transformation, can be used to the represent two-dimensional planar images and are fed into a weighted fuzzy classifier. The experimental processes with eight different shapes of aircraft images are presented to illustrate a relatively high performance of the proposed recognition system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.116-122
• /
• 2010

This paper proposes a method for classifying targets robust to geometric transformations of targets such as rotation, scale change, translation, and pose change. Targets which have rotation, scale change, and shift is firstly classified based on CM(Confidence Map) which is generated by similarity, scale ratio, and range of orientation for SIFT(Scale-Invariant Feature Transform) feature vectors. On the other hand, DB(DataBase) which is acquired in various angles is used to deal with pose variation of targets. Range of the angle is determined by comparing and analyzing the execution time and performance for sampling intervals. We experiment on various images which is geometrically changed to evaluate performance of proposed target classification method. Experimental results show that the proposed algorithm has a good classification performance.

• Korean Journal of Remote Sensing
• /
• v.34 no.5
• /
• pp.739-747
• /
• 2018

Integration analysis of multi-sensor satellite images is becoming increasingly important. The first step in integration analysis is image registration between multi-sensor. SIFT (Scale Invariant Feature Transform) is a representative image registration method. However, optical image and SAR (Synthetic Aperture Radar) images are different from sensor attitude and radiation characteristics during acquisition, making it difficult to apply the conventional method, such as SIFT, because the radiometric characteristics between images are nonlinear. To overcome this limitation, we proposed a modified method that combines the SAR-SIFT method and shape descriptor vector DLSS(Dense Local Self-Similarity). We conducted an experiment using two pairs of Cosmo-SkyMed and KOMPSAT-2 images collected over Daejeon, Korea, an area with a high density of buildings. The proposed method extracted the correct matching points when compared to conventional methods, such as SIFT and SAR-SIFT. The method also gave quantitatively reasonable results for RMSE of 1.66m and 2.45m over the two pairs of images.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.527-534
• /
• 2005

Rotation and scale variations make it difficult to solve the problem of shape description and recognition because these variations change the location of points composing the shape. However, some geometric Invariant points and the relations among them are not changed by these variations. Therefore, if points in image space depicted with the r-y coordinates system can be transformed into a new coordinates system that are invariant to rotation and scale, the problem of shape description and recognition becomes easier. This paper presents a shape description method via transformation from the image space into the invariant feature space having two axes: representing relative distance from a centroid and contour segment curvature(CSC). The relative distance describes how far a point departs from the centroid, and the CSC represents the degree of fluctuation in a contour segment. After transformation, mesh features were used to describe the shape mapped onto the feature space. Experimental results show that the proposed method is robust to rotation and scale variations.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.51-58
• /
• 2008

In this paper, we propose a place modeling based on the distribution of scale-invariant features, and a place recognition method that recognizes places by comparing the place model in a database with the extracted features from input data. The proposed method is based on the assumption that every place can be represented by unique feature distributions that are distinguishable from others. The proposed method uses global information of each place where one place is represented by one distribution model. Therefore, the main contribution of the proposed method is that the time cost corresponding to the increase of the number of places grows linearly without increasing exponentially. For the performance evaluation of the proposed method, the different number of frames and the different number of features are used, respectively. Empirical results illustrate that our approach achieves better performance in space and time cost comparing to other approaches. We expect that the Proposed method is applicable to many ubiquitous systems such as robot navigation, vision system for blind people, wearable computing, and so on.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.10
• /
• pp.1062-1068
• /
• 2014

In this paper, a novel approach estimating target's rotation velocity(RV) is proposed for inverse synthetic aperture radar(ISAR) cross-range scaling(CRS). Scale invariant feature transform(SIFT) is applied to two sequently generated ISAR images for extracting non-fluctuating scatterers. Considering the fact that the distance between target's rotation center(RC) and SIFT features is same, we can set a criterion for estimating RV. Then, the criterion is optimized through the proposed method based on particle swarm optimization(PSO) combined with exhaustive search method. Simulation results show that the proposed algorithm can precisely estimate RV of a scenario based maneuvering target without RC information. With the use of the estimated RV, ISAR image can be correctly re-scaled along the cross-range direction.