• 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 Korea Institute of Information and Communication Engineering
• /
• v.7 no.1
• /
• pp.164-169
• /
• 2003

In this paper, we investigate recognition of human faces in a meeting room. The major challenges of identifying human faces in this environment include low quality of input images, poor illumination, unrestricted head poses and continuously changing facial expressions and occlusion. In order to address these problems we propose a novel algorithm, Dynamic Space Warping (DSW). The basic idea of the algorithm is to combine local features under certain spatial constraints. We compare DSW with the eigenface approach on data collected from various meetings. We have tested both front and profile face images and images with two stages of occlusion. As a result from the experiment, we obtained 82.7% for PCA algotithm, and 89.4% for DSW. We get to obtain 6.9% better result from conductive DSW approach rather than PCA. It turned out to be that it shows more original and unique facial image.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1157-1160
• /
• 2005

The denoising and reconstruction of color images are increasingly studied in the field of computer vision and image processing. Especially, the denoising and reconstruction of color face images are more difficult than those of natural images because of the structural characteristics of human faces as well as the subtleties of color interactions. In this paper, we propose a denoising method based on PCA reconstruction for removing complex color noises on human faces, which is not easy to remove by using vectorial color filters. The proposed method is composed of the following five steps; training of canonical eigenface space using PCA, automatic extracting of face features using active appearance model, relighing of reconstructed color image using bilateral filter, extraction of noise regions using the variance of training data, and reconstruction using partial information of input images (except the noise regions) and blending of the reconstructed image with the original image. Experimental results show that the proposed denosing method efficiently removes complex color noises on input face images.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.784-791
• /
• 2004

In this study, we deal with face recognition using fuzzy-based Fisherface method. The well-known Fisherface method is more insensitive to large variation in light direction, face pose, and facial expression than Principal Component Analysis method. Usually, the various methods of face recognition including Fisherface method give equal importance in determining the face to be recognized, regardless of typicalness. The main point here is that the proposed method assigns a feature vector transformed by PCA to fuzzy membership rather than assigning the vector to particular class. In this method, fuzzy membership degrees are obtained from FKNN(Fuzzy K-Nearest Neighbor) initialization. Experimental results show better recognition performance than other methods for ORL and Yale face databases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2667-2682
• /
• 2015

Due to the wide application of face recognition (FR) in information security, surveillance, access control and others, it has received significantly increased attention from both the academic and industrial communities during the past several decades. However, partial face occlusion is one of the most challenging problems in face recognition issue. In this paper, a novel method based on linear regression-based classification (LRC) algorithm is proposed to address this problem. After all images are downsampled and divided into several blocks, we exploit the evaluator of each block to determine the clear blocks of the test face image by using linear regression technique. Then, the remained uncontaminated blocks are utilized to partial occluded face recognition issue. Furthermore, an improved Distance-based Evidence Fusion approach is proposed to decide in favor of the class with average value of corresponding minimum distance. Since this occlusion removing process uses a simple linear regression approach, the completely computational cost approximately equals to LRC and much lower than sparse representation-based classification (SRC) and extended-SRC (eSRC). Based on the experimental results on both AR face database and extended Yale B face database, it demonstrates the effectiveness of the proposed method on issue of partial occluded face recognition and the performance is satisfactory. Through the comparison with the conventional methods (eigenface+NN, fisherfaces+NN) and the state-of-the-art methods (LRC, SRC and eSRC), the proposed method shows better performance and robustness.

• 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 KIEE Conference
• /
• 1999.11c
• /
• pp.757-759
• /
• 1999

여러 사람의 얼굴들 중에 특정 개인 얼굴을 찾는 문제나 인식하는 문제는 최근들어 법 집행이나 상업적 목적 등 여러 응용분야에서 요구되고 있어 학문적으로 활발히 연구되어지고 있다. 얼굴 인식 기술은 여러 가지 방법으로 연구되어 왔는데 그 중 'PCA를 이용한 얼굴 인식 방법'이 가장 효율적인 방법으로 알려졌다. 그러나 이 방법은 조명 변화에 따라 정확성이 떨어지는 단점이 있다. 그래서 Histogram equalization을 이용해 조명 변화에 영향을 줄였다. 그리고 인식의 정확성을 유지하면서 eigenface를 추출하는데 시간을 줄이기 위해 웨이블렛 변환을 이용해 저주파 성분이 포함된 영역만을 추출, 그 부분을 입력영상으로 사용해 입력 영상에서 처리해야하는 차원을 줄여 특징 추출하는데 시간을 감소시켰다. 그 결과 특징 추출하는데 시간을 크게 줄어든 반면, 심한 조명 변화에서도 90%이상의 높은 인식률을 유지할 수 있었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.493-496
• /
• 2003

본 논문에서는 계산의 복잡성을 단순화하고, 얼굴영상에 대해 높은 얼굴 인식률을 얻기 위해 2D-HMM(Midden Markov Model) 얼굴인식 방법을 제안하고 실험하였다. 계산의 복잡성을 줄이기 위해 기존의 픽셀값 대신에 2D-DCT계수를 관측벡터로 사용함으로써 관측벡터의 크기와 인식 시스템의 복잡성을 줄일 수 있었다. 얼굴인식 시스템의 성능을 평가하기 위하여 Yale, ORL의 얼굴 데이터베이스에 대하여 기존의 얼굴인식 방법으로 널리 알려진 Eigenface 방법, LDA 방법과 본 논문에서 제안한 방법인 1D-HMM, 2D-HMM방법의 인식률을 비교 평가하였다. 실험결과 2D-HMM 방법의 인식률이 99.5%로 기존의 얼굴인식 방법들보다 우수한 성능을 나타냈다. 또한 일정 state수에 대해 mixture의 수가 증가할수록 인식결과가 좋아짐을 알 수 있었다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.3
• /
• pp.150-155
• /
• 2012

POC(Phase-Only Correlation) is a useful method that can conduct face recognition without using feature extraction or eigenface, but uses Fourier transformation for square areas. In this paper, we propose an effective face area to increase the performance of face recognition using POC. Specifically, three areas are experimented for POC. The frist area is the square area that includes head and space. The second area is the square area from ear to ear horizontally and from the end of chin to the forehead vertically. The third area is the square area from the line under the lips to the forehead vertically and from cheek to cheek horizontally. Experimental results show that the second face area has the best advantage among the three types of areas to define the threshold for POC.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.387-388
• /
• 2006

In this paper, we propose an efficient algorithm based on PCA and LDA combining K-means clustering method, which has better accuracy of face recognition than Eigenface and Fisherface. In this algorithm, PCA is firstly used to reduce the dimensionality of original face image. Secondly, a truncated face image data are sub-clustered by K-means clustering method based on Euclidean distances, and all small subclusters are labeled in sequence. Then LDA method project data into low dimension feature space and group data easier to classify. Finally we use nearest neighborhood method to determine the label of test data. To show the recognition accuracy of the proposed algorithm, we performed several simulations using the Yale and ORL (Olivetti Research Laboratory) database. Simulation results show that proposed method achieves better performance in recognition accuracy.