• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.847-850
• /
• 2000

This paper proposes an image compressing and template matching algorithm for face image using GHA (Generalized Hebbian Algorithm). GHA is a part of PCA (Principal Component Analysis), that has single-layer perceptrons and operates and self-organizing performance. We used this algorithm for feature extraction of face shape, and our simulations verify the high performance for the proposed method. The shape for face in the fact that the eigenvector of face image can be efficiently represented as a coefficient that can be acquired by a set of basis is to compress data of image. From the simulation results, the mean PSNR performance is 24.08[dB] at 0.047bpp, and reconstruction experiment shows that good reconstruction capacity for an image that not joins at leaning.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3675-3682
• /
• 1999

This paper proposes the method to extract face components without using the color information and the motion information in a gray image. A laplacian pyramid of the original image is built. Eye and nose candidates are extracted using only the gray information in a low resolution laplacian image and pairs are found that consist of two eye candidates and a nose one. At full resolution, horizontal and vortical edges are found in the regions of face components which are established using the candidates. Using those edge informations, face components are extracted. The experiments have been performed for images with various sizes and positions of face, and show very encouraging result.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.615-618
• /
• 2002

This paper proposes a real-time face detection and tracking a method in complex backgrounds. The proposed method is based on the principal component analysis (PCA) technique. For the detection of a face, first, we use a skin color model and motion information. And then using the PCA technique the detected regions are verified to determine which region is indeed the face. The tracking of a face is based on the Euclidian distance in eigenspace between the previously tracked face and the newly detected faces. Camera control for the face tracking is done in such a way that the detected face region is kept on the center of the screen by controlling the pan/tilt platform. The proposed method is extensible to other systems such as teleconferencing system, intruder inspection system, and so on.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5474-5490
• /
• 2017

Although two-dimensional principal component analysis (2DPCA) has been shown to be successful in face recognition system, it is still very sensitive to illumination variations. To reduce the effect of these variations, texture-based techniques are used due to their robustness to these variations. In this paper, we explore several texture-based techniques and determine the most appropriate one to be used with 2DPCA-based techniques for face recognition. We also propose a new distance metric computation in 2DPCA called Row Assembled Matrix Distance (RowAMD). Experiments on Yale Face Database, Extended Yale Face Database B, AR Database and LFW Database reveal that the proposed RowAMD distance computation method outperforms other conventional distance metrics when Local Line Binary Pattern (LLBP) and Multi-scale Block Local Binary Pattern (MB-LBP) are used for face authentication and face identification, respectively. In addition to this, the results also demonstrate the robustness of the proposed RowAMD with several texture-based techniques.

• Journal of the Korean housing association
• /
• v.20 no.4
• /
• pp.31-38
• /
• 2009

In our country, the application of the design method of face to face dimension in wall-slab apartment has passed 10 years. So MC(Modular Coordination) design method has fixed in the design step to some degree. In Design and Work Execution of House the exclusive area of the apartment was calculated by face to face dimension. And the term of face to face dimension was known broadly to clients, construction company, etc. But design method of face to face dimension is not to simply extend the room size so far as wall depth in design process but to ensure the actual space should be considered with efficient use and assembly of building components. That is to say, Design method of face to face dimension is not to be defined by design step but to be related with construction and maintenance. However in construction process the point of face to face design method was not understood even now. So the purpose of this study was to extract the effect and question of face to face design method in construction process by survey of actual condition of structure and construction quality, and compare this result with existing construction method. The following project of this study is to survey of actual condition of interior components such as gypsum board, windows & doors etc. Therefore this study is to induce architectural long-life through architectural standardization construction and component's exchange, and, by the subject of the study on Apartment to have design guideline and basis for joining part between Gypsumboard and windows.

• Journal of Korea Multimedia Society
• /
• v.18 no.5
• /
• pp.610-619
• /
• 2015

*In this paper, we propose a real-time face tracking system using an adaptive face detector and a tracking algorithm. An image is divided into the regions of background and face candidate by a real-time updated skin color identifying system in order to accurately detect facial features. The facial characteristics are extracted using the five types of simple Haar-like features. The extracted features are reinterpreted by Principal Component Analysis (PCA), and the interpreted principal components are processed by Support Vector Machine (SVM) that classifies into facial and non-facial areas. The movement of the face is traced by Kalman filter and Mean shift, which use the static information of the detected faces and the differences between previous and current frames. The proposed system identifies the initial skin color and updates it through a real-time color detecting system. A similar background color can be removed by updating the skin color. Also, the performance increases up to 20% when the background color is reduced in comparison to extracting features from the entire region. The increased detection rate and speed are acquired by the usage of Kalman filter and Mean shift.

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

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.1-5
• /
• 2007

This paper proposes a technique for principal component analysis (PCA) to raise the recognition rate of a front face in a low dimension by hierarchical image and parallel processing structure. The conventional PCA shows a recognition rate of less than 50% in a low dimension (dimensions 1 to 6) when used for facial recognition. In this paper, a face is formed as images of 3 fixed-size levels: the 1st being a region around the nose, the 2nd level a region including the eyes, nose, and mouth, and the 3rd level image is the whole face. PCA of the 3-level images is treated by parallel processing structure, and finally their similarities are combined for high recognition rate in a low dimension. The proposed method under went experimental feasibility study with ORL face database for evaluation of the face recognition function. The experimental demonstration has been done by PCA and the proposed method according to each level. The proposed method showed high recognition of over 50% from dimensions 1 to 6.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.5
• /
• pp.744-752
• /
• 2012

In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as an one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problems. In data preprocessing part, Principal Component Analysis(PCA) which is generally used in face recognition, which is useful to express some classes using reduction, since it is effective to maintain the rate of recognition and to reduce the amount of data at the same time. However, because of there of the whole face image, it can not guarantee the detection rate about the change of viewpoint and whole image. Thus, to compensate for the defects, Linear Discriminant Analysis(LDA) is used to enhance the separation of different classes. In this paper, we combine the PCA&LDA algorithm and design the optimized pRBFNNs for recognition module. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of pRBFNNs is represented as two kinds of polynomials such as constant, and linear. The coefficients of connection weight identified with back-propagation using gradient descent method. The output of the pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. The proposed pRBFNNs are applied to face image(ex Yale, AT&T) datasets and then demonstrated from the viewpoint of the output performance and recognition rate.

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