• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.643-654
• /
• 2015

Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we propose using the combination of Affine Scale Invariant Feature Transform (SIFT) and Probabilistic Similarity for face recognition under a large viewpoint change. Affine SIFT is an extension of SIFT algorithm to detect affine invariant local descriptors. Affine SIFT generates a series of different viewpoints using affine transformation. In this way, it allows for a viewpoint difference between the gallery face and probe face. However, the human face is not planar as it contains significant 3D depth. Affine SIFT does not work well for significant change in pose. To complement this, we combined it with probabilistic similarity, which gets the log likelihood between the probe and gallery face based on sum of squared difference (SSD) distribution in an offline learning process. Our experiment results show that our framework achieves impressive better recognition accuracy than other algorithms compared on the FERET database.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.111-122
• /
• 2010

In this study, a length adjustment algorithm for cyclic signals in manufacturing process using Time Invariant Feature point Extraction and Matching(TIFEM) is proposed. In order to precisely compensate the length of cyclic signals which have irregular length in the middle of signal as well as in the full length more feature points are needed. The extracted feature must involve information about the pattern of signal and should have invariant properties on time and scale. The proposed TIFEM algorithm extracts features having the intrinsic properties of the signal characteristics at first. By using those extracted features, feature vector is constructed for each time point. Among those extracted features, the only effective features are filtered and are chosen such as basis for the length adjustment. And then the partial length adjustment is performed by matching feature points. To verify the performance of the proposed algorithm, the experiments were performed with the experimental data mimicking the three kinds of signals generated from the actual semiconductor process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.10
• /
• pp.957-966
• /
• 2014

Video Stabilization For Vehicular Applications Is An Important Method Of Removing Unwanted Shaky Motions From Unstable Videos. In This Paper, An Improved Video Stabilization Method With Image Stitching Has Been Proposed. Scale Invariant Feature Transform (Sift) Matching Is Used To Calculate The New Position Of The Points In Next Frame. Image Stitching Is Done In Every Frame To Get Stabilized Frames To Provide Stable Video As Well As A Better Understanding Of The Previous Frame'S Position And Show The Surrounding Objects Together. The Computational Complexity Of Sift (Scale-Invariant Feature Transform) Is Reduced By Reducing The Sift Descriptors Size And Resticting The Number Of Keypints To Be Extracted. Also, A Modified Matching Procedure Is Proposed To Improve The Accuracy Of The Stabilization.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.198-207
• /
• 1996

A PSRI (position, scale, and rotation invariant ) feature extraction and automatic target recognition system using a cooperative network and an MLP is proposed. We can extract position invarient features by obtaining the target center using the projection and the moment in preprocessing stage. The scale and rotation invariant features are extracted from the contour projection of the number of edge pixels on each of the concentric circles, which is input to the cooperative network. By extracting the representative PSRI features form the features and their differentiations using max-net and min-net, we can rdduce the number of input neurons of the MLP, and make the resulted automatic target recognition system less sensitive to input variances. Experiments are conduted on various complex images which are shifted, rotated, or scaled, and the results show that the proposed system is very efficient for PSRI feature extractions and automatic target recognitions.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.4
• /
• pp.26-35
• /
• 2003

For the recognizing system to be classified the same or different images in the nature the rotation, scale and transition invariant features is to be necessary. There are many investigations to get the feature for the recognition system and the log-polar transform which is to be get the invariant feature for the scale and rotation is used. In this paper, we suggested the character recognition methods which are used the centroid method and the log-polar transform with the interpolation to get invariant features for the character recognition system and obtained the results of the above 50% differential ratio for the character features. And we obtained the about 90% recognition ratio from the suggested character recognition system using the BPEJTC which is used the invariant feature from the Mellin transform method for the reference image. and can be recognized the scaled and rotated input character. Therefore, we suggested the image character recognition system using the Mellin transform method and the BPEJTC is possible to recognize with the invariant feature for rotation scale and transition.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.482-486
• /
• 2009

