• Structural Monitoring and Maintenance
• /
• v.9 no.2
• /
• pp.179-200
• /
• 2022

This paper proposes a data-driven methodology for online early damage identification under changing environmental conditions. The proposed method relies on two data analysis methods: feature-based method and hybrid principal component analysis (PCA) and kernel PCA to separate damage from environmental influences. First, spectral sub-band features, namely, spectral sub-band centroids (SSCs) and log spectral sub-band energies (LSSEs), are proposed as damage-sensitive features to extract damage information from measured structural responses. Second, hybrid modeling by integrating PCA and kernel PCA is performed on the spectral sub-band feature matrix for data normalization to extract both linear and nonlinear features for nonlinear procedure monitoring. After feature normalization, suppressing environmental effects, the control charts (Hotelling T² and SPE statistics) is implemented to novelty detection and distinguish damage in structures. The hybrid PCA-KPCA technique is compared to KPCA by applying support vector machine (SVM) to evaluate the effectiveness of its performance in detecting damage. The proposed method is verified through numerical and full-scale studies (a Bridge Health Monitoring (BHM) Benchmark Problem and a cable-stayed bridge in China). The results demonstrate that the proposed method can detect the structural damage accurately and reduce false alarms by suppressing the effects and interference of environmental variations.

• Communications for Statistical Applications and Methods
• /
• v.20 no.3
• /
• pp.175-184
• /
• 2013

Kernel principal component analysis(PCA) maps observations in nonlinear feature space to a reduced dimensional plane of principal components. We do not need to specify the feature space explicitly because the procedure uses the kernel trick. In this paper, we propose a graphical scheme to represent variables in the kernel principal component analysis. In addition, we propose an index for individual variables to measure the importance in the principal component plane.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.127-130
• /
• 2005

There are many methods in feature extraction have been developed. Recently, principal components analysis (PCA) and independent components analysis (ICA) is introduced for doing feature extraction. PCA and ICA linearly transform the original input into new uncorrelated and independent features space respectively In this paper, the feasibility of using nonlinear feature extraction will be studied. This method will employ the PCA and ICA procedure and adopt the kernel trick to nonlinearly map the data into a feature space. The goal of this study is to seek effectively useful feature for faults classification.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.247-250
• /
• 2005

In numerous occasions, there is need to reconstruct partially occluded facial image. Typical examples include the recognition of criminals whose facial images are captured by surveillance cameras- ln such cases a significant part of the face is occluded making the process of identification extremely difficult, both for automatic face recognition systems and human observers. To overcome these difficulties, we consider the application of Kernel PCA-based denoising method to partially occluded facial image in this paper.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.359-359
• /
• 2020

현재 우리나라의 가뭄감시 정보는 기상학적/농업적/수문학적 가뭄이 별도의 지수로 개발되어 다양한 형태의 정보를 생산·제공되고 있다. 각각의 가뭄 지수들 기준 및 특성에 따라 분석되고 있기 때문에 가뭄전문가의 입장에서는 매우 정밀한 가뭄정보를 제공받는 장점이 있는 반면에, 일반 국민들이 가뭄 정보를 받아들이고 이해하는데 어려움이 있어 이를 한눈에 알아볼 수 있는 통합가뭄지도가 필요하며, 통합가뭄도를 제작하기 위해서는 통합가뭄지수가 개발되어야 한다. 본 연구에서는 원격탐사자료를 활용하여 농업적 가뭄지수인 Agricultural Dry Condition Index (ADCI)와 수문학적 가뭄지수인 Water Budget-based Drought Index (WBDI)를 개발하였으며, 기상학적 가뭄지수인 Standardized Precipitation Index (SPI)를 포함하여 기상-농업-수문학적 가뭄지수를 결합한 통합가뭄지수를 산정하였다. 다양한 가뭄지수를 활용하여 개발되었기 때문에 다변량 통계 모형 중 선형 모형인 Principal Component Analysis (PCA)기법과 비선형 모형인 Kernel Entropy PCA, Kernel PCA를 적용하였다. 또한 과거 가뭄사상을 활용하여 산정된 통합가뭄지수 검증을 위해 과거 가뭄사상에 대한 가뭄 발생시기, 심도, 쇠퇴패턴이 양상 평가 및 Intentionally Biased Bootstrap Resampling (IBBR)을 활용한 지수별 민감도 분석을 통해 통합가뭄지수 적용성 평가를 진행하였다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.361-368
• /
• 2004

