• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.4
• /
• pp.463-469
• /
• 2010

Since MOLA(Mars Orbiter Laser Altimeter) data, which provides altimetry data for Mars, does not cover the whole Mars area, image matching with MOC imagery should be implemented for the generation of DEM. However, automatic image matching is difficult because of insufficient features and low contrast. In this paper, we present the area based semi-automatic image matching algorithm with MOC-NA(Mars Orbiter Camera ? Narrow Angle) imagery. To accomplish this, seed points describing conjugate points are manually added for the stereo imagery, and interesting points are automatically produced by using such seed points. Produced interesting points being used as initial conjugate points, area based image matching is implemented. For the points which fail to match, the locations of initial conjugate points are recalculated by using matched six points and image matching process is re-implemented. The quality assessment by reversing the role of target and search image shows 97.5 % of points were laid within one pixel absolute difference.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.234-237
• /
• 2007

Road networks are important geospatial databases for various GIS (Geographic Information System) applications. Road digital maps may contain geometric spatial errors due to human and scanning errors, but manually updating roads information is time consuming. In this paper, we developed a new road features updating methodology using from multispectral high-resolution satellite image and pre-existing vector map. The approach is based on initial seed point generation using line segment matching and a modified double snake algorithm. Firstly, we conducted line segment matching between the road vector data and the edges of image obtained by Canny operator. Then, the translated road data was used to initialize the seed points of the double snake model in order to refine the updating of road features. The double snake algorithm is composed of two open snake models which are evolving jointly to keep a parallel between them. In the proposed algorithm, a new energy term was added which behaved as a constraint. It forced the snake nodes not to be out of potential road pixels in multispectral image. The experiment was accomplished using a QuickBird pan-sharpened multispectral image and 1:5,000 digital road maps of Daejeon. We showed the feasibility of the approach by presenting results in this urban area.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.113-115
• /
• 2005

This thesis presents a method for 3D modeling of facial expression from frontal and mirror-reflected multi-image. Since the proposed system uses only one camera, two mirrors, and simple mirror's property, it is robust, accurate and inexpensive. In addition, we can avoid the problem of synchronization between data among different cameras. Mirrors located near one's cheeks can reflect the side views of markers on one's face. To optimize our system, we must select feature points of face intimately associated with human's emotions. Therefore we refer to the FDP (Facial Definition Parameters) and FAP (Facial Animation Parameters) defined by MPEG-4 SNHC (Synlhetic/Natural Hybrid Coding). We put colorful dot markers on selected feature points of face to detect movement of facial deformation when subject makes variety expressions. Before computing the 3D coordinates of extracted facial feature points, we properly grouped these points according to relative part. This makes our matching process automatically. We experiment on about twenty koreans the subject of our experiment in their late twenties and early thirties. Finally, we verify the performance of the proposed method tv simulating an animation of 3D facial expression.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.2067-2078
• /
• 2017

In this paper, a new face tracking algorithm is proposed. The CamShift (Continuously adaptive mean SHIFT) algorithm shows unstable tracking when there exist objects with similar color to that of face in the background. This drawback of the CamShift is resolved by the proposed algorithm using Kinect's pixel-by-pixel depth information and the skin detection method to extract candidate skin regions in HSV color space. Additionally, even when the target face is disappeared, or occluded, the proposed algorithm makes it robust to this occlusion by the feature point matching. Through experimental results, it is shown that the proposed algorithm is superior in tracking performance to that of existing TLD (Tracking-Learning-Detection) algorithm, and offers faster processing speed. Also, it overcomes all the existing shortfalls of CamShift with almost comparable processing time.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.621-624
• /
• 1999

This paper describes a distance estimation method of object's motion in soccer image sequence by tracking field features. And we quantitatively evaluate the estimation accuracy We suppose that the input image sequence is taken with a camera on static axis and includes only zooming and panning transformation between frames. Adaptive template matching is adopted for non-rigid object tracking. For background compensation, feature templates selected from reference frame image are matched in following frames and the matched feature point pairs are used in computing Affine motion parameters. A perspective displacement field model is used for estimating the real distance between two position on Input Image. To quantitatively evaluate the accuracy of the estimation, we synthesized a 3 dimensional virtual stadium with graphic tools and experimented on the synthesized 2 dimensional image sequences. The experiment shows that the average of the error between the actual moving distance and the estimated distance is 1.84%.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2222-2224
• /
• 1998

This paper presents a 3D feature extraction method using rough set theory. Using the stereo cameras, we obtain the raw images and then perform several processes including gradient computation and image matching process. Decision rule constructed via rough set theory determines whether a ceratin point in the image is 3D edge or not. We propose a method finding rules for 3D edge extraction using rough set.

• The Journal of Korea Robotics Society
• /
• v.18 no.3
• /
• pp.260-270
• /
• 2023

We introduce a novel Visual Inertial Odometry (VIO) algorithm designed to improve the performance of thermal-inertial odometry. Thermal infrared image, though advantageous for feature extraction in low-light conditions, typically suffers from a high noise level and significant information loss during the 8-bit conversion. Our algorithm overcomes these limitations by approximating a 14-bit raw pixel histogram into a Gaussian mixture model. The conversion method effectively emphasizes image regions where texture for visual tracking is abundant while reduces unnecessary background information. We incorporate the robust learning-based feature extraction and matching methods, SuperPoint and SuperGlue, and zero velocity detection module to further reduce the uncertainty of visual odometry. Tested across various datasets, the proposed algorithm shows improved performance compared to other state-of-the-art VIO algorithms, paving the way for robust thermal-inertial odometry.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.3
• /
• pp.275-279
• /
• 2013

Recently, as multimedia information becomes popular, there are many studies to retrieve images based on images in the web. However, it is hard to find the matching images which users want to find because of various patterns in images. In this paper, we suggest an efficient images retrieval system based on images for finding products in internet shopping malls. We extract features for image retrieval by using SIFT (Scale Invariant Feature Transform) algorithm, repeat keypoint matching in various dimension by using PCA-SIFT, and find the image which users search for by combining them. To verify efficiency of the proposed method, we compare the performance of our approach with that of SIFT and PCA-SIFT by using images with various patterns. We verify that the proposed method shows the best distinction in the case that product labels are not included in images.

• Korean Journal of Remote Sensing
• /
• v.32 no.6
• /
• pp.693-701
• /
• 2016

To make a mosaicked image, we need to estimate the geometric relationship between individual images. For such estimation, we needs tiepoint information. In general, feature-based methods are used to extract tiepoints. However, in the case of textureless images, feature-based methods are hardly applicable. In this paper, we propose a frequency domain matching method for automated mosaicking of textureless images. There are three steps in the proposed method. The first step is to convert color images to grayscale images, remove noise, and extract edges. The second step is to define a Region Of Interest (ROI). The third step is to perform phase correlation between two images and select the point with best correlation as tiepoints. For experiments, we used GOCI image slots and general frame camera images. After the three steps, we produced reliable tiepoints from textureless as well as textured images. We have proved application possibility of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.129-137
• /
• 2004

This paper presents a signature verification method that uses Gabor filter in computing similarity between signatures. In computing similarity to compare two on-line signatures, the temporal relationship between two signatures should be computed in advance. However, conventional point matching method using DP(dynamic programming) matching consumes much computation. In this paper, we propose a fast method for computing the temporal relationship between two on-line signatures by using the phase output of Gabor Inter applied on the on-line signature signals. Two similarity measures are defined in the method: Temporal Similarity and Temporally Arranged Feature Profile Similarity. With the proposed method, Ive could compare signatures 30 times faster than conventional method using DP matching.