Scale-invariant feature is an effective method for retrieving and classifying images. In this study, we analyze a scale-invariant planar curve features for developing 2D shapes. Scale-space filtering is used to determine contour structures on different scales. However, it is difficult to track significant points on different scales. In mathematics, curvature is considered to be fundamental feature of a planar curve. However, the curvature of a digitized planar curve depends on a scale. Therefore, automatic scale detection for curvature analysis is required for practical use. We propose a technique for achieving automatic scale detection based on difference of curvature. Once the curvature values are normalized with regard to the scale, we can calculate difference in the curvature values for different scales. Further, an appropriate scale and its position are detected simultaneously, thereby avoiding tracking problem. Appropriate scales and their positions can be detected with high accuracy. An advantage of the proposed method is that the detected significant points do not need to be located in the same contour. The validity of the proposed method is confirmed by experimental results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.4
• /
• pp.231-238
• /
• 2017

Detecting small infrared targets from the low-SCR images at a long distance is very hard. The previous Local Contrast Method (LCM) algorithm based on the human visual system shows a superior performance of detecting small targets by a background suppression technique through local contrast measure. However, its slow processing speed due to the heavy multi-scale processing overhead is not suitable to a variety of real-time applications. This paper presents a lightweight real-time small target detection algorithm, called by the Improved Selective Local Contrast Method (ISLCM), to reduce the scale-invariant computational overhead. The proposed ISLCM applies the improved local contrast measure to the predicted selective region so that it may have a comparable detection performance as the previous LCM while guaranteeing low scale-invariant computational load by exploiting both adaptive scale estimation and small target feature feasibility. Experimental results show that the proposed algorithm can reduce its computational overhead considerably while maintaining its detection performance compared with the previous LCM.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.3
• /
• pp.353-359
• /
• 2010

In this paper, we propose the automatic image-to-image registration of high resolution satellite images using local properties of tie points to improve the registration accuracy. A spatial distance between interest points of reference and sensed images extracted by Scale Invariant Feature Transform(SIFT) is additionally used to extract tie points. Coefficients of affine transform between images are extracted by invariant descriptor based matching, and interest points of sensed image are transformed to the reference coordinate system using these coefficients. The spatial distance between interest points of sensed image which have been transformed to the reference coordinates and interest points of reference image is calculated for secondary matching. The piecewise linear function is applied to the matched tie points for automatic registration of high resolution images. The proposed method can extract spatially well-distributed tie points compared with SIFT based method.

• Journal of the HCI Society of Korea
• /
• v.2 no.2
• /
• pp.35-43
• /
• 2007

This paper presents a system for image matching and recognition based on image feature detection and description techniques from artificial satellite photographs. We propose some kind of parameters from the varied environmental elements happen by image handling process. The essential point of this experiment is analyzes that affects match rate and recognition accuracy when to change of state of each parameter. The proposed system is basically inspired by Lowe's SIFT(Scale-Invariant Transform Feature) algorithm. The descriptors extracted from local affine invariant regions are saved into database, which are defined by k-means performed on the 128-dimensional descriptor vectors on an artificial satellite photographs from Google earth. And then, a label is attached to each cluster of the feature database and acts as guidance for an appeared building's information in the scene from camera. This experiment shows the various parameters and compares the affected results by changing parameters for the process of image matching and recognition. Finally, the implementation and the experimental results for several requests are shown.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.5
• /
• pp.383-392
• /
• 2007

This study focuses on co-registration and band selection, which are one of the pre-processing steps to apply the change detection technique using hyperspectral images. We carried out automatic co-registration by using the SIFT algorithm which performance was already established in the computer vision fields, and selected the bands fur change detection by estimating the noise of image through the PIFs reflecting the radiometric consistency. The EM algorithm was also applied to select the band objectively. Hyperion images were used for the proposed techniques, and non-calibrated bands and striping noises contained in Hyperion image were removed. Throughout the results, we could develop the reliable co-registration procedure which coincided with accuracy within 0.2 pixels (RMSE) for change detection, and verified that band selection depending on the visual inspection could be objective by extracting the PIFs.