• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.3
• /
• pp.241-246
• /
• 2016

Nowadays many people have an interest in facial expression and the behavior of people. These are human-robot interaction (HRI) researchers utilize digital image processing, pattern recognition and machine learning for their studies. Facial feature point detector algorithms are very important for face recognition, gaze tracking, expression, and emotion recognition. In this paper, a cascade facial feature point detector is used for finding facial feature points such as the eyes, nose and mouth. However, the detector has difficulty extracting the feature points from several images, because images have different conditions such as size, color, brightness, etc. Therefore, in this paper, we propose an algorithm using a modified cascade facial feature point detector using a convolutional neural network. The structure of the convolution neural network is based on LeNet-5 of Yann LeCun. For input data of the convolutional neural network, outputs from a cascade facial feature point detector that have color and gray images were used. The images were resized to $32{\times}32$. In addition, the gray images were made into the YUV format. The gray and color images are the basis for the convolution neural network. Then, we classified about 1,200 testing images that show subjects. This research found that the proposed method is more accurate than a cascade facial feature point detector, because the algorithm provides modified results from the cascade facial feature point detector.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.769-776
• /
• 2014

It is necessary to detect the feature points existing simultaneously in both images and then find the corresponding relationship between the detected feature points. We propose a new feature detector based on geometric mean of two eigenvalues of gradient matrix which is able to measure the change of pixel intensities. The corner response of the proposed detector is proportional to the geometric mean and also the difference of two eigenvalues in the case of same geometric mean. We analyzed the localization error of the feature detection using aerial image and artificial image with various types of corners. The localization error of the proposed detector was smaller than that of the typical corner detector, Harris detector.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.2
• /
• pp.35-42
• /
• 2008

This study introduces a robust feature detector for sonar data from a general fixed-type of sonar ring. The detector is composed of a data association filter and a feature extractor. The data association filter removes false returns provided frequently from sonar sensors, and classifies set of data from various objects and robot positions into a group in which all the data are from the same object. The feature extractor calculates the geometries of the feature for the group. We show the possibility of extracting circle feature as well as a line and a point features. The proposed method was applied to a real home environment with a real robot.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4372-4389
• /
• 2019

Spectrum sensing has attracted much attention due to its significant contribution to idle spectrum detection in Cognitive Radio Networks. However, specialized discussion is on complexity-based sensing strategy for spectrum sensing seldom considered. Motivated by this, this paper is devoted to complexity-based sensing strategy for spectrum sensing. Firstly, three efficiency functions are defined to estimate sensing efficiency of a spectrum scheme. Then a novel sensing strategy is proposed given sensing performance and computational complexity. After that, the proposed sensing strategy is extended to energy detector, Cyclostationary feature detector, covariance matrix detector and cooperative spectrum detector. The proposed sensing strategy provides a novel insight into sensing performance estimation for its consideration of both sensing capacity and sensing complexity. Simulations analyze three efficiency functions and optimal sensing strategy of energy detector, Cyclostationary feature detector and covariance matrix detector.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.263-270
• /
• 2014

Corner detection and feature extraction are essential aspects of computer vision problems such as object recognition and tracking. Feature detectors such as Scale Invariant Feature Transform (SIFT) yields high quality features but computationally intensive for use in real-time applications. The Features from Accelerated Segment Test (FAST) detector provides faster feature computation by extracting only corner information in recognising an object. In this paper we have analyzed the efficient object detection algorithms with respect to efficiency, quality and robustness by comparing characteristics of image detectors for corner detector and feature extractors. The simulated result shows that compared to conventional SIFT algorithm, the object recognition system based on the FAST corner detector yields increased speed and low performance degradation. The average time to find keypoints in SIFT method is about 0.116 seconds for extracting 2169 keypoints. Similarly the average time to find corner points was 0.651 seconds for detecting 1714 keypoints in FAST methods at threshold 30. Thus the FAST method detects corner points faster with better quality images for object recognition.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.73-80
• /
• 2003

In this paper we propose an algorithm which matches the corresponding feature points between the reference image and the search image. We use Harris's corner detector to find the feature points in both image. For each feature point in the reference image, we can extract the candidate matching points as feature points in the starch image which the normalized correlation coefficient goes greater than a threshold. Finally we determine a corresponding feature points among candidate points by using dynamic programming. In experiments we show results that match feature points in synthetic image and real image.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.7
• /
• pp.291-296
• /
• 2015

In this paper, we propose a new confidence measure using pixel selection for eye detection and design a hybrid eye detector. For this, we produce sub-images by applying a pixel selection method to the eye patches and construct the BDA(Biased Discriminant Analysis) feature space for measuring the confidence of the eye detection results. For a hybrid eye detector, we select HFED(Haar-like Feature based Eye Detector) and MFED(MCT Feature based Eye Detector), which are complementary to each other, as basic detectors. For a given image, each basic detector conducts eye detection and the confidence of each result is estimated in the BDA feature space by calculating the distances between the produced eye patches and the mean of positive samples in the training set. Then, the result with higher confidence is adopted as the final eye detection result and is used to the face alignment process for face recognition. The experimental results for various face databases show that the proposed method performs more accurate eye detection and consequently results in better face recognition performance compared with other methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.160-170
• /
• 2010

This paper proposes a Haar Wavelet Feature Detector (HWFD) based on the Haar wavelet transform and average box filter. By decomposing the original image using the Haar wavelet transform, the proposed detector obtains the variance information of the image, making it possible to extract more distinctive features from the original image. For detection of interest points that represent the regions whose variance is the highest among their neighbor regions, we apply the average box filter to evaluate the local variance information and use the integral image technique for fast computation. Due to utilization of the Haar wavelet transform and the average box filter, the proposed detector is robust to illumination change, scale change, and rotation of the image. Experimental results show that even though the proposed method detects fewer interest points, it achieves higher repeatability, higher efficiency and higher matching accuracy compared with the DoG detector and Harris corner detector.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.547-551
• /
• 2009

In recent years, a film restoration has gained increasing attention by many researchers, to emergence of variety multimedia and to importance of video preservation. Blotch is the most frequent degradation in old film. This paper presents a blotch detection method using color and shape feature. The proposed method is two major modules: a SROD detector using impulsive feature and NN-based detector using shape feature. To assess the validity of the proposed method, the experiments have been performed on several old films.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.990-995
• /
• 2010

Harris corner detector is commonly used to detect feature points for recognizing 2-D or 3-D objects. However, the feature points calculated from both of query and target objects need to be same positions to guarantee accurate recognitions. In order to check the positions of calculated feature points, we generate a Huffman tree which is based on adjacent feature values as inputs. However, the structures of two Huffman trees will be same as long as both of a query and targets have same feature values no matter how different their positions are. In this paper, we sort feature values and calculate the Euclidean distances of coordinates between two adjacent feature values. The Huffman Tree is generated with these Euclidean distances. As a result, the information of point locations can be included in the generated Huffman tree. This is the main strategy for accurate recognitions. We call this system as the HRM(Hybrid Retrieval Machine). This system works very well even when artificial random noises are added to original data. HRM can be used to recognize biological data such as proteins, and it will curtail the costs which are required to biological experiments.