• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.597-600
• /
• 2007

Face is considered to be one of the biometrics in person identification. But Face recognition is a high dimensional pattern recognition problem. Even low-resolution face images generate huge dimensional feature space. The aim of this paper is to present a fast feature extraction method for real time human face recognition. first, It compute eigen-vector and eigen-value by Principle component analysis on inputed human face image, and propose method of feature extraction that make feature vector by apply gabor filter to computed eigen-vector. And it compute feature value which multiply by made eigen-value. This study simulations performed using the ORL Database.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.33-36
• /
• 2001

We introduce, in this paper, the face recognition method that improves recognition rate and training time in eigen system. To increase recognition rate we use Gabor filter. To reduce the increasing training time owing to use Gabor filtering, we extract new feature vectors that are made with average and standard deviation. In experimental results, we get higher recognition rate and shorter training time in improved system than it in original eigen system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.64-69
• /
• 2008

This paper discusses low resolution face recognition using the photon-counting linear discriminant analysis (LDA). The photon-counting LDA asymptotically realizes the Fisher criterion without dimensionality reduction since it does not suffer from the singularity problem of the fisher LDA. The linear discriminant function for optimal projection is determined in high dimensional space to classify unknown objects, thus, it is more efficient in dealing with low resolution facial images as well as conventional face distortions. The simulation results show that the proposed method is superior to Eigen face and Fisher face in terms of the accuracy and false alarm rates.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.1
• /
• pp.47-52
• /
• 2010

In this paper, we introduce a new approach for real-time 3D face pose discrimination based on active IR illumination from a monocular view of the camera. Under the IR illumination, the pupils appear bright. We develop algorithms for efficient and robust detection and tracking pupils in real time. Based on the geometric distortions of pupils under different face orientations, an eigen eye feature space is built based on training data that captures the relationship between 3D face orientation and the geometric features of the pupils. The 3D face pose for an input query image is subsequently classified using the eigen eye feature space. From the experiment, we obtained the range of results of discrimination from the subjects which close to the camera are from 94,67%, minimum from 100%, maximum.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.727-732
• /
• 2004

In this paper, we introduce a new approach for real-time 3D face pose discrimination based on active IR illumination from a monocular view of the camera. Under the IR illumination, the pupils appear bright. We develop algorithms for efficient and robust detection and tracking pupils in real time. Based on the geometric distortions of pupils under different face orientations, an eigen eye feature space is built based on training data that captures the relationship between 3D face orientation and the geometric features of the pupils. The 3D face pose for an input query image is subsequently classified using the eigen eye feature space. From the experiment, we obtained the range of results of discrimination from the subjects which close to the camera are from 94,67％, minimum from 100％, maximum.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.97-102
• /
• 1998

In the most cases of eigen value problems in the social sciences, the object matrix to analyze is real-valued symmetric matrix. And many cases of eigen value problems in this field needs 2-4 eigen pairs according to the magnitude of their absolute values. The methods to obtain eigen pairs by numerical computation using computer, we would face the problem of round off error because matrix computation needs a number of calculations. In this paper, an algorithm which make us to get some needed eigcn pairs according to the magnitude of their absolute values is designed. And in this algorithm, the power method is used to obtain some eigen pairs. This algorithm is expected to be effective by the reduction of the number of calculations.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2108-2111
• /
• 2003

This paper introduces a new local feature extraction method and image matching method for the localization and classification of targets. Proposed method is based on the block-by-block projection associated with directional pattern of blocks. Each pattern has its own eigen-vertors called as CEBs(Classified Eigen-Blocks). Also proposed block-based image matching method is robust to translation and occlusion. Performance of proposed feature extraction and matching method is verified by the face localization and FLIR-vehicle-image classification test.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.185-189
• /
• 2004

For face recognition system, a face detector which can find exact face region from complex image is needed. Many face detection algorithms have been developed under the assumption that background of the source image is quite simple . this means that face region occupy more than a quarter of the area of the source image or the background is one-colored. Color-based face detection is fast but can't be applicable to the images of which the background color is similar to face color. And the algorithm using neural network needs so many non-face data for training and doesn't guarantee general performance. In this paper, A multi-scale, multi-face detection algorithm using PCA is suggested. This algorithm can find most multi-scaled faces contained in static images with small number of training data in reasonable time.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.9-15
• /
• 2011

In this paper, we design and implement of gate management system by face recognition using smart phone. We investigate various algorithms for face recognition on smart phones. First step in any face recognition system is face detection. We investigated algorithms like color segmentation, template matching etc. for face detection, and Eigen & Fisher face for face recognition. The algorithms have been first profiled in MATLAB and then implemented on the Android phone. While implementing the algorithms, we made a tradeoff between accuracy and computational complexity of the algorithm mainly because we are implementing the face recognition system on a smart phone with limited hardware capabilities.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.3
• /
• pp.250-255
• /
• 2012

Face recognition has wide applications in security and surveillance systems as well as in robot vision and machine interfaces. Conventional challenges in face recognition include pose, illumination, and expression, and face recognition at a distance involves additional challenges because long-distance images are often degraded due to poor focusing and motion blurring. This study investigates the effectiveness of applying photon-counting linear discriminant analysis (Pc-LDA) to face recognition in harsh environments. A related technique, Fisher linear discriminant analysis, has been found to be optimal, but it often suffers from the singularity problem because the number of available training images is generally much smaller than the number of pixels. Pc-LDA, on the other hand, realizes the Fisher criterion in high-dimensional space without any dimensionality reduction. Therefore, it provides more invariant solutions to image recognition under distortion and degradation. Two decision rules are employed: one is based on Euclidean distance; the other, on normalized correlation. In the experiments, the asymptotic equivalence of the photon-counting method to the Fisher method is verified with simulated data. Degraded facial images are employed to demonstrate the robustness of the photon-counting classifier in harsh environments. Four types of blurring point spread functions are applied to the test images in order to simulate long-distance acquisition. The results are compared with those of conventional Eigen face and Fisher face methods. The results indicate that Pc-LDA is better than conventional facial recognition techniques.