• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.85-95
• /
• 2005

This study proposes a method of feature point extraction using scale-space filtering and a feature point tracking algorithm based on a texturedness similarity comparison, With well-defined operators one can select a scale parameter for feature point extraction; this affects the selection and localization of the feature points and also the performance of the tracking algorithm. This study suggests a feature extraction method using scale-space filtering, With a change in the camera's point of view or movement of an object in sequential images, the window of a feature point will have an affine transform. Traditionally, it is difficult to measure the similarity between correspondence points, and tracking errors often occur. This study also suggests a tracking algorithm that expands Shi-Tomasi-Kanade's tracking algorithm with texturedness similarity.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.405-406
• /
• 2007

In this paper, we propose feature extraction and tracking algorithm using multi resolution in 2-dimensional wavelet domain. Feature extraction selects feature points using 2-level wavelet transform in interested region. Feature tracking estimates displacement between current frame and next frame based on feature point which is selected feature extraction algorithm. Experimental results show that the proposed algorithm confirmed a better performance than the existing other algorithms.

• 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 the Korea Society of Computer and Information
• /
• v.24 no.1
• /
• pp.85-92
• /
• 2019

In this paper, we propose a efficient feature point extraction method that can solve the problem of performance degradation by introducing a preprocessing process when extracting feature points by utilizing the characteristics of 360-degree realistic media. 360-degree realistic media is composed of images produced by two or more cameras and this image combining process is accomplished by extracting feature points at the edges of each image and combining them into one image if they cover the same area. In this production process, however, the stitching process where images are combined into one piece can lead to the distortion of non-seamlessness. Since the realistic media of 4K-class image has higher resolution than that of a general image, the feature point extraction and matching process takes much more time than general media cases.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.641-644
• /
• 2005

This paper introduces an Interactive Feature Extraction (!FE) approach for the registration of satellite imagery by matching extracted point and line features. !FE method contains both point extraction by cross-correlation matching of singular points and line extraction by Hough transform. The purpose of this study is to minimize user's intervention in feature extraction and easily apply the extracted features for image registration. Experiments with these imagery dataset proved the feasibility and the efficiency of the suggested method.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.190-193
• /
• 2000

In this paper, we investigate the distribution of classification accuracies of multiclass problems in the feature space and analyze performances of the conventional feature extraction algorithms. In order to find the distribution of classification accuracies, we sample the feature space and compute the classification accuracy corresponding to each sampling point. Experimental results showed that there exist much better feature sets that the conventional feature extraction algorithms fail to find. In addition, the distribution of classification accuracies is useful for developing and evaluating the feature extraction algorithm.

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

• Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.102-111
• /
• 2016

In this paper, we study the problem of computing smooth feature curves from CAD type point clouds models. The proposed method reconstructs feature curves from the intersections of developable strip pairs which approximate the regions along both sides of the features. The generation of developable surfaces is based on a linear approximation of the given point cloud through a variational shape approximation approach. A line segment sequencing algorithm is proposed for collecting feature line segments into different feature sequences as well as sequential groups of data points. A developable surface approximation procedure is employed to refine incident approximation planes of data points into developable strips. Some experimental results are included to demonstrate the performance of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.122-131
• /
• 2011

A widely used single image-based 3D face reconstruction method, 3D morphable shape model, reconstructs an accurate 3D facial shape when 2D facial feature points are correctly extracted from an input face image. However, in the case that a user's cooperation is not available such as a real-time 3D face reconstruction system, this method can be vulnerable to the errors of automatic facial feature point extraction. In order to solve this problem, we automatically classify extracted facial feature points into two groups, erroneous and correct ones, and then reconstruct a 3D facial shape by using only the correctly extracted facial feature points. The experimental results showed that the 3D reconstruction performance of the proposed method was remarkably improved compared to that of the previous method which does not consider the errors of automatic facial feature point extraction.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.417-420
• /
• 2002

본 논문에서는, 지문인증 시스템에 있어서 방향성분의 통계적 방법을 이용한 reference point 검출 알고리즘과 이 reference point를 중심으로 하여 기존의 filterbank의 단점을 개선한 feature 추출 알고리즘을 소개한다. 제안한 reference point검출 알고리즘은 기존의 Poincare방법의 단점인 세밀한 전처리 과정과 arch type의 지문에 대해 장점을 가지며, 개선한 filterbank방법은 기존의 filterbank방법보다 reference point의 검출 위치에 덜 민감하며, 좀 더 높은 인증률을 보였다.