• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.5
• /
• pp.43-51
• /
• 2009

In this paper, we propose an efficient method of face retrieval by using PCA(principal component analysis) based features. The coarse-to-fine strategy is adopted to sort the retrieval results in the lower dimensional eigenface space and to rearrange candidates at high ranks in higher dimensional eigenface space. To evaluate similarity between a query face image and class reference image, we utilize the PD (projection distance), MQDF(modified quadratic distance function) and MED(minimum Euclidean distance). The experimental results show that the proposed method which rearrange the retrieval results incrementally by using projection distance is efficient for face image retrieval.

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

The statistical analysis of the feature extraction and the neural networks are proposed to recognize a human face. In the preprocessing step, the normalized skin color map with Gaussian functions is employed to extract the region of face candidate. The feature information in the region of the face candidate is used to detect the face region. In the recognition step, as a tested, the 120 images of 10 persons are trained by the backpropagation algorithm. The images of each person are obtained from the various direction, pose, and facial expression. Input variables of the neural networks are the geometrical feature information and the feature information that comes from the eigenface spaces. The simulation results of$.$10 persons show that the proposed method yields high recognition rates.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.315-316
• /
• 2011

일반적으로 영상에서 얼굴 영상을 검출하고 인식하는 알고리즘은 패턴 인식 연구에 있어서 인간과 컴퓨터의 상호작용의 연구라는 면에서 아주 중요한 문제로 연구되어 왔다. 본 논문에서는 고유얼굴을 이용하여 유클리디언 거리법과 퍼지기법의 인식률을 비교해보고자 한다. PCA(Principal Component Analysis) 방식은 우수한 인식 결과를 보장하는 얼굴인식 기법중의 하나이며, 얼굴 영상을 이용하여 공분산 행렬을 계산하고, 공분산 행렬을 통해 생성된 저차원의 벡터, 즉 고유얼굴(Eigenface)을 이용하여 가중치를 계산하고, 이 가중치를 기준으로 인식을 수행하는 기법이다. 이를 기반으로 하여, 본 논문에서는 전처리 과정, 고유얼굴 과정, 유클리디언 거리법 및 퍼지 소속도 함수 설계 과정, 신경망 학습과정, 인식과정으로 구성된 5단계의 얼굴 인식 알고리즘을 제안한다.

• The Journal of Korea Robotics Society
• /
• v.1 no.2
• /
• pp.151-157
• /
• 2006

This paper is concerned with the template-based face recognition from robot camera images with illumination and distance variations. The approaches used in this paper consist of Eigenface, Fisherface, and Icaface which are the most representative recognition techniques frequently used in conjunction with face recognition. These approaches are based on a popular unsupervised and supervised statistical technique that supports finding useful image representations, respectively. Thus we focus on the performance comparison from robot camera images with unwanted variations. The comprehensive experiments are completed for a databases with illumination and distance variations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.822-826
• /
• 2001

The statistical analysis of the feature extraction and the neural networks are proposed to recognize a human face. In the preprocessing step, the normalized skin color map with Gaussian functions is employed to extract the region of face candidate. The feature information in the region of the face candidate is used to detect the face region. In the recognition step, as a tested, the 120 images of 10 persons are trained by the backpropagation algorithm. The images of each person are obtained from the various direction, pose, and facial expression. Input variables of the neural networks are the geometrical feature information and the feature information that comes from the eigenface spaces. The simulation results of 10 persons show that the proposed method yields high recognition rates.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2720-2722
• /
• 2000

This paper proposes a face detection and recognition method that combines the template matching method and the eigenface method with the neural network. In the face extraction step, the skin color information is used. Therefore, the search region is reduced. The global property of the face is achieved by the eigenface method. Face recognition is performed by a neural network that can learn the face property.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.873-876
• /
• 2000

The information-theoretic approach to face recognition is based on the compact coding where face images are decomposed into a small set of basis images. Most popular method for the compact coding may be the principal component analysis (PCA) which eigenface methods are based on. PCA based methods exploit only second-order statistical structure of the data, so higher- order statistical dependencies among pixels are not considered. Independent component analysis (ICA) is a signal processing technique whose goal is to express a set of random variables as linear combinations of statistically independent component variables. ICA exploits high-order statistical structure of the data that contains important information. In this paper we employ the ICA for the efficient feature extraction from face images and show that ICA outperforms the PCA in the task of face recognition. Experimental results using a simple nearest classifier and multi layer perceptron (MLP) are presented to illustrate the performance of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.185-192
• /
• 2004

This paper presents face recognition using vector quantization in the eigenspace of the faces. The existing eigenface method is not enough for representing the variations of faces. For making up for its defects, the proposed method use a clustering of feature vectors by vector quantization in eigenspace of the faces. In the trainning stage, the face images are transformed the points in the eigenspace by eigeface(eigenvetor) and we represent a set of points for each people as the centroids of vector quantizer. In the recognition stage, the vector quantizer finds the centroid having the minimum quantization error between feature vector of input image and centriods of database. The experiments are performed by 600 faces in Faces94 database. The existing eigenface method has minimum 64 miss-recognition and the proposed method has minimum 20 miss-recognition when we use 4 codevectors. In conclusion, the proposed method is a effective method that improves recognition rate through overcoming the variation of faces.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.1-12
• /
• 2004

In this paper, we present an identificable face (n face) detection method robust to color degradation and partial veiling. This method is composed of three parts: segmentation of face candidate regions, extraction of face candidate windows, and decision of veiling. In the segmentation of face candidate regions, face candidate regions are detected by finding skin color regions and facial components such as eyes, a nose and a mouth, which may have degraded colors, from an input image. In the extraction of face candidate windows, face candidate windows which have high potentials of faces are extracted in face candidate regions. In the decision of veiling, using an eigenface method, a face candidate window whose similarity with eigenfaces is maximum is determined and whether facial components of the face candidate window are veiled or not is determined in the similar way. Experimental results show that the proposed method yields better the detection rate by about $11.4\%$ in test DB containing color-degraded faces and veiled ones than a conventional method without considering color degradation and partial veiling.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.365-366
• /
• 2009