• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.247-258
• /
• 2003

Principal component analysis (PCA) based algorithms form the basis of numerous algorithms and studies in the face recognition literature. PCA is a statistical technique and its incorporation into a face recognition system requires numerous design decisions. We explicitly take the design decisions by in-troducing a generic modular PCA-algorithm since some of these decision ate not documented in the literature We experiment with different implementations of each module, and evaluate the different im-plementations using the September 1996 FERET evaluation protocol (the do facto standard method for evaluating face recognition algorithms). We experiment with (1) changing the illumination normalization procedure; (2) studying effects on algorithm performance of compressing images using JPEG and wavelet compression algorithms; (3) varying the number of eigenvectors in the representation; and (4) changing the similarity measure in classification process. We perform two experiments. In the first experiment, we report performance results on the standard September 1996 FERET large gallery image sets. The result shows that empirical analysis of preprocessing, feature extraction, and matching performance is extremely important in order to produce optimized performance. In the second experiment, we examine variations in algorithm performance based on 100 randomly generated image sets (galleries) of the same size. The result shows that a reasonable threshold for measuring significant difference in performance for the classifiers is 0.10.

• International journal of advanced smart convergence
• /
• v.8 no.4
• /
• pp.104-112
• /
• 2019

This study proposed a robust detection algorithm. It detects face more stably with respect to changes in light and rotation forthe identification of a face shape. The proposed algorithm uses face shape asinput information in a single camera environment and divides only face area through preprocessing process. However, it is not easy to accurately recognize the face area that is sensitive to lighting changes and has a large degree of freedom, and the error range is large. In this paper, we separated the background and face area using the brightness difference of the two images to increase the recognition rate. The brightness difference between the two images means the difference between the images taken under the bright light and the images taken under the dark light. After separating only the face region, the face shape is recognized by using the self-organization feature map (SOFM) algorithm. SOFM first selects the first top neuron through the learning process. Second, the highest neuron is renewed by competing again between the highest neuron and neighboring neurons through the competition process. Third, the final top neuron is selected by repeating the learning process and the competition process. In addition, the competition will go through a three-step learning process to ensure that the top neurons are updated well among neurons. By using these SOFM neural network algorithms, we intend to implement a stable and robust real-time face shape recognition system in face shape recognition.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.4
• /
• pp.737-742
• /
• 2013

The surveillance system has been developed to be intelligent which can judge and cope by itself using human recognition technique. The existing face recognition is excellent at a short distance but recognition rate is reduced at a long distance. In this paper, we analyze the performance of face recognition according to interpolation and face recognition algorithm in face recognition using the multiple distance face images to training. we use the nearest neighbor, bilinear, bicubic, Lanczos3 interpolations to interpolate face image and PCA and LDA to face recognition. The experimental results show that LDA-based face recognition with bilinear interpolation provides performance in face recognition.

• Journal of Game and Entertainment
• /
• v.2 no.2
• /
• pp.45-50
• /
• 2006

In a face detection system based on template matching, histogram equalization or log transform is applied to an input image for the intensity normalization and the image improvement. It is known that they are noneffective in improving an image with intensity distortion by illumination variation. In this paper, we propose an efficient image improvement method called as a bilateral symmetry average for images with intensity distortion by illumination variation. Experimental results show that our method delivers the detection performance better than previous methods and also remarkably reduces the number of face candidates.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.377-388
• /
• 2007

In this paper, we propose a multi-modal biometric system based on face, iris and fingerprint recognition system. To effectively aggregate two systems, we use statistical distribution models based on matching values for genuine and impostor, respectively. And then, We performed reveal fusion algorithms including weighted summation, Support Vector Machine(SVM), Fisher discriminant analysis, Bayesian classifier. From the various experiments, we found that the performance of multi-modal biometric system was influenced with the normalization methods and classifiers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.368-391
• /
• 2018

