scholarly journals Hyperspectral Dimensionality Reduction Based on Multiscale Superpixelwise Kernel Principal Component Analysis

2019 ◽  
Vol 11 (10) ◽  
pp. 1219 ◽  
Author(s):  
Lan Zhang ◽  
Hongjun Su ◽  
Jingwei Shen
Keyword(s):  
Principal Component Analysis ◽  
Dimensionality Reduction ◽  
Principal Components ◽  
Classification Accuracy ◽  
Hyperspectral Image ◽  
Principal Component ◽  
Component Analysis ◽  
Homogeneous Region ◽  
Kernel Principal Component Analysis ◽  
Nonlinear Features

Dimensionality reduction (DR) is an important preprocessing step in hyperspectral image applications. In this paper, a superpixelwise kernel principal component analysis (SuperKPCA) method for DR that performs kernel principal component analysis (KPCA) on each homogeneous region is proposed to fully utilize the KPCA’s ability to acquire nonlinear features. Moreover, for the proposed method, the differences in the DR results obtained based on different fundamental images (the first principal components obtained by principal component analysis (PCA), KPCA, and minimum noise fraction (MNF)) are compared. Extensive experiments show that when 5, 10, 20, and 30 samples from each class are selected, for the Indian Pines, Pavia University, and Salinas datasets: (1) when the most suitable fundamental image is selected, the classification accuracy obtained by SuperKPCA can be increased by 0.06%–0.74%, 3.88%–4.37%, and 0.39%–4.85%, respectively, when compared with SuperPCA, which performs PCA on each homogeneous region; (2) the DR results obtained based on different first principal components are different and complementary. By fusing the multiscale classification results obtained based on different first principal components, the classification accuracy can be increased by 0.54%–2.68%, 0.12%–1.10%, and 0.01%–0.08%, respectively, when compared with the method based only on the most suitable fundamental image.

scholarly journals Kernel principal component analysis for multimedia retrieval

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Guang-Ho Cha
Keyword(s):  
Principal Component Analysis ◽  
Dimensionality Reduction ◽  
Principal Components ◽  
Principal Component ◽  
Feature Space ◽  
Component Analysis ◽  
Multimedia Retrieval ◽  
Kernel Principal Component Analysis ◽  
Kernel Pca ◽  
Data Set

Principal component analysis (PCA) is an important tool in many areas including data reduction and interpretation, information retrieval, image processing, and so on. Kernel PCA has recently been proposed as a nonlinear extension of the popular PCA. The basic idea is to first map the input space into a feature space via a nonlinear map and then compute the principal components in that feature space. This paper illustrates the potential of kernel PCA for dimensionality reduction and feature extraction in multimedia retrieval. By the use of Gaussian kernels, the principal components were computed in the feature space of an image data set and they are used as new dimensions to approximate image features. Extensive experimental results show that kernel PCA performs better than linear PCA with respect to the retrieval quality as well as the retrieval precision in content-based image retrievals.Keywords: Principal component analysis, kernel principal component analysis, multimedia retrieval, dimensionality reduction, image retrieval

scholarly journals SLIC Superpixel-Based l2,1-Norm Robust Principal Component Analysis for Hyperspectral Image Classification

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 479 ◽  
Author(s):  
Baokai Zu ◽  
Kewen Xia ◽  
Tiejun Li ◽  
Ziping He ◽  
Yafang Li ◽  
...  
Keyword(s):  
Principal Component Analysis ◽  
Dimensionality Reduction ◽  
Hyperspectral Image ◽  
Principal Component ◽  
Component Analysis ◽  
Curse Of Dimensionality ◽  
Hyperspectral Images ◽  
Robust Principal Component Analysis ◽  
Superpixel Segmentation ◽  
Homogeneous Regions

Hyperspectral Images (HSIs) contain enriched information due to the presence of various bands, which have gained attention for the past few decades. However, explosive growth in HSIs’ scale and dimensions causes “Curse of dimensionality” and “Hughes phenomenon”. Dimensionality reduction has become an important means to overcome the “Curse of dimensionality”. In hyperspectral images, labeled samples are more difficult to collect because they require many labor and material resources. Semi-supervised dimensionality reduction is very important in mining high-dimensional data due to the lack of costly-labeled samples. The promotion of the supervised dimensionality reduction method to the semi-supervised method is mostly done by graph, which is a powerful tool for characterizing data relationships and manifold exploration. To take advantage of the spatial information of data, we put forward a novel graph construction method for semi-supervised learning, called SLIC Superpixel-based l 2 , 1 -norm Robust Principal Component Analysis (SURPCA2,1), which integrates superpixel segmentation method Simple Linear Iterative Clustering (SLIC) into Low-rank Decomposition. First, the SLIC algorithm is adopted to obtain the spatial homogeneous regions of HSI. Then, the l 2 , 1 -norm RPCA is exploited in each superpixel area, which captures the global information of homogeneous regions and preserves spectral subspace segmentation of HSIs very well. Therefore, we have explored the spatial and spectral information of hyperspectral image simultaneously by combining superpixel segmentation with RPCA. Finally, a semi-supervised dimensionality reduction framework based on SURPCA2,1 graph is used for feature extraction task. Extensive experiments on multiple HSIs showed that the proposed spectral-spatial SURPCA2,1 is always comparable to other compared graphs with few labeled samples.