The purpose of this study is to propose a new on-line nonlinear PCA(OL-NPCA) method for a nonlinear feature extraction from the incremental data. Kernel PCA(KPCA) is widely used for nonlinear feature extraction, however, it has been pointed out that KPCA has the following problems. First, applying KPCA to N patterns requires storing and finding the eigenvectors of a N${\times}$N kernel matrix, which is infeasible for a large number of data N. Second problem is that in order to update the eigenvectors with an another data, the whole eigenspace should be recomputed. OL-NPCA overcomes these problems by incremental eigenspace update method with a feature mapping function. According to the experimental results, which comes from applying OL-NPCA to a toy and a large data problem, OL-NPCA shows following advantages. First, OL-NPCA is more efficient in memory requirement than KPCA. Second advantage is that OL-NPCA is comparable in performance to KPCA. Furthermore, performance of OL-NPCA can be easily improved by re-learning the data.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.243-248
• /
• 2003

An incremental kernel principal component analysis (IKPCA) is proposed for the nonlinear feature extraction from the data. The problem of batch kernel principal component analysis (KPCA) is that the computation becomes prohibitive when the data set is large. Another problem is that, in order to update the eigenvectors with another data, the whole eigenspace should be recomputed. IKPCA overcomes these problems by incrementally computing eigenspace model and empirical kernel map The IKPCA is more efficient in memory requirement than a batch KPCA and can be easily improved by re-learning the data. In our experiments we show that IKPCA is comparable in performance to a batch KPCA for the feature extraction and classification problem on nonlinear data set.

• Structural Engineering and Mechanics
• /
• v.44 no.2
• /
• pp.179-196
• /
• 2012

An eigenspace projection clustering method is proposed for structural damage detection by combining projection algorithm and fuzzy clustering technique. The integrated procedure includes data selection, data normalization, projection, damage feature extraction, and clustering algorithm to structural damage assessment. The frequency response functions (FRFs) of the healthy and the damaged structure are used as initial data, median values of the projections are considered as damage features, and the fuzzy c-means (FCM) algorithm are used to categorize these features. The performance of the proposed method has been validated using a three-story frame structure built and tested by Los Alamos National Laboratory, USA. Two projection algorithms, namely principal component analysis (PCA) and kernel principal component analysis (KPCA), are compared for better extraction of damage features, further six kinds of distances adopted in FCM process are studied and discussed. The illustrated results reveal that the distance selection depends on the distribution of features. For the optimal choice of projections, it is recommended that the Cosine distance is used for the PCA while the Seuclidean distance and the Cityblock distance suitably used for the KPCA. The PCA method is recommended when a large amount of data need to be processed due to its higher correct decisions and less computational costs.

• Communications for Statistical Applications and Methods
• /
• v.31 no.2
• /
• pp.213-234
• /
• 2024

In recent decades, increasing research attention has been directed toward predicting the price of stocks in financial markets using deep learning methods. For instance, recurrent neural network (RNN) is known to be competitive for datasets with time-series data. Long short term memory (LSTM) further improves RNN by providing an alternative approach to the gradient loss problem. LSTM has its own advantage in predictive accuracy by retaining memory for a longer time. In this paper, we combine both supervised and unsupervised dimension reduction methods with LSTM to enhance the forecasting performance and refer to this as a dimension reduction based LSTM (DR-LSTM) approach. For a supervised dimension reduction method, we use methods such as sliced inverse regression (SIR), sparse SIR, and kernel SIR. Furthermore, principal component analysis (PCA), sparse PCA, and kernel PCA are used as unsupervised dimension reduction methods. Using datasets of real stock market index (S&P 500, STOXX Europe 600, and KOSPI), we present a comparative study on predictive accuracy between six DR-LSTM methods and time series modeling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2709-2729
• /
• 2016

Representation based classification, kernel method and sparse representation have received much attention in the field of face recognition. In this paper, we proposed an improved kernel principal component analysis method based on sparse representation to improve the accuracy and robustness for face recognition. First, the distances between the test sample and all training samples in kernel space are estimated based on collaborative representation. Second, S training samples with the smallest distances are selected, and Kernel Principal Component Analysis (KPCA) is used to extract the features that are exploited for classification. The proposed method implements the sparse representation under ℓ₂ regularization and performs feature extraction twice to improve the robustness. Also, we investigate the relationship between the accuracy and the sparseness coefficient, the relationship between the accuracy and the dimensionality respectively. The comparative experiments are conducted on the ORL, the GT and the UMIST face database. The experimental results show that the proposed method is more effective and robust than several state-of-the-art methods including Sparse Representation based Classification (SRC), Collaborative Representation based Classification (CRC), KCRC and Two Phase Test samples Sparse Representation (TPTSR).