• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.5
• /
• pp.119-123
• /
• 2006

We present a new face recognition method, which selects eigenfaces by our algorithm instead of the existing eigenfaces selection method that chooses eigenfaces by the value of corresponding eigenvalues. We justify our method by comparing our method with traditional one by experiments with YALE, ORL database. By using our algorithm in selecting the eigenfaces, we obtain higher recognition rate than the existing schemes.

• The Journal of the Korea Contents Association
• /
• v.9 no.2
• /
• pp.115-124
• /
• 2009

The popular eigenfaces-based face recognition among proposed face recognition methods utilizes the eigenfaces obtained from applying PCA to a training face image set. Thus, it may not achieve a reliable performance under illumination environments different from that of training face images. In this paper, we propose an illumination-separate eigenfaces-based face recognition method, which excludes the effects of illumination as much as possible. The proposed method utilizes the illumination-separate eigenfaces which is obtained by orthogonal decomposition of the eigenface space of face model image set with respect to the constructed face illumination subspace. Through experiments, it is shown that the proposed face recognition method based on the illumination-separate eigenfaces performs more robustly under various illumination environments than the conventional eigenfaces-based face recognition method.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.460-463
• /
• 1999

We present an efficient face recognition method that is robust to illumination changes. We named the proposed method as SKKUfaces. We first compute eigenfaces from training images and then apply fisher discriminant analysis using the obtained eigenfaces that exclude eigenfaces correponding to first few largest eigenvalues. This way, SKKUfaces can achieve the maximum class separability without considering eigenfaces that are responsible for illumination changes, facial expressions and eyewear. In addition, we have developed a method that efficiently computes beween-scatter and within-scatter matrices in terms of memory space and computation time. We have tested the performance of SKKUfaces on the YALE and the SKKU face databases. Initial Experimental results show that SKKUfaces performs greatly better over Fisherfaces on the input images of large variations in lighting and eyewear.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.27-36
• /
• 2004

Detection and recognition of human faces in images can be considered as an important aspect for applications that involve interaction between human and computer. In this paper, we propose a face recognition method using eigenfaces and fuzzy neural networks. The Principal Components Analysis (PCA) is one of the most successful technique that have been used to recognize faces in images. In this technique the eigenvectors (eigenfaces) and eigenvalues of an image is extracted from a covariance matrix which is constructed form image database. Face recognition is Performed by projecting an unknown image into the subspace spanned by the eigenfaces and by comparing its position in the face space with the positions of known indivisuals. Based on this technique, we propose a new algorithm for face recognition consisting of 5 steps including preprocessing, eigenfaces generation, design of fuzzy membership function, training of neural network, and recognition. First, each face image in the face database is preprocessed and eigenfaces are created. Fuzzy membership degrees are assigned to 135 eigenface weights, and these membership degrees are then inputted to a neural network to be trained. After training, the output value of the neural network is intupreted as the degree of face closeness to each face in the training database.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.400-405
• /
• 2005

This paper analyzes the performance of a face recognition algorithm using the eigenfaces method. In the absence of robust personal recognition schemes, a biometric recognition system has essentially researched to improve their shortcomings. A face recognition system in biometries is widely researched in the field of computer vision and pattern recognition, since it is possible to comprehend intuitively our faces. The proposed system projects facial images onto a feature space that effectively expresses the significant variations among known facial images. The significant features are known as 'eigenfaces', because they are the eigenvectors(principal components) of the set of faces. The projection operation characterizes an individual face by a weighted sum of the eigenface features, and to recognize a particular face it is necessary only to compare these weights to those of known individuals. In order to analyze the performance of the system, we develop a face recognition system by using Harvard database in Harvard Robotics Laboratory. We present the recognition rate according to variations on the lighting condition, numbers of the employed eigenfaces, and existence of a pre-processing step. Finally, we construct a rejection curve in order to investigate the practicability of the recognition method using the eigenfaces.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.3
• /
• pp.162-170
• /
• 2014

Appearance-based subspace models such as eigenfaces have been widely recognized as one of the most successful approaches to face recognition and tracking. The success of eigenfaces mainly has its origins in the benefits offered by principal component analysis (PCA), the representational power of the underlying generative process for high-dimensional noisy facial image data. The sparse extension of PCA (SPCA) has recently received significant attention in the research community. SPCA functions by imposing sparseness constraints on the eigenvectors, a technique that has been shown to yield more robust solutions in many applications. However, when SPCA is applied to facial images, the time and space complexity of PCA learning becomes a critical issue (e.g., real-time tracking). In this paper, we propose a very fast and scalable greedy forward selection algorithm for SPCA. Unlike a recent semidefinite program-relaxation method that suffers from complex optimization, our approach can process several thousands of data dimensions in reasonable time with little accuracy loss. The effectiveness of our proposed method was demonstrated on real-world face recognition and tracking datasets.