Comparing the performance of linear and nonlinear principal components in the context of high-dimensional genomic data integration

2017 ◽  
Vol 16 (3) ◽  
Author(s):  
Shofiqul Islam ◽  
Sonia Anand ◽  
Jemila Hamid ◽  
Lehana Thabane ◽  
Joseph Beyene
Keyword(s):  
Principal Component Analysis ◽  
Data Integration ◽  
Principal Components ◽  
Mirna Expression ◽  
Principal Component ◽  
Component Analysis ◽  
Kernel Principal Component Analysis ◽  
Data Sets ◽  
Data Set ◽  
Multiple Data Sets

AbstractLinear principal component analysis (PCA) is a widely used approach to reduce the dimension of gene or miRNA expression data sets. This method relies on the linearity assumption, which often fails to capture the patterns and relationships inherent in the data. Thus, a nonlinear approach such as kernel PCA might be optimal. We develop a copula-based simulation algorithm that takes into account the degree of dependence and nonlinearity observed in these data sets. Using this algorithm, we conduct an extensive simulation to compare the performance of linear and kernel principal component analysis methods towards data integration and death classification. We also compare these methods using a real data set with gene and miRNA expression of lung cancer patients. First few kernel principal components show poor performance compared to the linear principal components in this occasion. Reducing dimensions using linear PCA and a logistic regression model for classification seems to be adequate for this purpose. Integrating information from multiple data sets using either of these two approaches leads to an improved classification accuracy for the outcome.

scholarly journals Geometrical Approximated Principal Component Analysis for Hyperspectral Image Analysis

2020 ◽  
Vol 12 (11) ◽  
pp. 1698 ◽  
Author(s):  
Alina L. Machidon ◽  
Fabio Del Frate ◽  
Matteo Picchiani ◽  
Octavian M. Machidon ◽  
Petre L. Ogrutan
Keyword(s):  
Principal Component Analysis ◽  
Dimensionality Reduction ◽  
Hyperspectral Image ◽  
Principal Component ◽  
Component Analysis ◽  
Hyperspectral Images ◽  
Land Classification ◽  
Hyperspectral Image Processing ◽  
Hyperspectral Image Analysis ◽  
Effective Dimensionality

Principal Component Analysis (PCA) is a method based on statistics and linear algebra techniques, used in hyperspectral satellite imagery for data dimensionality reduction required in order to speed up and increase the performance of subsequent hyperspectral image processing algorithms. This paper introduces the PCA approximation method based on a geometric construction approach (gaPCA) method, an alternative algorithm for computing the principal components based on a geometrical constructed approximation of the standard PCA and presents its application to remote sensing hyperspectral images. gaPCA has the potential of yielding better land classification results by preserving a higher degree of information related to the smaller objects of the scene (or to the rare spectral objects) than the standard PCA, being focused not on maximizing the variance of the data, but the range. The paper validates gaPCA on four distinct datasets and performs comparative evaluations and metrics with the standard PCA method. A comparative land classification benchmark of gaPCA and the standard PCA using statistical-based tools is also described. The results show gaPCA is an effective dimensionality-reduction tool, with performance similar to, and in several cases, even higher than standard PCA on specific image classification tasks. gaPCA was shown to be more suitable for hyperspectral images with small structures or objects that need to be detected or where preponderantly spectral classes or spectrally similar classes are present.

scholarly journals Two-Phase Incremental Kernel PCA for Learning Massive or Online Datasets

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Feng Zhao ◽  
Islem Rekik ◽  
Seong-Whan Lee ◽  
Jing Liu ◽  
Junying Zhang ◽  
...  
Keyword(s):  
Principal Component Analysis ◽  
Principal Components ◽  
Principal Component ◽  
Component Analysis ◽  
Incremental Algorithm ◽  
Kernel Principal Component Analysis ◽  
Second Phase ◽  
Two Phase ◽  
Batch Mode ◽  
Machine Learning Applications

As a powerful nonlinear feature extractor, kernel principal component analysis (KPCA) has been widely adopted in many machine learning applications. However, KPCA is usually performed in a batch mode, leading to some potential problems when handling massive or online datasets. To overcome this drawback of KPCA, in this paper, we propose a two-phase incremental KPCA (TP-IKPCA) algorithm which can incorporate data into KPCA in an incremental fashion. In the first phase, an incremental algorithm is developed to explicitly express the data in the kernel space. In the second phase, we extend an incremental principal component analysis (IPCA) to estimate the kernel principal components. Extensive experimental results on both synthesized and real datasets showed that the proposed TP-IKPCA produces similar principal components as conventional batch-based KPCA but is computationally faster than KPCA and its several incremental variants. Therefore, our algorithm can be applied to massive or online datasets where the batch method is not available.

Sign in / Sign up

Export Citation Format

Share Document