scholarly journals Unsupervised Classification of Hyperspectral Images using PCA and K-Means

2021 ◽  
Author(s):  
Ayesha Malik ◽  
Mamoona Waheed
Keyword(s):  
Principal Component Analysis ◽  
Dimensionality Reduction ◽  
Principal Component ◽  
Unsupervised Classification ◽  
Information Loss ◽  
Hyperspectral Images ◽  
High Dimensionality ◽  
Reduction Algorithm ◽  
Display Devices

The visualization of hyperspectral images in display devices, having RGB colour composition channels is quite difficult due to the high dimensionality of these images. Thus, principal component analysis has been used as a dimensionality reduction algorithm to reduce information loss, by creating uncorrelated features. To classify regions in the hyperspectral images, K-means clustering has been used to form clusters/regions. These two algorithms have been implemented on the three datasets imaged by AVIRIS and ROSIS sensors.

scholarly journals MURAL LINEAR FEATURE ENHANCEMENT ALGORITHM COMBINING SEMI-SUPERVISED IMAGE SEGMENTATION AND DIMENSIONALITY REDUCTION

2021 ◽  
Vol XLVI-M-1-2021 ◽  
pp. 423-427
Author(s):  
S. Lyu ◽  
J. Mao ◽  
M. Hou
Keyword(s):  
Principal Component Analysis ◽  
Image Segmentation ◽  
Dimensionality Reduction ◽  
Spatial Information ◽  
Principal Component ◽  
Hyperspectral Images ◽  
Spectral Information ◽  
Label Data ◽  
Feature Enhancement ◽  
Linear Feature

Abstract. Due to the influence of natural and human factors, the linear features in the murals are partially blurred, which brings great challenges to the digital preservation and virtual restoration of cultural heritage. Taking the advantages of non-invasive measurement as well as the rich image and spectral information of hyperspectral technology, we proposed a linear feature enhancement method by combining semi-supervised superpixel segmentation with block dimension reduction. The main research work includes: (1) The true color composite image was segmented to obtain the label data by using the local spatial information of the superpixel image and the global feature information extracted by fuzzy c-means (FCM) clustering.(2) According to the label data, the preprocessed hyperspectral data were divided into homogeneous regions, whose dimensionality was reduced by principal component analysis (PCA) and kernel principal component analysis (KPCA). (3) The principal component images with the largest gradient after dimensionality reduction were respectively selected and normalized. The optimal principal component images normalized by the block PCA and block KPCA dimensionality reduction algorithms are superimposed to produce the linear feature enhancement images of murals. The hyperspectral images of some murals in Qutan Temple, Qinghai Province, China were used to verify the method. The results show that the spatial information and the spectral information of different pattern areas in the hyperspectral image can be fully used by combining the superpixel FCM image segmentation algorithm with the dimensionality reduction algorithm. of. It can highlight the linear information in the hyperspectral images of fades murals.

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.

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.

Classification of Observations through Combination of the Dimension Reduction and the Cluster Analysis

2017 ◽  
Vol 7 (8) ◽  
pp. 30
Author(s):  
Hyeuk Kim
Keyword(s):  
Machine Learning ◽  
Principal Component Analysis ◽  
Cluster Analysis ◽  
Unsupervised Learning ◽  
Principal Component ◽  
Component Analysis ◽  
Baseball Players ◽  
Partitioning Around Medoids ◽  
Different Characteristics

Unsupervised learning in machine learning divides data into several groups. The observations in the same group have similar characteristics and the observations in the different groups have the different characteristics. In the paper, we classify data by partitioning around medoids which have some advantages over the k-means clustering. We apply it to baseball players in Korea Baseball League. We also apply the principal component analysis to data and draw the graph using two components for axis. We interpret the meaning of the clustering graphically through the procedure. The combination of the partitioning around medoids and the principal component analysis can be used to any other data and the approach makes us to figure out the characteristics easily.

Sign in / Sign up

Export Citation Format

Share Document