• Communications for Statistical Applications and Methods
• /
• v.24 no.2
• /
• pp.143-154
• /
• 2017

A variable selection method based on probabilistic principal component analysis (PCA) using penalized likelihood method is proposed. The proposed method is a two-step variable reduction method. The first step is based on the probabilistic principal component idea to identify principle components. The penalty function is used to identify important variables in each component. We then build a model on the original data space instead of building on the rotated data space through latent variables (principal components) because the proposed method achieves the goal of dimension reduction through identifying important observed variables. Consequently, the proposed method is of more practical use. The proposed estimators perform as the oracle procedure and are root-n consistent with a proper choice of regularization parameters. The proposed method can be successfully applied to high-dimensional PCA problems with a relatively large portion of irrelevant variables included in the data set. It is straightforward to extend our likelihood method in handling problems with missing observations using EM algorithms. Further, it could be effectively applied in cases where some data vectors exhibit one or more missing values at random.

• Journal of Korea Technical Association of The Pulp and Paper Industry
• /
• v.48 no.1
• /
• pp.34-42
• /
• 2016

In this study, we classified three copying papers and Korean, Chinese, and Japanese traditional papers using IR and/or NIR spectra and principal component analysis. Various chemicals are used when producing fine papers. In this case, the IR method to analyze functional groups is suitable for the classification of paper. On the other hand, NIR analysis is more suitable for the classification of traditional papers, as it uses nearly raw materials (pulp). Therefore, principal component analysis using IR and NIR depending on the paper production process will be the classification tool of paper.

• The Korean Journal of Applied Statistics
• /
• v.35 no.2
• /
• pp.327-333
• /
• 2022

Principal component analysis (PCA) is the most widely used technique in dimension reduction, however, it is very sensitive to outliers. A robust version of PCA, called robust PCA, was suggested by two seminal papers by Candès et al. (2011) and Chandrasekaran et al. (2011). The robust PCA is an essential tool in the artificial intelligence such as background detection, face recognition, ranking, and collaborative filtering. Also, the robust PCA receives a lot of attention in statistics in addition to computer science. In this paper, we introduce recent algorithms for the robust PCA and give some illustrative examples.

• 한국방재학회:학술대회논문집
• /
• 2011.02a
• /
• pp.39-39
• /
• 2011

This study presents an effective vision-based system for cable bridge damage detection. In theory, cable bridges need to be inspected the outer as well as the inner part. Starting from August 2010, a new research project supported by Korea Ministry of Land, Transportation Maritime Affairs(MLTM) was initiated focusing on the damage detection of cable system. In this study, only the surface damage detection algorithm based on a vision-based system will be focused on, an overview of the vision-based cable damage detection is given in Fig. 1. Basically, the algorithm combines the image enhancement technique with principal component analysis(PCA) to detect damage on cable surfaces. In more detail, the input image from a camera is processed with image enhancement technique to improve image quality, and then it is projected into PCA sub-space. Finally, the Mahalanobis square distance is used for pattern recognition. The algorithm was verified through laboratory tests on three types of cable surface. The algorithm gave very good results, and the next step of this study is to implement the algorithm for real cable bridges.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.05a
• /
• pp.121-124
• /
• 2006

본 논문에서는 Bacterial Foraging Algorithm과 FCM(fuzzy c-means)클러스터링을 이용하여 TSK(Takagi-Sugeno-Kang)형태의 퍼지 규칙 생성과 퍼지 시스템(FCM-ANFIS)을 효과적으로 구축하는 방법을 제안한다. 구조동정에서는 먼저 PCA(Principal Component Analysis)을 이용하여 입력 데이터 성분간의 상관관계를 제거한 후에 FCM을 이용하여 클러스터를 생성하고 성능지표에 근거해서 타당한 클러스터의 수, 즉 퍼지 규칙의 수를 얻는다. 파라미터 동정에서는 Bacterial Foraging Algorithm을 이용하여 전제부 파라미터를 최적화 시킨다. 결론부 파라미터는 RLSE(Recursive Least Square Estimate)에 의해 추정되어진다. PCA(Principal Component Analysis)와 FCM을 적용함으로써 타당한 규칙 수를 생성하였고 Bacterial Foraging Algorithm을 이용하여 최적의 전제부 파라미터를 구하였다. 제안된 방법의 성능을 평가하기 위하여 Box-Jenkins의 가스로 데이터와 Rice taste 데이터의 모델링에 적용하였고 우수한 성능을 보임을 알 수 있었다.

