• IEIE Transactions on Smart Processing and Computing
• /
• 제5권3호
• /
• pp.153-163
• /
• 2016

Local feature extraction methods for images and videos are widely applied in the fields of image understanding and computer vision. However, robust features are detected differently when using the latest feature detectors and descriptors because of diverse image environments. This paper analyzes various feature extraction methods by summarizing algorithms, specifying properties, and comparing performance. We analyze eight feature extraction methods. The performance of feature extraction in various image environments is compared and evaluated. As a result, the feature detectors and descriptors can be used adaptively for image sequences captured under various image environments. Also, the evaluation of feature detectors and descriptors can be applied to driving assistance systems, closed circuit televisions (CCTVs), robot vision, etc.

• 한국멀티미디어학회논문지
• /
• 제19권5호
• /
• pp.881-889
• /
• 2016

Ocular region recently emerged as a new biometric trait for overcoming the limitations of iris recognition performance at the situation that cannot expect high user cooperation, because the acquisition of an ocular image does not require high user cooperation and close capture unlike an iris image. This study proposes a new method for ocular image recognition based on BRISK (binary robust invariant scalable keypoints). It uses the distance ratio of the two nearest neighbors to improve the accuracy of the detection of corresponding keypoint pairs, and it also uses geometric constraint for eliminating incorrect keypoint pairs. Experiments for evaluating the validity the proposed method were performed on MMU public database. The person recognition rate on left and right ocular image datasets showed 91.1% and 90.6% respectively. The performance represents about 5% higher accuracy than the SIFT-based method which has been widely used in a biometric field.

• 전기학회논문지P
• /
• 제64권3호
• /
• pp.193-198
• /
• 2015

A large number of vision applications rely on matching keypoints across images. Pedestrian detection is under constant pressure to increase both its quality and speed. Such progress allows for new application. A higher speed enables its inclusion into large systems with extensive subsequent processing, and its deployment in computationally constrained scenarios. In this paper, we focus on improving the speed of pedestrian detection using HOG(histogram of oriented gradient) and multi frame operation which is robust to illumination changes in cluttering images. The result of our simulation indicates that the detection rate and speed of the proposed method is much faster than that of conventional HOG and differential images.

• 전기학회논문지P
• /
• 제64권3호
• /
• pp.187-192
• /
• 2015

Detecting human in images is a challenging task owing to their variable appearance and the wide range of poses the they can adopt. The first need is a robust feature set that allows the human form to be discriminated cleanly, even in cluttered background under difficult illumination. A large number of vision application rely on matching keypoints across images. These days, the deployment of vision algorithms on smart phones and embedded device with low memory and computation complexity has even upped the ante: the goal is to make descriptors faster compute, more compact while remaining robust scale, rotation and noise. In this paper we focus on improving the speed of pedestrian(walking person) detection using Histogram of Oriented Gradient(HOG) descriptors provide excellent performance and tracking using kalman filter.

• Journal of information and communication convergence engineering
• /
• 제12권2호
• /
• pp.128-134
• /
• 2014

In this paper, we present a graphics processing unit (GPU)-based matching technique for the purpose of fast feature matching between different images. The scale invariant feature transform algorithm developed by Lowe for various feature matching applications, such as stereo vision and object recognition, is computationally intensive. To address this problem, we propose a matching technique optimized for GPUs to perform computations in less time. We optimize GPUs for fast computation of keypoints to make our system quick and efficient. The proposed method uses a self-organizing map feature matching technique to perform efficient matching between the different images. The experiments are performed on various image sets to examine the performance of the system under varying conditions, such as image rotation, scaling, and blurring. The experimental results show that the proposed algorithm outperforms the existing feature matching methods, resulting in fast feature matching due to the optimization of the GPU.

• Journal of the Korean Data and Information Science Society
• /
• 제3권1호
• /
• pp.1-16
• /
• 1992

In regression diagnostics, a number of joint influence measures based on various statistical tools have been discussed. We consider an alternate representation in terms of the predicted residual and g-leverage determined by the remaining points. By this approach, we choose the predicted residual sum of squares for the keypoints as joint influence measure and propose a new expression of it so that we can extend the single case form to the multiple case one. Furthermore we suggest a seach method for joint influence after investigating some properties of the new expression.

• 한국전산구조공학회논문집
• /
• 제12권1호
• /
• pp.67-74
• /
• 1999

본 문에서는 선체 중앙부의 유한요소 모델링과 진동해석이 수행되었다. 횡부재와 종통부재가 만나 3차원적으로 연결되어 있는 선체구조는 복잡한 구조적 특성 때문에 모델링에 많은 노력이 필요하다. 선수, 선미부에 비해 비교적 부재간의 접속이 간단한 중앙평행부의 진동해석과 같은 경우에는 모델링 기법을 개발해 사용할 수도 있다. 중앙부 횡부재와 종통부재가 만나는 부분의 접속성과 형상표현을 위해 keypoint, super element(SE) 개념을 도입하였고 형성된 SE 들을 isoparametric mapping 기법을 접속된 3차원 부재용으로 개선하여 유한요소로 분할하였다. 진동해석용으로 형성된 선체중앙부 요소망을 ANSYS로 가시화하였고 자유진동해석을 수행하였다.

• International Journal of Contents
• /
• 제9권2호
• /
• pp.1-7
• /
• 2013

This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

• 한국멀티미디어학회논문지
• /
• 제18권1호
• /
• pp.1-8
• /
• 2015

In recent years, ear has emerged as a new biometric trait, because it has advantage of higher user acceptance than fingerprint and can be captured at remote distance in an indoor or outdoor environment. This paper proposes an individual identification method using ear region based on SIFT(shift invariant feature transform). Unlike most of the previous studies using rectangle shape for extracting a region of interest(ROI), this study sets an ROI as a flexible expanded region including ear. It also presents an effective extraction and matching method for SIFT keypoints. Experiments for evaluating the performance of the proposed method were performed on IITD public database. It showed correct identification rate of 98.89%, and it showed 98.44% with a deformed dataset of 20% occlusion. These results show that the proposed method is effective in ear recognition and robust to occlusion.

• 반도체디스플레이기술학회지
• /
• 제18권4호
• /
• pp.57-61
• /
• 2019

Nowadays, portable digital cameras such as smart phone cameras are being popularly used for entertainment and visual information recording. Given a database of geo-tagged images, a visual location recognition system can determine the place depicted in a query photo. One of the most common visual location recognition approaches is the bag-of-words method where local image features are clustered into visual words. In this paper, we propose a new bag-of-words-based visual location recognition algorithm using time-series streetview database. The proposed algorithm selects only a small subset of image features which will be used in image retrieval process. By reducing the number of features to be used, the proposed algorithm can reduce the memory requirement of the image database and accelerate the retrieval process.