• Journal of Korea Game Society
• /
• v.13 no.4
• /
• pp.15-24
• /
• 2013

The game of Go, which is originated at least more than 2,500 years ago, is one of the oldest board games in the world. So far the theoretical studies concerning to the Go openings are still insufficient. We applied traditional LDA algorithm to recognize a pro player's opening to a class obtained from the training openings. Both class-independent LDA and class-dependent LDA methods are conducted with the Go game records of the Korean top 10 professional Go players. Experimental result shows that the average recognition rate of class-independent LDA is 14% and class-dependent LDA 12%, respectively. Our research result also shows that in contrary to our common sense the algorithm based on PCA outperforms the algorithm based on LDA and reveals the new fact that the Euclidean distance metric method rarely does not inferior to LDA.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.41-48
• /
• 2005

This paper presents a face recognition method based on the combination of well-known statistical representations of Principal Component Analysis(PCA), and Linear Discriminant Analysis(LDA) with Radial Basis Function Networks. The original face image is first processed by PCA to reduce the dimension, and thereby avoid the singularity of the within-class scatter matrix in LDA calculation. The result of PCA process is applied to LDA classifier. In the second approach, the LDA process Produce a discriminational features of the face image, which is taken as the input of the Radial Basis Function Network(RBFN). The proposed approaches has been tested on the ORL face database. The experimental results have been demonstrated, and the recognition rate of more than 93.5% has been achieved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.2
• /
• pp.208-212
• /
• 2013

Due to the singularity of the within-class scatter, linear discriminant analysis (LDA) becomes ill-posed for small sample size (SSS) problems. An extension of LDA, the null space-based LDA (NLDA) provides good discriminant performances for SSS problems. In this paper, by applying the Lagrange technique, the procedure of transforming the problem of finding the feature extractor of NLDA into a linear equation problem is derived.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.64-69
• /
• 2008

This paper discusses low resolution face recognition using the photon-counting linear discriminant analysis (LDA). The photon-counting LDA asymptotically realizes the Fisher criterion without dimensionality reduction since it does not suffer from the singularity problem of the fisher LDA. The linear discriminant function for optimal projection is determined in high dimensional space to classify unknown objects, thus, it is more efficient in dealing with low resolution facial images as well as conventional face distortions. The simulation results show that the proposed method is superior to Eigen face and Fisher face in terms of the accuracy and false alarm rates.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.4
• /
• pp.104-111
• /
• 2004

In this paper, we propose a diagnosis algorithm to detect faults of induction motor using LDA First, after reducing the input dimension of a current value measured by experiment at each period using PCA method, we extract characteristic vectors for each fault using LDA Next, we analyze the driving condition of an induction motor using the Euclidean distance between a precalculated characteristic vector and an input vector. Finally, from the experiments under various noise conditions showing the properties of the LDA method, we obtained better results than the case of using the PCA method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.125-130
• /
• 2018

Linear discriminant analysis is a statistical analysis method that is generally used for dimensionality reduction of the feature vectors or for class classification. However, in the case of a data set that cannot be linearly separated, it is possible to make a linear separation by mapping a feature vector into a higher dimensional space using a nonlinear function. This method is called generalized discriminant analysis or kernel discriminant analysis. In this paper, we carried out target classification experiments with active sonar target signals available on the Internet using both liner discriminant and generalized discriminant analysis methods. Experimental results are analyzed and compared with discussions. For 104 test data, LDA method has shown correct recognition rate of 73.08%, however, GDA method achieved 95.19% that is also better than the conventional MLP or kernel-based SVM.

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

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

• Smart Media Journal
• /
• v.7 no.4
• /
• pp.90-98
• /
• 2018

A Multilinear LDA Method of Tensor Representation for ECG Signal Based Individual Identification Electrocardiogram signals, included in the cardiac electrical activity, are often analyzed and used for various purposes such as heart rate measurement, heartbeat rhythm test, heart abnormality diagnosis, emotion recognition and biometrics. The objective of this paper is to perform individual identification operation based on Multilinear Linear Discriminant Analysis (MLDA) with the tensor feature. The MLDA can solve dimensional aspects of classification problems in high-dimensional tensor, and correlated subspaces can be used to distinguish between different classes. In order to evaluate the performance, we used MPhysionet's MIT-BIH database. The experimental results on this database showed that the individual identification by MLDA outperformed that by PCA and LDA.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.645-652
• /
• 2004

Among the biometrics, signature shows more larger variation than the other biometrics such as fingerprint and iris. In order to overcome this problem, we propose a robust offline signature verification method based on PCA and LDA. Signature is projected to vertical and horizontal axes by new grid partition method. And then feature extraction and decision is performed by PCA and LDA. Experimental results show that the proposed offline signature verification has lower False Reject Rate(FRR) and False Acceptance Rate(FAR) which are 1.45% and 2.1%, respectively.