A novel online process monitoring and fault diagnosis method of condenser based on kernel principle component analysis （KPCA） and Fisher discriminant analysis （FDA） is presented. The basic idea of this method is：...A novel online process monitoring and fault diagnosis method of condenser based on kernel principle component analysis （KPCA） and Fisher discriminant analysis （FDA） is presented. The basic idea of this method is： First map data from the original space into high-dimensional feature space via nonlinear kernel function and then extract optimal feature vector and discriminant vector in feature space and calculate the Euclidean distance between feature vectors to perform process monitoring. Similar degree between the present discriminant vector and optimal discriminant vector of fault in historical dataset is used for diagnosis. The proposed method can effectively capture the nonlinear relationship among process variables. Simulating results of the turbo generator＇s fault data set prove that the proposed method is effective.展开更多
Multifrequency polarimetric SAR imagery provides a very convenient approach for signal processing and acquisition of radar image. However, the amount of information is scattered in several images, and redundancies exi...Multifrequency polarimetric SAR imagery provides a very convenient approach for signal processing and acquisition of radar image. However, the amount of information is scattered in several images, and redundancies exist between different bands and polarizations. Similar to signal-polarimetric SAR image, multifrequency polarimetric SAR image is corrupted with speckle noise at the same time. A method of information compression and speckle reduction for multifrequency polarimetric SAR imagery is presented based on kernel principal component analysis （KPCA）. KPCA is a nonlinear generalization of the linear principal component analysis using the kernel trick. The NASA/JPL polarimetric SAR imagery of P, L, and C bands quadpolarizations is used for illustration. The experimental results show that KPCA has better capability in information compression and speckle reduction as compared with linear PCA.展开更多
Principal Component Analysis(PCA)is one of the most important feature extraction methods,and Kernel Principal Component Analysis(KPCA)is a nonlinear extension of PCA based on kernel methods.In real world,each input da...Principal Component Analysis(PCA)is one of the most important feature extraction methods,and Kernel Principal Component Analysis(KPCA)is a nonlinear extension of PCA based on kernel methods.In real world,each input data may not be fully assigned to one class and it may partially belong to other classes.Based on the theory of fuzzy sets,this paper presents Fuzzy Principal Component Analysis(FPCA)and its nonlinear extension model,i.e.,Kernel-based Fuzzy Principal Component Analysis(KFPCA).The experimental results indicate that the proposed algorithms have good performances.展开更多
This paper presents a novel approach for human identification at a distance using gait recognition. Recognition of a person from their gait is a biometric of increasing interest. The proposed work introduces a nonline...This paper presents a novel approach for human identification at a distance using gait recognition. Recognition of a person from their gait is a biometric of increasing interest. The proposed work introduces a nonlinear machine learning method, kernel Principal Component Analysis （PCA）, to extract gait features from silhouettes for individual recognition. Binarized silhouette of a motion object is first represented by four 1-D signals which are the basic image features called the distance vectors. Fourier transform is performed to achieve translation invariant for the gait patterns accumulated from silhouette sequences which are extracted from different circumstances. Kernel PCA is then used to extract higher order relations among the gait patterns for future recognition. A fusion strategy is finally executed to produce a final decision. The experiments are carried out on the CMU and the USF gait databases and presented based on the different training gait cycles.展开更多
This paper presents a wavelet-based kernel Principal Component Analysis （PCA） method by integrating the Daubechies wavelet representation of palm images and the kernel PCA method for palmprint recognition. Kernel PC...This paper presents a wavelet-based kernel Principal Component Analysis （PCA） method by integrating the Daubechies wavelet representation of palm images and the kernel PCA method for palmprint recognition. Kernel PCA is a technique for nonlinear dimension reduction of data with an underlying nonlinear spatial structure. The intensity values of the palmprint image are first normalized by using mean and standard deviation. The palmprint is then transformed into the wavelet domain to decompose palm images and the lowest resolution subband coefficients are chosen for palm representation. The kernel PCA method is then applied to extract non-linear features from the subband coefficients. Finally, similarity measurement is accomplished by using weighted Euclidean linear distance-based nearest neighbor classifier. Experimental results on PolyU Palmprint Databases demonstrate that the proposed approach achieves highly competitive performance with respect to the published palmprint recognition approaches.展开更多
In this work, we apply a principal component analysis （PCA） method with a kernel trick to study the classification of phases and phase transitions in classical XY models of frustrated lattices. Compared to our previ...In this work, we apply a principal component analysis （PCA） method with a kernel trick to study the classification of phases and phase transitions in classical XY models of frustrated lattices. Compared to our previous work with the linear PCA method, the kernel PCA can capture nonlinear functions. In this case, the Z2 chiral order of the classical spins in these lattices is indeed a nonlinear function of the input spin configurations. In addition to the principal component revealed by the linear PCA, the kernel PCA can find two more principal components using the data generated by Monte Carlo simulation for various temperatures as the input. One of them is related to the strength of the U（1） order parameter, and the other directly manifests the chiral order parameter that characterizes the Z2 symmetry breaking. For a temperature-resolved study, the temperature dependence of the principal eigenvalue associated with the Z2 symmetry breaking clearly shows second-order phase transition behavior.展开更多
Sensor networks are deployed in many application areas nowadays ranging from environment monitoring, industrial monitoring, and agriculture monitoring to military battlefield sensing. The accuracy of sensor readings i...Sensor networks are deployed in many application areas nowadays ranging from environment monitoring, industrial monitoring, and agriculture monitoring to military battlefield sensing. The accuracy of sensor readings is without a doubt one of the most important measures to evaluate the quality of a sensor and its network. Therefore, this work is motivated to propose approaches that can detect and repair erroneous （i.e., dirty） data caused by inevitable system problems involving various hardware and software components of sensor networks. As information about a single event of interest in a sensor network is usually reflected in multiple measurement points, the inconsistency among multiple sensor measurements serves as an indicator for data quality problem. The focus of this paper is thus to study methods that can effectively detect and identify erroneous data among inconsistent observations based on the inherent structure of various sensor measurement series from a group of sensors. Particularly, we present three models to characterize the inherent data structures among sensor measurement traces and then apply these models individually to guide the error detection of a sensor network. First, we propose a multivariate Gaussian model which explores the correlated data changes of a group of sensors. Second, we present a Principal Component Analysis （PCA） model which captures the sparse geometric relationship among sensors in a network. The PCA model is motivated by the fact that not all sensor networks have clustered sensor deployment and clear data correlation structure. Further, if the sensor data show non-linear characteristic, a traditional PCA model can not capture the data attributes properly. Therefore, we propose a third model which utilizes kernel functions to map the original data into a high dimensional feature space and then apply PCA model on the mapped linearized data. All these three models serve the purpose of capturing the underlying phenomenon of a sensor network from its global view, and then guide the error detection to discover any anomaly observations. We conducted simulations for each of the proposed models, and evaluated the performance by deriving the Receiver Operating Characteristic （ROC） curves.展开更多
An important issue involved in kernel methods is the pre-image problem. However, it is an ill-posed problem, as the solution is usually nonexistent or not unique. In contrast to direct methods aimed at minimizing the ...An important issue involved in kernel methods is the pre-image problem. However, it is an ill-posed problem, as the solution is usually nonexistent or not unique. In contrast to direct methods aimed at minimizing the distance in feature space, indirect methods aimed at constructing approximate equivalent models have shown outstanding performance. In this paper, an indirect method for solving the pre-image problem is proposed. In the proposed algorithm, an inverse mapping process is constructed based on a novel framework that preserves local linearity. In this framework, a local nonlinear transformation is implicitly conducted by neighborhood subspace scaling transformation to preserve the local linearity between feature space and input space. By extending the inverse mapping process to test samples, we can obtain pre-images in input space. The proposed method is non-iterative,and can be used for any kernel functions. Experimental results based on image denoising using kernel principal component analysis(PCA) show that the proposed method outperforms the state-of-the-art methods for solving the pre-image problem.展开更多
基金The National Natural Science Foundation of China(No60504033)
文摘A novel online process monitoring and fault diagnosis method of condenser based on kernel principle component analysis （KPCA） and Fisher discriminant analysis （FDA） is presented. The basic idea of this method is： First map data from the original space into high-dimensional feature space via nonlinear kernel function and then extract optimal feature vector and discriminant vector in feature space and calculate the Euclidean distance between feature vectors to perform process monitoring. Similar degree between the present discriminant vector and optimal discriminant vector of fault in historical dataset is used for diagnosis. The proposed method can effectively capture the nonlinear relationship among process variables. Simulating results of the turbo generator＇s fault data set prove that the proposed method is effective.
基金the Specialized Research Found for the Doctoral Program of Higher Education (20070699013)the Natural Science Foundation of Shaanxi Province (2006F05)the Aeronautical Science Foundation (05I53076).
文摘Multifrequency polarimetric SAR imagery provides a very convenient approach for signal processing and acquisition of radar image. However, the amount of information is scattered in several images, and redundancies exist between different bands and polarizations. Similar to signal-polarimetric SAR image, multifrequency polarimetric SAR image is corrupted with speckle noise at the same time. A method of information compression and speckle reduction for multifrequency polarimetric SAR imagery is presented based on kernel principal component analysis （KPCA）. KPCA is a nonlinear generalization of the linear principal component analysis using the kernel trick. The NASA/JPL polarimetric SAR imagery of P, L, and C bands quadpolarizations is used for illustration. The experimental results show that KPCA has better capability in information compression and speckle reduction as compared with linear PCA.
文摘Principal Component Analysis(PCA)is one of the most important feature extraction methods,and Kernel Principal Component Analysis(KPCA)is a nonlinear extension of PCA based on kernel methods.In real world,each input data may not be fully assigned to one class and it may partially belong to other classes.Based on the theory of fuzzy sets,this paper presents Fuzzy Principal Component Analysis(FPCA)and its nonlinear extension model,i.e.,Kernel-based Fuzzy Principal Component Analysis(KFPCA).The experimental results indicate that the proposed algorithms have good performances.
基金This work was supported by Karadeniz Technical University tinder Grant No.KTU-2004.112.009.001.
文摘This paper presents a novel approach for human identification at a distance using gait recognition. Recognition of a person from their gait is a biometric of increasing interest. The proposed work introduces a nonlinear machine learning method, kernel Principal Component Analysis （PCA）, to extract gait features from silhouettes for individual recognition. Binarized silhouette of a motion object is first represented by four 1-D signals which are the basic image features called the distance vectors. Fourier transform is performed to achieve translation invariant for the gait patterns accumulated from silhouette sequences which are extracted from different circumstances. Kernel PCA is then used to extract higher order relations among the gait patterns for future recognition. A fusion strategy is finally executed to produce a final decision. The experiments are carried out on the CMU and the USF gait databases and presented based on the different training gait cycles.
基金supported fully by the TUBITAK Research Project under Grant No. 107E212.
文摘This paper presents a wavelet-based kernel Principal Component Analysis （PCA） method by integrating the Daubechies wavelet representation of palm images and the kernel PCA method for palmprint recognition. Kernel PCA is a technique for nonlinear dimension reduction of data with an underlying nonlinear spatial structure. The intensity values of the palmprint image are first normalized by using mean and standard deviation. The palmprint is then transformed into the wavelet domain to decompose palm images and the lowest resolution subband coefficients are chosen for palm representation. The kernel PCA method is then applied to extract non-linear features from the subband coefficients. Finally, similarity measurement is accomplished by using weighted Euclidean linear distance-based nearest neighbor classifier. Experimental results on PolyU Palmprint Databases demonstrate that the proposed approach achieves highly competitive performance with respect to the published palmprint recognition approaches.
文摘In this work, we apply a principal component analysis （PCA） method with a kernel trick to study the classification of phases and phase transitions in classical XY models of frustrated lattices. Compared to our previous work with the linear PCA method, the kernel PCA can capture nonlinear functions. In this case, the Z2 chiral order of the classical spins in these lattices is indeed a nonlinear function of the input spin configurations. In addition to the principal component revealed by the linear PCA, the kernel PCA can find two more principal components using the data generated by Monte Carlo simulation for various temperatures as the input. One of them is related to the strength of the U（1） order parameter, and the other directly manifests the chiral order parameter that characterizes the Z2 symmetry breaking. For a temperature-resolved study, the temperature dependence of the principal eigenvalue associated with the Z2 symmetry breaking clearly shows second-order phase transition behavior.
基金sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001
文摘Sensor networks are deployed in many application areas nowadays ranging from environment monitoring, industrial monitoring, and agriculture monitoring to military battlefield sensing. The accuracy of sensor readings is without a doubt one of the most important measures to evaluate the quality of a sensor and its network. Therefore, this work is motivated to propose approaches that can detect and repair erroneous （i.e., dirty） data caused by inevitable system problems involving various hardware and software components of sensor networks. As information about a single event of interest in a sensor network is usually reflected in multiple measurement points, the inconsistency among multiple sensor measurements serves as an indicator for data quality problem. The focus of this paper is thus to study methods that can effectively detect and identify erroneous data among inconsistent observations based on the inherent structure of various sensor measurement series from a group of sensors. Particularly, we present three models to characterize the inherent data structures among sensor measurement traces and then apply these models individually to guide the error detection of a sensor network. First, we propose a multivariate Gaussian model which explores the correlated data changes of a group of sensors. Second, we present a Principal Component Analysis （PCA） model which captures the sparse geometric relationship among sensors in a network. The PCA model is motivated by the fact that not all sensor networks have clustered sensor deployment and clear data correlation structure. Further, if the sensor data show non-linear characteristic, a traditional PCA model can not capture the data attributes properly. Therefore, we propose a third model which utilizes kernel functions to map the original data into a high dimensional feature space and then apply PCA model on the mapped linearized data. All these three models serve the purpose of capturing the underlying phenomenon of a sensor network from its global view, and then guide the error detection to discover any anomaly observations. We conducted simulations for each of the proposed models, and evaluated the performance by deriving the Receiver Operating Characteristic （ROC） curves.
基金Project supported by the National Science and Technology Major Project of China(No.2012EX01027001-002)the Fun-damental Research Funds for the Central Universities,China
文摘An important issue involved in kernel methods is the pre-image problem. However, it is an ill-posed problem, as the solution is usually nonexistent or not unique. In contrast to direct methods aimed at minimizing the distance in feature space, indirect methods aimed at constructing approximate equivalent models have shown outstanding performance. In this paper, an indirect method for solving the pre-image problem is proposed. In the proposed algorithm, an inverse mapping process is constructed based on a novel framework that preserves local linearity. In this framework, a local nonlinear transformation is implicitly conducted by neighborhood subspace scaling transformation to preserve the local linearity between feature space and input space. By extending the inverse mapping process to test samples, we can obtain pre-images in input space. The proposed method is non-iterative,and can be used for any kernel functions. Experimental results based on image denoising using kernel principal component analysis(PCA) show that the proposed method outperforms the state-of-the-art methods for solving the pre-image problem.
