• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.418-422
• /
• 2009

Generally, algorithms for generating disparity maps can be clssified into two categories: region-based method and feature-based method. The main focus of this research is to generate a disparity map with an accuracy depth information for 3-dimensional reconstructing. Basically, the region-based method and the feature-based method are simultaneously included in the proposed algorithm, so that the existing problems including false matching and occlusion can be effectively solved. As a region-based method, regions of false matching are extracted by the proposed MMAD(Modified Mean of Absolute Differences) algorithm which is a modification of the existing MAD(Mean of Absolute Differences) algorithm. As a feature-based method, the proposed method eliminates false matching errors by calculating the vector with SIFT and compensates the occluded regions by using a pair of adjacent SIFT matching points, so that the errors are reduced and the disparity map becomes more accurate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2363-2371
• /
• 2015

In this paper, we propose a new feature matching algorithm which is robust to the viewpoint change by using the FAST(Features from Accelerated Segment Test) feature detector and the SIFT(Scale Invariant Feature Transform) feature descriptor. The original FAST algorithm unnecessarily results in many feature points along the edges in the image. To solve this problem, we apply the principal curvatures for refining it. We use the SIFT descriptor to describe the extracted feature points and calculate the homography matrix through the RANSAC(RANdom SAmple Consensus) with the matching pairs obtained from the two different viewpoint images. To make feature matching robust to the viewpoint change, we classify the matching pairs by calculating the Euclidean distance between the transformed coordinates by the homography transformation with feature points in the reference image and the coordinates of the feature points in the different viewpoint image. Through the experimental results, it is shown that the proposed algorithm has better performance than the conventional feature matching algorithms even though it has much less computational load.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.305-323
• /
• 2010

This paper proposes an efficient and yet powerful local descriptor called phase-space partition based descriptor (PPD). This descriptor is designed for the mobile image matching and retrieval. PPD, which is inspired from SIFT, also encodes the salient aspects of the image gradient in the neighborhood around an interest point. However, without employing SIFT's smoothed gradient orientation histogram, we apply the region based gradient statistics in phase space to the construction of a feature representation, which allows to reduce much computation requirements. The feature matching experiments demonstrate that PPD achieves favorable performance close to that of SIFT and faster building and matching. We also present results showing that the use of PPD descriptors in a mobile image retrieval application results in a comparable performance to SIFT.

• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.643-654
• /
• 2015

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 propose using the combination of Affine Scale Invariant Feature Transform (SIFT) and Probabilistic Similarity for face recognition under a large viewpoint change. Affine SIFT is an extension of SIFT algorithm to detect affine invariant local descriptors. Affine SIFT generates a series of different viewpoints using affine transformation. In this way, it allows for a viewpoint difference between the gallery face and probe face. However, the human face is not planar as it contains significant 3D depth. Affine SIFT does not work well for significant change in pose. To complement this, we combined it with probabilistic similarity, which gets the log likelihood between the probe and gallery face based on sum of squared difference (SSD) distribution in an offline learning process. Our experiment results show that our framework achieves impressive better recognition accuracy than other algorithms compared on the FERET database.

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

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

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

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.201-203
• /
• 2013

본 논문에서는 SIFT 와 particle 특징 궤적을 이용한 새로운 행동 인식 시스템을 제안한다. 먼저, 영상에서 중요한 지역적 특징 정보를 얻기 위하여 SIFT 특징 점들을 탐지하고, 탐지한 특징 점들을 SIFT descriptor matching 기법을 이용하여 그 궤적을 추출한다. 또한, SIFT 특징 궤적들의 수량이 적은점과 영상내의 조명변화, 부분적 가려짐 등의 변화로 인해 SIFT 특징 궤적이 종종 없어지는 단점을 보완하기 위하여, SIFT 특징 궤적 주위에 particle 점들을 탐지하고, dense optical flow 기법을 기반으로 그 특징 궤적을 추출한다. 그리고 SIFT 와 particle 궤적의 중요도를 조절하기 위해 가중치를 부여한다. 제안한 행동 인식 시스템의 효율성을 범용 데이터 셋을 이용한 실험을 통해 증명하였다.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.699-706
• /
• 2015

In recent years, as near-duplicate image has been increasing explosively by the spread of Internet and image-editing technology that allows easy access to image contents, related research has been done briskly. However, BoF (Bag-of-Feature), the most frequently used method for near-duplicate image detection, can cause problems that distinguish the same features from different features or the different features from same features in the quantization process of approximating a high-level local features to low-level. Therefore, a post-verification method for BoF is required to overcome the limitation of vector quantization. In this paper, we proposed and analyzed the performance of a post-verification method for BoF, which converts SIFT (Scale Invariant Feature Transform) descriptors into 128 bits binary codes and compares binary distance regarding of a short ranked list by BoF using the codes. Through an experiment using 1500 original images, it was shown that the near-duplicate detection accuracy was improved by approximately 4% over the previous BoF method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.1
• /
• pp.123-128
• /
• 2018

In this paper, we propose a multi-vehicle object detection algorithm using feature point matching that tracks efficient vehicle objects. The proposed algorithm extracts the feature points of the vehicle using the FAST algorithm for efficient vehicle object tracking. And True if the feature points are included in the image segmented into the 5X5 region. If the feature point is not included, it is processed as False and the corresponding area is blacked to remove unnecessary object information excluding the vehicle object. Then, the post processed area is set as the maximum search window size of the vehicle. And A minimum search window using the outermost feature points of the vehicle is set. By using the set search window, we compensate the disadvantages of the search window size of mean-shift algorithm and track vehicle object. In order to evaluate the performance of the proposed method, SIFT and SURF algorithms are compared and tested. The result is about four times faster than the SIFT algorithm. And it has the advantage of detecting more efficiently than the process of SUFR algorithm.