• Journal of International Society for Simulation Surgery
• /
• v.2 no.2
• /
• pp.64-66
• /
• 2015

Purpose : In this paper we proposed cascade feature filter and projection method for rapid human face recognition for the large-scale high-dimensional face database. Materials and Methods : The relevant features are selected from the large feature set using Fast Correlation-Based Filter method. After feature selection, project them into discriminant using Principal Component Analysis or Linear Discriminant Analysis. Their cascade method reduces the time-complexity without significant degradation of the performance. Results : In our experiments, the ORL database and the extended Yale face database b were used for evaluation. On the ORL database, the processing time was approximately 30-times faster than typical approach with recognition rate 94.22% and on the extended Yale face database b, the processing time was approximately 300-times faster than typical approach with recognition rate 98.74 %. Conclusion : The recognition rate and time-complexity of the proposed method is suitable for real-time face recognition system on the large-scale high-dimensional face database.

• Journal of Korea Multimedia Society
• /
• v.24 no.5
• /
• pp.701-708
• /
• 2021

As one of the most widely used technology in the world right now, Face recognition has already received widespread attention by all the researcher and institutes. It has been used in many fields such as safety protection, surveillance system, crime control and even in our ordinary life such as home security and so on. This technology with today's technology has advantages such as high connectivity and real time transformation. But we still need to improve its recognition rate, reaction time and also reduce impact of different environmental status to the whole system. So in this paper we proposed a face recognition system model with improved CNN which combining the characteristics of flat network and residual network, integrated learning, simplify network structure and enhance portability and also improve the recognition accuracy. We also used AR and ORL database to do the experiment and result shows higher recognition rate, efficiency and robustness for different image conditions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.3
• /
• pp.249-254
• /
• 2005

In this paper, we analysis the recognition performance of PCA/LDA by distance measures. We are adapt to ORL face database with the fourteen distance measures. In case of PCA, it has high performance for the manhattan distance and the weighted SSE distance to face recognition, In case of PCA/LDA, it has high performance for the angle-based distance and the modified SSE distance. Also, PCA/LDA is better than PCA for reduction of dimension. Therefore, the PCA/LDA method and the angle-based distance have the most performance and a few dimension for face recognition with ORL face database.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.69-72
• /
• 2000

본 논문에서는 디지털 이미지 안에서의 얼굴 영상 분할을 위해서 데이터로부터 얼굴 영상과 배경 영상의 소속도(membership degree)를 학습시켜 구한다. 그리고 입력 이미지의 각 픽셀 값에 해당하는 소속도를 이용하여 얼굴 영상의 분할을 수행한다. 실험에서는 8-bit 그레이 스케일 영상의 ORL Database를 이용하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1824-1845
• /
• 2016

The GMM is a conventional approach which has been recently applied in many face recognition studies. However, the question about how to deal with illumination changes while ensuring high performance is still a challenge, especially with real-world databases. In this paper, we propose a Visual Observation Confidence (VOC) measure for robust face recognition for illumination changes. Our VOC value is a combined confidence value of three measurements: Flatness Measure (FM), Centrality Measure (CM), and Illumination Normality Measure (IM). While FM measures the discrimination ability of one face, IM represents the degree of illumination impact on that face. In addition, we introduce CM as a centrality measure to help FM to reduce some of the errors from unnecessary areas such as the hair, neck or background. The VOC then accompanies the feature vectors in the EM process to estimate the optimal models by modified-GMM training. In the experiments, we introduce a real-world database, called KoFace, besides applying some public databases such as the Yale and the ORL database. The KoFace database is composed of 106 face subjects under diverse illumination effects including shadows and highlights. The results show that our proposed approach gives a higher Face Recognition Rate (FRR) than the GMM baseline for indoor and outdoor datasets in the real-world KoFace database (94% and 85%, respectively) and in ORL, Yale databases (97% and 100% respectively).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.800-803
• /
• 2006

In this paper, we propose a method for improving the performance of the face recognition using a hybrid neural network. The propose method focused on improving face recognition technique using SOM and LVQ. In order to verify the effectiveness of the proposed method, we performed simulations on face database supplied ORL. The results show that the proposed method considerably improves on the performance of the eigenface, hidden markov model, multilayer neural network.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2991-3007
• /
• 2022

Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2004-2007
• /
• 2003

This paper describes a method of performance enhancement using Flatness Mesure(FM) for the Gaussian Mixture Model(GMM) face recognition systems. Using this measure we discard the frames having low information before training and test. As the result, the performance increases about 9％ in the lower mixtures and calculation burden is decreased. As well, the recognition error rate is decreased under the illumination change surroundings. We use the 2D DCT coefficients lot face feature vectors and experiments are carried out on the Olivetti Research Laboratory (ORL) face database.

• 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.