• The Journal of the Acoustical Society of Korea
• /
• v.25 no.1
• /
• pp.36-42
• /
• 2006

A Principal component analysis (PCA)-based Mel-Frequency Discrete Wavelet Coefficients (MFDWC) feature Parameters for speaker verification system is Presented in this Paper In this method, we used the 1st-eigenvector obtained from PCA to calculate the energy of each node of level that was approximated by. met-scale. This eigenvector satisfies the constraint of general weighting function that the squared sum of each component of weighting function is unity and is considered to represent speaker's characteristic closely because the 1st-eigenvector of each speaker is fairly different from the others. For verification. we used Universal Background Model (UBM) approach that compares claimed speaker s model with UBM on frame-level. We performed experiments to test the effectiveness of PCA-based parameter and found that our Proposed Parameters could obtain improved average Performance of $0.80\%$compared to MFCC. $5.14\%$ to LPCC and 6.69 to existing MFDWC.

• Phonetics and Speech Sciences
• /
• v.1 no.1
• /
• pp.69-73
• /
• 2009

This paper proposes an efficient global covariance-based principal component analysis (GCPCA) for speaker identification. Principal component analysis (PCA) is a feature extraction method which reduces the dimension of the feature vectors and the correlation among the feature vectors by projecting the original feature space into a small subspace through a transformation. However, it requires a larger amount of training data when performing PCA to find the eigenvalue and eigenvector matrix using the full covariance matrix by each speaker. The proposed method first calculates the global covariance matrix using training data of all speakers. It then finds the eigenvalue matrix and the corresponding eigenvector matrix from the global covariance matrix. Compared to conventional PCA and Gaussian mixture model (GMM) methods, the proposed method shows better performance while requiring less storage space and complexity in speaker identification.

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

• MALSORI
• /
• no.66
• /
• pp.105-116
• /
• 2008

In this research, we propose a speaker identification system using a kernel method which is expected to model the non-linearity of speech features well. We have been using principal component analysis (PCA) successfully, and extended to kernel PCA, which is used for many pattern recognition tasks such as face recognition. However, we cannot use kernel PCA for speaker identification directly because the storage required for the kernel matrix grows quadratically, and the computational cost grows linearly (computing eigenvector of $l{\times}l$ matrix) with the number of training vectors I. Therefore, we use greedy kernel PCA which can approximate kernel PCA with small representation error. In the experiments, we compare the accuracy of the greedy kernel PCA with the baseline Gaussian mixture models using MFCCs and PCA. As the results with limited enrollment data show, the greedy kernel PCA outperforms conventional methods.

• The Journal of Fisheries Business Administration
• /
• v.15 no.1
• /
• pp.58-80
• /
• 1984

The classification of islands is prerequisite for establishing a development policy to vitalize many-sided function of islands. We try to classify the 440 inhabited islands which exist in Jeon-Nam area and Kyong-Nam area by means of PCA. PCA begins with making correlation matrix of orignal variables. From this matrix we can comprehend the rough relationships between two variables. Next, we look for the eigenvalues which are roots of characteristic equation of correlation matrix. The number of eigenvalues is equal to that of original variables. We choose the largest eigenvalue λ$_1$among them and then look for the eigenvector of correlation matrix corresponding to the largest eigenvalue. Linear combination of eigenvector obtained above and original variables is namely first Principal Component (PC). Using an eigenvalue criterion(λ$\geq$ 1), we choose 3 PCs in Jeon-Nam area and 2 PCs in Kyong-Nam area. But we decide to consider only two PCs in both areas to faciliate a comparative analysis. Now, loss of information is 31.7% in Jeon-Nam area and 26.64% in Kyong-Nam area. PCs extracted by preceding procedure have characteristics as follows. The first PC relates to aggregate size of islands in case of both areas. The second PC relates to income per household, factors of agricultural production and factors of fisheries production in Jeon-Nam area, but in Kyong-Nam area it means distance from island and income per household. A classification of islands can be attained by plotting component scores of each island in graph used two PCs as axes and grouping similiar islands. 6 groups are formed in Jeon-Nam area and 5 groups in Kyong-Nam area. The result of this study in kyong-Nam area accords with prior result of study.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.39-47
• /
• 2015

