• Title/Summary/Keyword: LDA Method

Search Result 270, Processing Time 0.094 seconds

C2DPCA & R2DLDA for Face Recognition (얼굴 인식 시스템을 위한 C2DPCA & R2DLDA)

  • Yun, Tae-Sung;Song, Young-Jun;Kim, Dong-Woo;Ahn, Jae-Hyeong
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.8
    • /
    • pp.18-25
    • /
    • 2010
  • The study has proposed a method that simultaneously takes advantage of each projection matrix acquired by using column-directional two-dimensional PCA(C2DPCA) and row-directional two-dimensional LDA(R2DLDA). The proposed method can acquire a great secure recognition rate, with no relation to the number of training images, with acquired low-dimensional feature matrixes including both the horizontal and the vertical features of a face. Besides, in the alternate experiment of PCA and LDA to row-direction and column-direction respectively(C2DPCA & R2DLDA, C2DLDA & R2DPCA), we could make sure the system of 2 dimensional LDA with row-directional feature(C2DPCA & R2DLDA) obtain higher recognition rate with low dimension than opposite case. As a result of experimenting that, the proposed method has showed a greater recognition rate of 99.4% than the existing methods such as 2DPCA and 2DLDA, etc. Also, it was proved that its recognition processing is over three times as fast as that of 2DPCA or 2DLDA.

Robust Speaker Identification Using Linear Transformation Optimized for Diagonal Covariance GMM (대각공분산 GMM에 최적인 선형변환을 이용한 강인한 화자식별)

  • Kim, Min-Seok;Yang, Il-Ho;Yu, Ha-Jin
    • MALSORI
    • /
    • no.65
    • /
    • pp.67-80
    • /
    • 2008
  • We have been building a text-independent speaker recognition system that is robust to unknown channel and noise environments. In this paper, we propose a linear transformation to obtain robust features. The transformation is optimized to maximize the distances between the Gaussian mixtures. We use rotation of the axes, to cope with the problem of scaling the transformation matrix. The proposed transformation is similar to PCA or LDA, but can achieve better result in some special cases where PCA and LDA can not work properly. We use YOHO database to evaluate the proposed method and compare the result with PCA and LDA. The results show that the proposed method outperforms all the baseline, PCA and LDA.

  • PDF

Topic Expansion based on Infinite Vocabulary Online LDA Topic Model using Semantic Correlation Information (무한 사전 온라인 LDA 토픽 모델에서 의미적 연관성을 사용한 토픽 확장)

  • Kwak, Chang-Uk;Kim, Sun-Joong;Park, Seong-Bae;Kim, Kweon Yang
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.9
    • /
    • pp.461-466
    • /
    • 2016
  • Topic expansion is an expansion method that reflects external data for improving quality of learned topic. The online learning topic model is not appropriate for topic expansion using external data, because it does not reflect unseen words to learned topic model. In this study, we proposed topic expansion method using infinite vocabulary online LDA. When unseen words appear in learning process, the proposed method allocates unseen word to topic after calculating semantic correlation between unseen word and each topic. To evaluate the proposed method, we compared with existing topic expansion method. The results indicated that the proposed method includes additional information that is not contained in broadcasting script by reflecting external documents. Also, the proposed method outperformed on coherence evaluation.

A Resampling Method for Small Sample Size Problems in Face Recognition using LDA (LDA를 이용한 얼굴인식에서의 Small Sample Size문제 해결을 위한 Resampling 방법)

  • Oh, Jae-Hyun;Kwak, Jo-Jun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.78-88
    • /
    • 2009
  • In many face recognition problems, the number of available images is limited compared to the dimension of the input space which is usually equal to the number of pixels. This problem is called as the 'small sample size' problem and regularization methods are typically used to solve this problem in feature extraction methods such as LDA. By using regularization methods, the modified within class matrix becomes nonsingu1ar and LDA can be performed in its original form. However, in the process of adding a scaled version of the identity matrix to the original within scatter matrix, the scale factor should be set heuristically and the performance of the recognition system depends on highly the value of the scalar factor. By using the proposed resampling method, we can generate a set of images similar to but slightly different from the original image. With the increased number of images, the small sample size problem is alleviated and the classification performance increases. Unlike regularization method, the resampling method does not suffer from the heuristic setting of the parameter producing better performance.