Face recognition (FR) with a single sample per person (SSPP) is common in real-world face recognition applications. In this scenario, it is hard to predict intra-class variations of query samples by gallery samples due to the lack of sufficient training samples. Inspired by the fact that similar faces have similar intra-class variations, we propose a virtual sample generating algorithm called k nearest neighbors based virtual sample generating (kNNVSG) to enrich intra-class variation information for training samples. Furthermore, in order to use the intra-class variation information of the virtual samples generated by kNNVSG algorithm, we propose image set based multimanifold discriminant learning (ISMMDL) algorithm. For ISMMDL algorithm, it learns a projection matrix for each manifold modeled by the local patches of the images of each class, which aims to minimize the margins of intra-manifold and maximize the margins of inter-manifold simultaneously in low-dimensional feature space. Finally, by comprehensively using kNNVSG and ISMMDL algorithms, we propose k nearest neighbor virtual image set based multimanifold discriminant learning (kNNMMDL) approach for single sample face recognition (SSFR) tasks. Experimental results on AR, Multi-PIE and LFW face datasets demonstrate that our approach has promising abilities for SSFR with expression, illumination and disguise variations.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.203-207
• /
• 2001

In this Paper, we propose the neural network based emotion recognition method for intelligently recognizing the human's emotion using CCD color image. To do this, we first acquire the color image from the CCD camera, and then propose the method for recognizing the expression to be represented the structural correlation of man's feature Points(eyebrows, eye, nose, mouse) It is central technology that the Process of extract, separate and recognize correct data in the image. for representation is expressed by structural corelation of human's feature Points In the Proposed method, human's emotion is divided into four emotion (surprise, anger, happiness, sadness). Had separated complexion area using color-difference of color space by method that have separated background and human's face toughly to change such as external illumination in this paper. For this, we propose an algorithm to extract four feature Points from the face image acquired by the color CCD camera and find normalization face picture and some feature vectors from those. And then we apply back-prapagation algorithm to the secondary feature vector. Finally, we show the Practical application possibility of the proposed method.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.869-870
• /
• 2008

Illumination variation is the most significant factor affecting face recognition rate. In this paper, we propose adaptive smoothing based on combined most significant bit (CMSB) - plane and local entropy for robust face recognition in varying illumination. Illumination normalization is achieved based on Retinex method. The proposed method has been evaluated based on the CMU PIE database by using Principle Component Analysis (PCA).

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.40-49
• /
• 2018

We propose a more stable robust recognition algorithm which detects faces reliably even in cases where there are changes in lighting and angle of view, as well it satisfies efficiency in calculation and detection performance. We propose detects the face area alone after normalization through pre-processing and obtains a feature vector using (PCA). The feature vector is applied to LDA and using Euclidean distance of intra-class variance and inter class variance in the 2nd dimension, the final analysis and matching is performed. Experimental results show that the proposed method has a wider distribution when the input image is rotated $45^{\circ}$ left / right. We can improve the recognition rate by applying this feature value to a single algorithm and complex algorithm, and it is possible to recognize in real time because it does not require much calculation amount due to dimensional reduction.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.77-84
• /
• 2012

Face classification has wide applications in intelligent video surveillance, content retrieval, robot vision, and human-machine interface. Pose and expression changes, and arbitrary illumination are typical problems for face recognition. When the face is captured at a distance, the image quality is often degraded by blurring and noise corruption. This paper investigates the efficacy of multi-classifier decision level fusion for face classification based on the photon-counting linear discriminant analysis with two different cost functions: Euclidean distance and negative normalized correlation. Decision level fusion comprises three stages: cost normalization, cost validation, and fusion rules. First, the costs are normalized into the uniform range and then, candidate costs are selected during validation. Three fusion rules are employed: minimum, average, and majority-voting rules. In the experiments, unfocusing and motion blurs are rendered to simulate the effects of the long distance environments. It will be shown that the decision-level fusion scheme provides better results than the single classifier.