The centrality is calculated to describe the importance of a node in a graph and ranking is given according to the centrality for each node. There are many centrality measures and we use degree centrality, closeness centrality, eigenvector centrality, and betweenness centrality. In this paper, we analyze the effect of an additional edge of a graph on centrality and ranking through experimental computations. It is found that the effect of an additional edge on centrality and ranking of the nodes in the graph is different according to the graph structure using PCA. The results can be used for define the graph characteristics.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.33-40
• /
• 2004

In this paper, we constructs face database by using wavelet comparison, and compare face recognition rate by using principle component analysis (Principal Component Analysis : PCA) algorithm. General face recognition method constructs database, and do face recognition by using normalized size. Proposed method changes image of normalized size (92${\times}$112) to 1 step, 2 step, 3 steps to wavelet compression and construct database. Input image did compression by wavelet and a face recognition experiment by PCA algorithm. As well as method that is proposed through an experiment reduces existing face image's information, the processing speed improved. Also, original image of proposed method showed recognition rate about 99.05%, 1 step 99.05%, 2 step 98.93%, 3 steps 98.54%, and showed that is possible to do face recognition constructing face database of large quantity.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.33-40
• /
• 2006

This paper presents an efficient face recognition method using both first moment of image and eigenvector. First moment is a method for finding centroid of image, which is applied to exclude the needless backgrounds in the face recognitions by shitting to the centroid of face image. Eigenvector which are the basis images as face features, is extracted by principal component analysis(PCA). This is to improve the recognition performance by excluding the redundancy considering to second-order statistics of face image. The proposed methods has been applied to the problem for recognizing the 60 face images(15 persons *4 scenes) of 320*243 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. In case of the 45 face images, the experimental results show that the recognition rate of the proposed methods is about 1.6 times and its the classification is about 5.6 times higher than conventional PCA without preprocessing. The city-block has been relatively achieved more an accurate classification than Euclidean or negative angle.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.649-654
• /
• 2005

In this paper, we describe an implementation of real-time face recognition system under ubiquitous computing environments. First, face image is captured by PDA with CMOS camera and then this image with user n and name is transmitted via WLAN(Wireless LAN) to the server and finally PDA receives verification result from the server The proposed system consists of server and client parts. Server uses PCA and LDA algorithm which calculates eigenvector and eigenvalue matrices using the face images from the PDA at enrollment process. And then, it sends recognition result using Euclidean distance at verification process. Here, captured image is first compressed by the wave- let transform and sent as JPG format for real-time processing. Implemented system makes an improvement of the speed and performance by comparing Euclidean distance with previously calculated eigenvector and eignevalue matrices in the learning process.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.34 no.4
• /
• pp.159-169
• /
• 2020

Shanghanlun (Treatise on Cold Damage Diseases) is the oldest document in the literature on clinical records of Traditional Asian medicine (TAM), on which TAM theories about symptoms-herbs relationships are based. In this study, we aim to quantitatively explore the relationships between symptoms and herbs in Shanghanlun. The text in Shanghanlun was converted into structured data. Using the structured data, Term Frequency - Inverse Document Frequency (TF-IDF) scores of symptoms and herbs were calculated from each chapter to derive the major symptoms and herbs in each chapter. To understand the structure of the entire document, principal component analysis (PCA) was performed for the 6-dimensional chapter space. Bipartite network analysis was conducted focusing on Jaccard scores between symptoms and herbs and eigenvector centralities of nodes. TF-IDF scores showed the characteristics of each chapter through major symptoms and herbs. Principal components drawn by PCA suggested the entire structure of Shanghanlun. The network analysis revealed a 'multi herbs - multi symptoms' relationship. Common symptoms and herbs were drawn from high eigenvector centralities of their nodes, while specific symptoms and herbs were drawn from low centralities. Symptoms expected to be treated by herbs were derived, respectively. Using measurable metrics, we conducted a computational study on patterns of Shanghanlun. Quantitative researches on TAM theories will contribute to improving the clarity of TAM theories.