• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.600-619
• /
• 2015

We propose a cost-efficient hybrid algorithm for online location updates that efficiently combines feature point detection with the online trajectory-based sampling algorithm. Our algorithm is designed to minimize the average trajectory error with the minimal number of sample points. The algorithm is composed of 3 steps. First, we choose corner points from the map as sample points because they will most likely cause fewer trajectory errors. By employing the online trajectory sampling algorithm as the second step, our algorithm detects several missing and important sample points to prevent unwanted trajectory errors. The final step improves cost efficiency by eliminating redundant sample points on straight paths. We evaluate the proposed algorithm with real GPS trajectory data for various bus routes and compare our algorithm with the existing one. Simulation results show that our algorithm decreases the average trajectory error 28% compared to the existing one. In terms of cost efficiency, simulation results show that our algorithm is 29% more cost efficient than the existing one with real GPS trajectory data.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.11
• /
• pp.937-942
• /
• 2003

We present a self-localization method for mobile robots using vertical line features of indoor environment. When a 2D map including feature points and color information is given, a mobile robot moves to the destination, and acquires images from the surroundings having vertical line edges by one camera. From the image, vertical line edges are detected, and pattern vectors meaning averaged color values of the left and right regions of the each line are computed by using the properties of the line and a region growing method. The pattern vectors are matched with the feature points of the map by comparing the color information and the geometrical relationship. From the perspective transformation and rigid transformation of the corresponded points, nonlinear equations are derived. Localization is carried out from solving the equations by using Newton's method. Experimental results show that the proposed method using mono view is simple and applicable to indoor environment.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.2
• /
• pp.165-172
• /
• 2020

There is growing interest in Vision-based video image matching owing to the constantly developing technology of unmanned-based systems. The purpose of this paper is the development of a fast and effective matching technique for the UAV oblique video image. We first extracted initial matching points using NCC (Normalized Cross-Correlation) algorithm and improved the computational efficiency of NCC algorithm using integral image. Furthermore, we developed a triangulation-based outlier removal algorithm to extract more robust matching points among the initial matching points. In order to evaluate the performance of the propose method, our method was quantitatively compared with existing image matching approaches. Experimental results demonstrated that the proposed method can process 2.57 frames per second for video image matching and is up to 4 times faster than existing methods. The proposed method therefore has a good potential for the various video-based applications that requires image matching as a pre-processing.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.306-309
• /
• 1996

This paper presents a method of landmark recognition in indoor environments using a neural-network for an autonomous mobile robot. In order to adapt to image deformation of a landmark resulted from variations of view-points and distances, a multi-labeled template matching(MLTM) method and a dynamic area search method(DASM) are proposed. The MLTM is. used for matching an image template with deformed real images and the DASM is proposed to detect correct feature points among incorrect feature points. Finally a feed-forward neural-network using back-propagation algorithm is adopted for recognizing the landmark.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.4
• /
• pp.524-531
• /
• 2009

In this paper, we propose an automatic image registration method for multi-sensor image fusion such as visible and infrared images. The registration is achieved by finding corresponding feature points in both input images. In general, the global statistical correlation is not guaranteed between multi-sensor images, which bring out difficulties on the image registration for multi-sensor images. To cope with this problem, mutual information is adopted to measure correspondence of features and to select faithful points. An update algorithm for projective transform is also proposed. Experimental results show that the proposed method provides robust and accurate registration results.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.1
• /
• pp.42-48
• /
• 1994

Recently pictorial information processing has become increasingly important So, this paper described that feature points of fingerprint used to recognize fingerprints for identification in a government or arresting criminals in an institution like a police station related to crime. We apply an algorithm based on minimization of fuzzy theory to thinning and then the image into a certain size of squares. We have got some information about cores and deltas from the data encoding Into one of the eight directional codes. We could extract about $80\%$ feature points as the result of the experiment.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.559-563
• /
• 2000

In this paper we describe a method for aligning a robot gripper using image information. The region of gripper is represented from HSI color model that has major advantage of brightness independence. In order to extract the feature points for vision based position control, we find the corners of gripper shape using polygonal approximation method which determines the segment size and curvature of each points. We apply the vision based scheme to the task of alignment of gripper to reach the desired position by 2 RGB cameras. Experiments are carried out to exhibit the effectiveness of vision based control using feature points from polygonal approximation of gripper.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.93-100
• /
• 2001

The three dimensional(3D) reconstruction from two dimensional(2D) image data is using in many fields such as RPD(Rapid Product Development) and reverse engineering. In this paper, the main step of 3D reconstruction is comprised of two steps : image processing step and B-spline surface approximation step. In the image processing step, feature points of each cross-section are obtained by means of several image processing technologies. In the B-spline surface approximation step, using the data of feature points obtained in the image processing step, the control points of B-spline surface are obtained, which are used for IGES file of 3D CAD model.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.1-8
• /
• 2005

Facial analysis is used in many applications like face recognition systems, human-computer interface through head movements or facial expressions, model based coding, or virtual reality. In all these applications a very precise extraction of facial feature points are necessary. In this paper we presents a method for automatic extraction of the facial features Points such as mouth corners, eye corners, eyebrow corners. First, face region is detected by AdaBoost-based object detection algorithm. Then a combination of three kinds of feature energy for facial features are computed; valley energy, intensity energy and edge energy. After feature area are detected by searching horizontal rectangles which has high feature energy. Finally, a corner detection algorithm is applied on the end region of each feature area. Because we integrate three feature energy and the suggested estimation method for valley energy and intensity energy are adaptive to the illumination change, the proposed feature extraction method is robust under various conditions.