• ETRI Journal
• /
• v.31 no.4
• /
• pp.438-447
• /
• 2009

In this paper, a novel image projection technique for face recognition application is proposed which is based on linear discriminant analysis (LDA) combined with the relevance-weighted (RW) method. The projection is performed through 2-directional and 2-dimensional LDA, or $(2D)^2$LDA, which simultaneously works in row and column directions to solve the small sample size problem. Moreover, a weighted discriminant hyperplane is used in the between-class scatter matrix, and an RW method is used in the within-class scatter matrix to weigh the information to resolve confusable data in these classes. This technique is called the relevance-weighted $(2D)^2$LDA, or RW$(2D)^2$LDA, which is used for a more accurate discriminant decision than that produced by the conventional LDA or 2DLDA. The proposed technique has been successfully tested on four face databases. Experimental results indicate that the proposed RW$(2D)^2$LDA algorithm is more computationally efficient than the conventional algorithms because it has fewer features and faster times. It can also improve performance and has a maximum recognition rate of over 97%.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.274-277
• /
• 2000

Linear discriminant analysis (LDA) is a basic tool of pattern recognition, and it is used in extensive fields, e.g. face identification. However, LDA is poor at adaptability since it is a batch type algorithm. To overcome this, a new algorithm of online LDA is proposed in the present paper. It is experimentally shown that the new algorithm is about two times faster than the previously proposed algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.252-258
• /
• 2007

In this paper, a face recognition algorithm system using Principal Component Analysis (PCA) is proposed. The algorithm recognized a person by comparing characteristics (features) of the face to those of known individuals of Intelligent Control Laboratory (ICONL) face database. Simulations are carried out to investigate the algorithm recognition performance, which classified the face as a face or non-face and then classified it as known or unknown one. Particularly, a Principal Components of Linear Discriminant Analysis (PCA + LDA) face recognition algorithm is also proposed in order to confirm the recognition performances and the adaptability of a proposed PCA for a certain specific system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.735-740
• /
• 2012

In this paper, we introduce design methodologies of polynomial radial basis function neural network classifier with the aid of Principal Component Analysis(PCA) and Linear Discriminant Analysis(LDA). By minimizing the information loss of given data, Feature data is obtained through preprocessing of PCA and LDA and then this data is used as input data of RBFNNs. The hidden layer of RBFNNs is built up by Fuzzy C-Mean(FCM) clustering algorithm instead of receptive fields and linear polynomial function is used as connection weights between hidden and output layer. In order to design optimized classifier, the structural and parametric values such as the number of eigenvectors of PCA and LDA, and fuzzification coefficient of FCM algorithm are optimized by Artificial Bee Colony(ABC) optimization algorithm. The proposed classifier is applied to some machine learning datasets and its result is compared with some other classifiers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.897-904
• /
• 2005

Face Recognition has been an active research area because it is not difficult to acquire face image data and it is applicable in wide range area in real world. Due to the high dimensionality of a face image space, however, it is not easy to process the face images. In this paper, we propose a method to reduce the dimension of the facial data and extract the features from them. It will be solved using the method which extracts the features from holistic face images. The proposed algorithm consists of two parts. The first is the using of principal component analysis (PCA) to transform three dimensional color facial images to one dimensional gray facial images. The second is integrated linear discriminant analusis (PCA+LDA) to prevent the loss of informations in case of performing separated steps. Integrated LDA is integrated algorithm of PCA for reduction of dimension and LDA for discrimination of facial vectors. First, in case of transformation from color image to gray image, PCA(Principal Component Analysis) is performed to enhance the image contrast to raise the recognition rate. Second, integrated LDA(Linear Discriminant Analysis) combines the two steps, namely PCA for dimensionality reduction and LDA for discrimination. It makes possible to describe concise algorithm expression and to prevent the information loss in separate steps. To validate the proposed method, the algorithm is implemented and tested on well controlled face databases.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.72-79
• /
• 2002

This paper presents an efficient face detection algorithm for color images with a complex background. The presented algorithm utilizes the color information and eigenface that is calculated by PCA-LDA (Principle Component Analysis - Linear Discriminant Analysis). The method of using the color information is faster than any other methods. Eigenface includes average information of the whole test faces. Therefore eigenface can decide that the candidate region is a face. The whole process is composed of two steps. First, it finds first face candidates region of skin tone using a color information in image. We can get a size and position of face candidate region. Second, we compare first face candidate region with eigenface, so decide that an image whether include a face or not. The advantages of the proposed approach include that increasing the detection speed by deciding a size and position of first face candidates region. Also, Betting 97% of the detection rate by comparing the eigenfaces calculated in PCA-LDA.

• 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 the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.380-387
• /
• 2010

For the fault diagnosis of three-phase induction motors, we propose a diagnosis algorithm based on mutual information and linear discriminant analysis (LDA). The experimental unit consists of machinery module for induction motor drive and data acquisition module to obtain the fault signal. As the first step for diagnosis procedure, DFT is performed to transform the acquired current signal into frequency domain. And then, frequency components are selected according to discriminate order calculated by mutual information As the next step, feature extraction is performed by LDA, and then diagnosis is evaluated by k-NN classifier. The results to verify the usability of the proposed algorithm showed better performance than various conventional methods.

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

• MALSORI
• /
• no.66
• /
• pp.61-72
• /
• 2008

This paper proposes a method to improve pathological and normal voice classification performance by combining multiple features such as auditory-based and higher-order features. Their performances are measured by Gaussian mixture models (GMMs) and linear discriminant analysis (LDA). The combination of multiple features proposed by the frame-based LDA method is shown to be an effective method for pathological and normal voice classification, with a 87.0% classification rate. This is a noticeable improvement of 17.72% compared to the MFCC-based GMM algorithm in terms of error reduction.