• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.375-380
• /
• 2014

Under controlled environment, such as fixed viewpoints or consistent illumination, the performance of face recognition is usually high enough to be acceptable nowadays. Face recognition is, however, a still challenging task in real world. SIFT(Scale Invariant Feature Transformation) algorithm is scale and rotation invariant, which is powerful only in the case of small viewpoint changes. However, it often fails when viewpoint of faces changes in wide range. In this paper, we use Affine SIFT (Scale Invariant Feature Transformation; ASIFT) to detect affine invariant local descriptors for face recognition under wide viewpoint changes. The ASIFT is an extension of SIFT algorithm to solve this weakness. In our scheme, ASIFT is applied only to gallery face, while SIFT algorithm is applied to probe face. ASIFT generates a series of different viewpoints using affine transformation. Therefore, the ASIFT allows viewpoint differences between gallery face and probe face. Experiment results showed our framework achieved higher recognition accuracy than the original SIFT algorithm on FERET database.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.4
• /
• pp.173-180
• /
• 2006

A key component of autonomous navigation of intelligent home robot is localization and map building with recognized features from the environment. To validate this, accurate measurement of relative location between robot and features is essential. In this paper, we proposed relative localization algorithm based on 3D reconstruction of scale invariant features of two images which are captured from two parallel cameras. We captured two images from parallel cameras which are attached in front of robot and detect scale invariant features in each image using SIFT(scale invariant feature transform). Then, we performed matching for the two image's feature points and got the relative location using 3D reconstruction for the matched points. Stereo camera needs high precision of two camera's extrinsic and matching pixels in two camera image. Because we used two cameras which are different from stereo camera and scale invariant feature point and it's easy to setup the extrinsic parameter. Furthermore, 3D reconstruction does not need any other sensor. And the results can be simultaneously used by obstacle avoidance, map building and localization. We set 20cm the distance between two camera and capture the 3frames per second. The experimental results show :t6cm maximum error in the range of less than 2m and ${\pm}15cm$ maximum error in the range of between 2m and 4m.

• Smart Structures and Systems
• /
• v.14 no.5
• /
• pp.831-845
• /
• 2014

This paper proposed a discrete wavelet transform based method for time-varying physical parameter identification of shear type structures. The time-varying physical parameters are dispersed and expanded at multi-scale as profile and detail signal using discrete wavelet basis. To reduce the number of unknown quantity, the wavelet coefficients that reflect the detail signal are ignored by setting as zero value. Consequently, the time-varying parameter can be approximately estimated only using the scale coefficients that reflect the profile signal, and the identification task is transformed to an equivalent time-invariant scale coefficient estimation. The time-invariant scale coefficients can be simply estimated using regular least-squares methods, and then the original time-varying physical parameters can be reconstructed by using the identified time-invariant scale coefficients. To reduce the influence of the ill-posed problem of equation resolving caused by noise, the Tikhonov regularization method instead of regular least-squares method is used in the paper to estimate the scale coefficients. A two-story shear type frame structure with time-varying stiffness and damping are simulated to validate the effectiveness and accuracy of the proposed method. It is demonstrated that the identified time-varying stiffness is with a good accuracy, while the identified damping is sensitive to noise.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.781-784
• /
• 2014

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 use Affine SIFT to detect affine invariant local descriptors for face recognition under large viewpoint change. Affine SIFT is an extension of SIFT algorithm. SIFT algorithm is scale and rotation invariant, which is powerful for small viewpoint changes in face recognition, but it fails when large viewpoint change exists. In our scheme, Affine SIFT is used for both gallery face and probe face, which generates a series of different viewpoints using affine transformation. Therefore, Affine SIFT allows viewpoint difference between gallery face and probe face. Experiment results show our framework achieves better recognition accuracy than SIFT algorithm on FERET database.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.3 no.2
• /
• pp.88-100
• /
• 2000

The design of an automatic aircraft recognition system involves two parts. The first part is extraction of invariant features independent of scale, rotation and translation. The second part is determination of optimal decision procedures, which are needed in the classification process. In this research, we extracted invariant aircraft features regardless of size, rotation and translation using Fourier Descriptors and Zernike Moments and classified using neural networks.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.141-143
• /
• 2004

This paper presents an algorithm in which a feature map is built and localization of a mobile robot is carried out for indoor environments. The algorithm proposes an approach which extracts scale-invariant features of natural landmarks from a pair of stereo images. The feature map is built using these features and updated by merging new landmarks into the map and removing transient landmarks over time. And the position of the robot in the map is estimated by comparing with the map in a database by means of an Extended Kalman filter. This algorithm is implemented and tested using a Pioneer 2-DXE and preliminary results are presented in this paper.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.201-212
• /
• 2009

Even though the spread spectrum method is known as most robust algorithm to general attacks, it has a drawback to the time axis attack. In this paper, I proposed a robust audio copyright protection algorithm which is robust to the time axis attack and has advantages of the spread spectrum method. Time axis attack includes the audio length variation attack with same pitch and the audio frequency variation attack. In order to detect the embedded watermark by the spread spectrum method, the detection algorithm should know the exact rate of the time axis attack. Even if there is a method to know the rate, it needs heavy computational resource and it is not possible to implement. In this paper, solving this problem, the audio signal is transformed into time-invariant domain, and the spread spectrum watermark is embedded into the audio in the domain. Therefore the proposed algorithm has the advantages of the spread spectrum method and it is also robust to the time axis attack. The time-invariant domain process is that the audio is arranged by log scale time axis, and then, the Fourier transform is taken to the audio in the log scale time axis. As a result, the algorithm can get the time-invariant watermark signal.

• Honam Mathematical Journal
• /
• v.32 no.4
• /
• pp.633-642
• /
• 2010

In this note, we introduce the definition of the generalized analogue of Wiener measure on the space C[a, b] of all real-valued continuous functions on the closed interval [a, b], give several examples of it and investigate some important properties of it - the Fernique theorem and the existence theorem of scale-invariant measurable subsets on C[a, b].

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.8
• /
• pp.818-822
• /
• 2009

In this paper, we consider a decentralized observer design problem for fault detection in large-scaled linear time-invariant systems. Since the fault detection residual is desired to be sensitive on the fault, we use the H_ index performance criterion. Sufficient conditions for the existence of such an observer is presented in terms of linear matrix inequalities. Simulation results show the effectiveness of the proposed method.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.01a
• /
• pp.59-60
• /
• 2020

본 논문에서는 특징점 추출 알고리즘 중 SIFT(Scale Invariant Feature Transform)알고리즘을 사용하여 유의미한 특징점을 추출하기 위한 방법을 제안하고자한다. 추출된 특징점을 실제 이미지에 display 해봄으로써 성능을 확인해본다.