Face Recognition of partial faces using LDA (LDA를 이용한 부분 얼굴 인식)

  • Park, Lee-Ju;On, Seung-Yeop
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.1006-1009
    • /
    • 2003
  • In this paper, we propose a technique of the recognition of partial face. Most of the research is concentrated on the recognition of whole face Since part of the face area in an image can be damaged or overlapped, face recognition based on partial face is required. PCA and LDA technique is applied to the recognition of partial face. Also, a new method to combine the results of the recognition of parts of the face.

  • PDF

Comparison of LDA and PCA for Korean Pro Go Player's Opening Recognition (한국 프로바둑기사 포석 인식을 위한 선형판별분석과 주성분분석 비교)

  • Lee, Byung-Doo
    • 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.

An Off-line Signature Verification Using PCA and LDA (PCA와 LDA를 이용한 오프라인 서면 검증)

  • Ryu Sang-Yeun;Lee Dae-Jong;Go Hyoun-Joo;Chun Myung-Geun
    • 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.

The Suggestion of LINF Algorithm for a Real-time Face Recognition System (실시간 얼굴인식 시스템을 위한 새로운 LINF 알고리즘의 제안)

  • Jang Hye-Kyoung;Kang Dae-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.79-86
    • /
    • 2005
  • In this paper, we propose a new LINF(Linear Independent Non-negative Factorization) algorithm for real-time face recognition systea This system greatly consists of the two parts: 1) face extraction part; 2) face recognition part. In the face extraction Part we applied subtraction image, the detection of eye and mouth region , and normalization method, and then in the face recognition Part we used LINF in extracted face candidate region images. The existing recognition system using only PCA(Principal Component Analysis) showed low recognition rates, and it was hard in the recognition system using only LDA(Linear Discriminants Analysis) to apply LDA directly when the training set is small. To overcome these shortcomings, we reduced dimension as the matrix that had non-negative value to be different from former eigenfaces and then applied LDA to the matrix in the proposed system We have experimented using self-organized DAIJFace database and ORL database offered by AT(')T laboratory in Cambridge, U.K. to evaluate the performance of the proposed system. The experimental results showed that the proposed method outperformed PCA, LDA, ICA(Independent Component Analysis) and PLMA(PCA-based LDA mixture algorithm) method within the framework of recognition accuracy.

Comparison of Topic Modeling Methods for Analyzing Research Trends of Archives Management in Korea: focused on LDA and HDP (국내 기록관리학 연구동향 분석을 위한 토픽모델링 기법 비교 - LDA와 HDP를 중심으로 -)

  • Park, JunHyeong;Oh, Hyo-Jung
    • Journal of Korean Library and Information Science Society
    • /
    • v.48 no.4
    • /
    • pp.235-258
    • /
    • 2017
  • The purpose of this study is to analyze research trends of archives management in Korea by comparing LDA (Latent Semantic Allocation) topic modeling, which is the most famous method in text mining, and HDP (Hierarchical Dirichlet Process) topic modeling, which is developed LDA topic modeling. Firstly we collected 1,027 articles related to archives management from 1997 to 2016 in two journals related with archives management and four journals related with library and information science in Korea and performed several preprocessing steps. And then we conducted LDA and HDP topic modelings. For a more in-depth comparison analysis, we utilized LDAvis as a topic modeling visualization tool. At the results, LDA topic modeling was influenced by frequently keywords in all topics, whereas, HDP topic modeling showed specific keywords to easily identify the characteristics of each topic.

Eigenvalue Regularization for Improving Nonlinear LDA in Face Recognition (얼굴인식에서의 고유값 조정을 통한 비선형 판별 분석의 향상)

  • Kim, Sang-Ki;Lee, Hyo-Bin;Kim, Seong-Wan;Lee, Sang-Youn
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.985-986
    • /
    • 2008
  • In this paper, we introduce a novel variant of LDA for face renition. The proposed method is derived by regularizing the eigenvalue of nonlinear LDA. We evaluated the proposed method using AR face database, and it showed outstanding and stable performance over the preceding LDA variants.

  • PDF