• Journal of Integrative Natural Science
• /
• v.1 no.2
• /
• pp.133-139
• /
• 2008

Face recognition technologies using PCA(principal component analysis) recognize faces by deciding representative features of faces in the model image, extracting feature vectors from faces in a image and measuring the distance between them and face representation. Given frequent recognition problems associated with the use of point-to-point distance approach, this study adopted the K-nearest neighbor technique(class-to-class) in which a group of face models of the same class is used as recognition unit for the images inputted on a continual input image. This paper proposes a new PCA recognition in which database of faces.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.3
• /
• pp.162-170
• /
• 2014

Appearance-based subspace models such as eigenfaces have been widely recognized as one of the most successful approaches to face recognition and tracking. The success of eigenfaces mainly has its origins in the benefits offered by principal component analysis (PCA), the representational power of the underlying generative process for high-dimensional noisy facial image data. The sparse extension of PCA (SPCA) has recently received significant attention in the research community. SPCA functions by imposing sparseness constraints on the eigenvectors, a technique that has been shown to yield more robust solutions in many applications. However, when SPCA is applied to facial images, the time and space complexity of PCA learning becomes a critical issue (e.g., real-time tracking). In this paper, we propose a very fast and scalable greedy forward selection algorithm for SPCA. Unlike a recent semidefinite program-relaxation method that suffers from complex optimization, our approach can process several thousands of data dimensions in reasonable time with little accuracy loss. The effectiveness of our proposed method was demonstrated on real-world face recognition and tracking datasets.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.2
• /
• pp.177-183
• /
• 2001

This paper proposes an efficient method for recognizing the fingerprint using the extracted features by adaptive principal component analysis(PCA). The adaptive PCA is implemented by a single-layer neural network for extracting the linear features of fingerprint data. And, the extracted data are transformed into binary data for reducing storage space and transmission time. The proposed method has been applied to recognize the 100 fingerprint data. The simulation results show that the recognitions are all successful and capable of about ${\pm}8^{\circ}$ rotated data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.434-437
• /
• 2011

차세대 지능적 무기체계의 자동화를 목표로 SAR(Synthetic Aperture Radar) 영상 신호를 이용한 표적 인식률 향상을 위한 여러가지 방법들이 제안되어 왔다. 기존의 연구들은 SAR 영상의 고차원 특징을 그대로 사용했기 때문에 표적 인식의 성능저하가 있었다. 본 연구에서는 정보 획득 거리가 길고, 날씨에 제약이 없이 전천후 작전 운용이 가능하도록 레이더의 특징과 고해상도 영상을 결합한 SAR 이미지를 이용한 표적 인식률 향상 방법을 제안한다. 효과적인 표적 인식을 하기위해 고차원의 특징벡터를 저차원의 특징벡터로 축소하는 PCA(Principal Component Analysis)를 기반으로 하는 SVM(Support Vector Machine)을 사용한 표적 인식 기법을 사용하였고, PCA 기반의 SVM 분류기를 이용한 표적 인식이 SVM 만을 사용한 표적 인식보다 향상된 성능을 보인 것을 확인하였다.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.138-141
• /
• 2005

In this paper, we propose a watermarking technique of multispectral images. In our method, the Principal Component Analysis (PCA) is preliminarily applied on the multispectral image. The most principal component image is used for embedding with a watermark, which is a pseudo-random number sequence generated with a secret key. The embedding process is performed in the wavelet domain. The resulting image is then reinserted into the principal component images, and the final multispectral image containing the watermark can be produced by the inverse PCA. Experimental results are provided to illustrate the performance of the algorithm against various kinds of attacks.