• Journal of the Chungcheong Mathematical Society
• /
• v.14 no.2
• /
• pp.27-35
• /
• 2001

We shall deal with ten cases out of 15 distinct almost Bieberbach groups up to Seifert local invariant. In those cases we will show that if G is a finite abelian group acting freely on the standard nilmanifold, then G is cyclic, up to topological conjugacy.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.171-182
• /
• 2009

In this paper, we consider the parameter space of the rational plane curves with uni-branched singularity. We show that such a parameter space is decomposable into irreducible components which are rational varieties. Rational parametrizations of the irreducible components are given in a constructive way, by a repeated use of Abhyankar-Moh Epimorphism Theorem. We compute an enumerative invariant of this parameter space, and include explicit computational examples to recover some classically-known invariants.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.1-10
• /
• 2002

This paper presents the new template based human face recognition methods to improve the recognition performance against scale and in-plane rotation variations of face images. To enhance the recognition performance, the templates are generated by linear or nonlinear operation on multiple images including different scales and rotations of faces. As the invariant features to allow for scale and rotation variations of face images, we adopt the affine transformation, the log-polar mapping, and the log-polar image based FFT. The proposed recognition methods are evaluated in terms of the recognition rate and the processing time. Experimental results show that the proposed template based methods lead to higher recognition rate than the single image based one. The affine transformation based face recognition method shows marginally higher recognition rate than those of the log-polar mapping based method and the log-polar image based FFT, while, in the aspect of processing time, the log-polar mapping based method is the fastest one.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.5
• /
• pp.477-486
• /
• 2020

Drone has been widely used for many applications ranging from amateur and leisure to professionals to get fast and accurate 3-D information of the surface of the interest. Most of commercial softwares developed for this purpose are performing automatic matching based on SIFT (Scale Invariant Feature Transform) or SURF (Speeded-Up Robust Features) using nadir-looking stereo image sets. Since, there are some situations where not only nadir and nadir-looking matching, but also nadir and oblique-looking matching is needed, the existing software for the latter case could not get good results. In this study, a matching experiment was performed to utilize images with differences in geometry. Nadir and oblique-looking images were acquired through drone for a total of 2 times. SIFT, SURF, which are feature point-based, and IMAS (Image Matching by Affine Simulation) matching techniques based on affine transformation were applied. The experiment was classified according to the identity of the geometry, and the presence or absence of a building was considered. Images with the same geometry could be matched through three matching techniques. However, for image sets with different geometry, only the IMAS method was successful with and without building areas. It was found that when performing matching for use of images with different geometry, the affine transformation-based matching technique should be applied.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.536-538
• /
• 2006

The most important factor of mobile robot is to build a map for surrounding environment and estimate its localization. This paper proposes a real-time localization and map building method through 3-D reconstruction using scale invariant feature from monocular camera. Mobile robot attached monocular camera looking wall extracts scale invariant features in each image using SIFT(Scale Invariant Feature Transform) as it follows wall. Matching is carried out by the extracted features and matching feature map that is transformed into absolute coordinates using 3-D reconstruction of point and geometrical analysis of surrounding environment build, and store it map database. After finished feature map building, the robot finds some points matched with previous feature map and find its pose by affine parameter in real time. Position error of the proposed method was maximum. 8cm and angle error was within $10^{\circ}$.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.5
• /
• pp.409-416
• /
• 2006

To use image data obtained from different sensors and different techniques, the preprocessing step that registers them in a common coordinate system is needed. For this purpose, we developed the methodology to register middle- and low-resolution satellite images automatically. Firstly, candidate matching points were extracted using the Harris and Harris-affine algorithm. Secondly, we used the correlation coefficient, normalized correlation coefficient and SIFT algorithm to detect conjugate matching points from candidates. Then, to test the feasibility of approaches, we applied the developed methodology to various kinds of satellite images and compared results. The results clearly demonstrate that the methology using the SIFT is appropriate to register these multi-resolution satellite images automatically, compared with the classical cross-correlation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.411-418
• /
• 2006

There are mainly two types of bang-bang controllers for nominal linear time-invariant (LTI) system. Optimal bang-bang controller is designed based on optimal control theory and suboptimal bang-bang controller is obtained by using Lyapunov stability condition. In this paper, the suboptimal bang-bang control method is extended to LTI system involving both control input saturation and structured real parameter uncertainties by using Lyapunov robust stability condition. Two robust optimal bang-bang controllers are derived by minimizing the time derivative of Lyapunov function subjected to the limit of control input. The one is developed based on the classical quadratic stability(QS), and the other is developed based on the affine quadratic stability(AQS). And characteristics of the two controllers are compared. Especially, bounds of parameter uncertainties which theoretically guarantee robust stability of the two controllers are compared quantitatively for 1DOF vibrating system. Moreover, the validity of robust optimal bang-bang controller based on the AQS is shown through numerical simulations for this system.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.6-8
• /
• 2005

Study that uses geometrical information in computer vision is lively. Problem that should be preceded is matching problem before studying. Feature point should be extracted for well matching. There are a lot of methods that extract feature point from former days are studied. Because problem does not exist algorithm that is applied for all images, it is a hot water. Specially, it is not easy to find feature point in endoscope image. The big problem can not decide easily a point that is predicted feature point as can know even if see endoscope image as eyes. Also, accuracy of matching problem can be decided after number of feature points is enough and also distributed on whole image. In this paper studied algorithm that can apply to endoscope image. SIFT method displayed excellent performance when compared with alternative way (Affine invariant point detector etc.) in general image but SIFT parameter that used in general image can't apply to endoscope image. The gual of this paper is abstraction of feature point on endoscope image that controlled by contrast threshold and curvature threshold among the parameters for applying SIFT method on endoscope image. Studied about method that feature points can have good distribution and control number of feature point than traditional alternative way by controlling the parameters on experiment result.

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