• Journal of Computing Science and Engineering
• /
• v.11 no.1
• /
• pp.24-31
• /
• 2017

Face-based video retrieval has become an active and important branch of intelligent video analysis. Face profiling and matching is a fundamental step and is crucial to the effectiveness of video retrieval. Although many algorithms have been developed for processing static face images, their effectiveness in face-based video retrieval is still unknown, simply because videos have different resolutions, faces vary in scale, and different lighting conditions and angles are used. In this paper, we combined content-based and semantic-based image analysis techniques, and systematically evaluated four mainstream local features to represent face images in the video retrieval task: Harris operators, SIFT and SURF descriptors, and eigenfaces. Results of ten independent runs of 10-fold cross-validation on datasets consisting of TED (Technology Entertainment Design) talk videos showed the effectiveness of our approach, where the SIFT descriptors achieved an average F-score of 0.725 in video retrieval and thus were the most effective, while the SURF descriptors were computed in 0.3 seconds per image on average and were the most efficient in most cases.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.811-813
• /
• 2004

본 논문에서는, 고유 얼굴 분포를 기반으로 하여 퍼지 이론을 이용한 얼굴 인식 기법을 제안한다 고유 얼굴의 가중치값들에 대해 각각의 분포를 이용한 소속도 함수가 계산되며. 소속도 함수를 통해 계산된 소속도는 신경망을 통해 학습된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.340-342
• /
• 2003

본 논문은 웨이블릿 변환을 통해 얻어진 부밴드들을 고유얼굴을 이용한 얼굴인식 시스템에 적용하여 성능을 향상 시키기 위한 방법을 제안한다. 현재 상용화되어 있는 고유얼굴을 이용한 얼굴인식 방법은 속도가 빠르고 단순하며 학습능력이 졸은 특징을 가지고 있지만 훈련 얼굴영상들의 증가에 따라 계산량이 급격히 증가하는 문제점을 가지고 있다. 이를 해결하기 위해서 웨이블릿 변환를 통해 얻어진 해상도가 작은 부밴드 얼굴영상을 인식 과정에 사용되는 얼굴영상으로 사용함으로서 계산량의 증가에 대한 문제를 해결 할 수 있다. 얼굴의 인식률을 향상시키기 위한 방법으로는 웨이블릿 변환시에 나타나는 하나의 저대역 부밴드와 세 개의 방향성분을 가진 부밴드 얼굴영상의 특징벡터들을 벡터적으로 결합하여 인식과정에서 사용하여 인식의 정확도를 높이려 한다.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.2
• /
• pp.1-7
• /
• 2006

블렌드 쉐입 기반 얼굴 애니메이션을 위해 기저 모델(Expression basis)을 생성하는 방법을 크게 두 가지로 구분하면, 애니메이터가 직접 모델링을 하여 생성하는 방법과 통계적 방법에 기초하여 모델링하는 방법이 있다. 그 중 애니메이터에 의한 수동 모델링 방법으로 생성된 기저 모델은 직관적으로 표정을 인식할 수 있다는 장점으로 인해 전통적인 키프레임 제어가 가능하다. 하지만, 표정 공간(Expression Space)의 일부분만을 커버하기 때문에 모션데이터로부터의 재복원 과정에서 많은 오차를 가지게 된다. 반면, 통계적 방법을 기반으로 한 기저모델 생성 방법은 거의 모든 표정공간을 커버하는 고유 얼굴 모델(Eigen Faces)을 생성하므로 재복원 과정에서 최소의 오차를 가지지만, 시각적으로 직관적이지 않은 표정 모델을 만들어 낸다. 따라서 본 논문에서는 수동으로 생성한 기저모델을 유사 고유 얼굴 모델(Quasi-Eigen Faces)로 변형하는 방법을 제시하고자 한다. 결과로 생성되는 기저 모델은 시각적으로 직관적인 얼굴 표정을 유지하면서도 통계적 방법에 의한 얼굴표정 공간의 커버 영역과 유사하도록 확장할 수 있다.