scholarly journals Spectral-Locational-Spatial Manifold Learning for Hyperspectral Images Dimensionality Reduction

2021 ◽  
Vol 13 (14) ◽  
pp. 2752
Author(s):  
Na Li ◽  
Deyun Zhou ◽  
Jiao Shi ◽  
Tao Wu ◽  
Maoguo Gong
Keyword(s):  
Dimensionality Reduction ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
State Of The Art ◽  
Nearest Neighbors ◽  
Cluster Centroid ◽  
Intrinsic Structure ◽  
Adjacency Graph ◽  
Structure Preserving ◽  
Class Labels

Dimensionality reduction (DR) plays an important role in hyperspectral image (HSI) classification. Unsupervised DR (uDR) is more practical due to the difficulty of obtaining class labels and their scarcity for HSIs. However, many existing uDR algorithms lack the comprehensive exploration of spectral-locational-spatial (SLS) information, which is of great significance for uDR in view of the complex intrinsic structure in HSIs. To address this issue, two uDR methods called SLS structure preserving projection (SLSSPP) and SLS reconstruction preserving embedding (SLSRPE) are proposed. Firstly, to facilitate the extraction of SLS information, a weighted spectral-locational (wSL) datum is generated to break the locality of spatial information extraction. Then, a new SLS distance (SLSD) excavating the SLS relationships among samples is designed to select effective SLS neighbors. In SLSSPP, a new uDR model that includes a SLS adjacency graph based on SLSD and a cluster centroid adjacency graph based on wSL data is proposed, which compresses intraclass samples and approximately separates interclass samples in an unsupervised manner. Meanwhile, in SLSRPE, for preserving the SLS relationship among target pixels and their nearest neighbors, a new SLS reconstruction weight was defined to obtain the more discriminative projection. Experimental results on the Indian Pines, Pavia University and Salinas datasets demonstrate that, through KNN and SVM classifiers with different classification conditions, the classification accuracies of SLSSPP and SLSRPE are approximately 4.88%, 4.15%, 2.51%, and 2.30%, 5.31%, 2.41% higher than that of the state-of-the-art DR algorithms.

Spectral-Spatial Classification of Hyperspectral Image Based on Support Vector Machine

2021 ◽  
Vol 16 (1) ◽  
pp. 56-74
Author(s):  
Weiwei Yang ◽  
Haifeng Song
Keyword(s):  
Support Vector Machine ◽  
Classification Accuracy ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
State Of The Art ◽  
Support Vector ◽  
Svm Classifier ◽  
Spatial Classification ◽  
Homogeneous Regions

Recent research has shown that integration of spatial information has emerged as a powerful tool in improving the classification accuracy of hyperspectral image (HSI). However, partitioning homogeneous regions of the HSI remains a challenging task. This paper proposes a novel spectral-spatial classification method inspired by the support vector machine (SVM). The model consists of spectral-spatial feature extraction channel (SSC) and SVM classifier. SSC is mainly used to extract spatial-spectral features of HSI. SVM is mainly used to classify the extracted features. The model can automatically extract the features of HSI and classify them. Experiments are conducted on benchmark HSI dataset (Indian Pines). It is found that the proposed method yields more accurate classification results compared to the state-of-the-art techniques.

scholarly journals Spectral Unmixing of Hyperspectral Remote Sensing Imagery via Preserving the Intrinsic Structure Invariant

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3528 ◽  
Author(s):  
Yang Shao ◽  
Jinhui Lan ◽  
Yuzhen Zhang ◽  
Jinlin Zou
Keyword(s):  
Spatial Information ◽  
Hyperspectral Image ◽  
Image Data ◽  
Hyperspectral Data ◽  
Spectral Unmixing ◽  
Intrinsic Structure ◽  
Close Link ◽  
Manifold Structure ◽  
Data Space ◽  
Projection Equation

Hyperspectral unmixing, which decomposes mixed pixels into endmembers and corresponding abundance maps of endmembers, has obtained much attention in recent decades. Most spectral unmixing algorithms based on non-negative matrix factorization (NMF) do not explore the intrinsic manifold structure of hyperspectral data space. Studies have proven image data is smooth along the intrinsic manifold structure. Thus, this paper explores the intrinsic manifold structure of hyperspectral data space and introduces manifold learning into NMF for spectral unmixing. Firstly, a novel projection equation is employed to model the intrinsic structure of hyperspectral image preserving spectral information and spatial information of hyperspectral image. Then, a graph regularizer which establishes a close link between hyperspectral image and abundance matrix is introduced in the proposed method to keep intrinsic structure invariant in spectral unmixing. In this way, decomposed abundance matrix is able to preserve the true abundance intrinsic structure, which leads to a more desired spectral unmixing performance. At last, the experimental results including the spectral angle distance and the root mean square error on synthetic and real hyperspectral data prove the superiority of the proposed method over the previous methods.

scholarly journals An SVM-Based Nested Sliding Window Approach for Spectral–Spatial Classification of Hyperspectral Images

2020 ◽  
Vol 13 (1) ◽  
pp. 114
Author(s):  
Jiansi Ren ◽  
Ruoxiang Wang ◽  
Gang Liu ◽  
Yuanni Wang ◽  
Wei Wu
Keyword(s):  
Spatial Information ◽  
Hyperspectral Image ◽  
State Of The Art ◽  
Pearson Correlation ◽  
Correlation Coefficients ◽  
Sliding Window ◽  
Classification Model ◽  
Support Vector ◽  
Proposed Model ◽  
Two Parameters

This paper proposes a Nested Sliding Window (NSW) method based on the correlation between pixel vectors, which can extract spatial information from the hyperspectral image (HSI) and reconstruct the original data. In the NSW method, the neighbourhood window constructed with the target pixel as the centre contains relevant pixels that are spatially adjacent to the target pixel. In the neighbourhood window, a nested sliding sub-window contains the target pixel and a part of the relevant pixels. The optimal sub-window position is determined according to the average value of the Pearson correlation coefficients of the target pixel and the relevant pixels, and the target pixel can be reconstructed by using the pixels and the corresponding correlation coefficients in the optimal sub-window. By combining NSW with Principal Component Analysis (PCA) and Support Vector Machine (SVM), a classification model, namely NSW-PCA-SVM, is obtained. This paper conducts experiments on three public datasets, and verifies the effectiveness of the proposed model by comparing with two basic models, i.e., SVM and PCA-SVM, and six state-of-the-art models, i.e., CDCT-WF-SVM, CDCT-2DCT-SVM, SDWT-2DWT-SVM, SDWT-WF-SVM, SDWT-2DCT-SVM and Two-Stage. The proposed approach has the following advantages in overall accuracy (OA)—take the experimental results on the Indian Pines dataset as an example: (1) Compared with SVM (OA = 53.29%) and PCA-SVM (OA = 58.44%), NSW-PCA-SVM (OA = 91.40%) effectively utilizes the spatial information of HSI and improves the classification accuracy. (2) The performance of the proposed model is mainly determined by two parameters, i.e., the window size in NSW and the number of principal components in PCA. The two parameters can be adjusted independently, making parameter adjustment more convenient. (3) When the sample size of the training set is small (20 samples per class), the proposed NSW-PCA-SVM approach achieves 2.38–18.40% advantages in OA over the six state-of-the-art models.

Wavelet-based extended morphological profile and deep autoencoder for hyperspectral image classification

2018 ◽  
Vol 16 (03) ◽  
pp. 1850016 ◽  
Author(s):  
Huiwu Luo ◽  
Yuan Yan Tang ◽  
Robert P. Biuk-Aghai ◽  
Xu Yang ◽  
Lina Yang ◽  
...  
Keyword(s):  
Spatial Information ◽  
Hyperspectral Image ◽  
State Of The Art ◽  
Classification Performance ◽  
Fine Tuning ◽  
Spectral Information ◽  
Data Sets ◽  
Spatial Description ◽  
Hyperspectral Image Classification ◽  
High Level

In this paper, we propose a novel scheme to learn high-level representative features and conduct classification for hyperspectral image (HSI) data in an automatic fashion. The proposed method is a collaboration of a wavelet-based extended morphological profile (WTEMP) and a deep autoencoder (DAE) (“WTEMP-DAE”), with the aim of exploiting the discriminative capability of DAE when using WTEMP features as the input. Each part of WTEMP-DAE is ingenious and contributes to the final classification performance. Specifically, in WTEMP-DAE, the spatial information is extracted from the WTEMP, which is then joined with the wavelet denoised spectral information to form the spectral-spatial description of HSI data. The obtained features are fed into DAE as the original input, where the good weights and bias of the network are initialized through unsupervised pre-training. Once the pre-training is completed, the reconstruction layers are discarded and a logistic regression (LR) layer is added to the top of the network to perform supervised fine-tuning and classification. Experimental results on two real HSI data sets demonstrate that the proposed strategy improves classification performance in comparison with other state-of-the-art hand-crafted feature extractors and their combinations.

scholarly journals Classification of Hyperspectral Image Based on Double-Branch Dual-Attention Mechanism Network

2019 ◽  
Author(s):  
Li Rui ◽  
Zheng Shunyi ◽  
Duan Chenxi ◽  
Yang Yang ◽  
Wang Xiqi
Keyword(s):  
Spatial Information ◽  
Hyperspectral Image ◽  
State Of The Art ◽  
Empirical Studies ◽  
The State ◽  
Attention Mechanism ◽  
Spatial Features ◽  
Better Than

In recent years, more and more researchers have gradually paid attention to Hyperspectral Image (HSI) classification. It is significant to implement researches on how to use HSI's sufficient spectral and spatial information to its fullest potential. To capture spectral and spatial features, we propose a Double-Branch Dual-Attention mechanism network (DBDA) for HSI classification in this paper, Two branches aer designed to extract spectral and spatial features separately to reduce the interferences between these two kinds of features. What is more, because distinguishing characteristics exist in the two branches, two types of attention mechanisms are applied in two branches above separately, ensuring to exploit spectral and spatial features more discriminatively. Finally, the extracted features are fused for classification. A series of empirical studies have been conducted on four hyperspectral datasets, and the results show that the proposed method performs better than the state-of-the-art method.

scholarly journals Dimensionality Reduction using Bi-Dimensional Empirical Mode Decomposition Method for Hyperspectral Image Segmentation

2019 ◽  
Vol 8 (4) ◽  
pp. 11300-11304
Keyword(s):  
Dimensionality Reduction ◽  
Empirical Mode Decomposition ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Clustering Algorithms ◽  
Hyperspectral Data ◽  
Processing Load ◽  
Data Set ◽  
Mode Decomposition ◽  
Empirical Mode Decomposition Method

This paper presents a dimensionality reduction of hyperspectral dataset using bi-dimensional empirical mode decomposition (BEMD). This reduction method is used in a process for segmentation of hyperspectral data. Hyperspectral data contains multiple narrow bands conveying both spectral and spatial information of a scene. Analysis of this kind of data is done in three sequential stages, dimensionality reduction, fusion and segmentation. The method presented in this paper mainly focus on the dimensionality reduction step using BEMD, fusion is carried out using hierarchical fusion method and the segmentation is carried out using Clustering algorithms. This dimensionality reduction removes less informative bands in the data set, decreasing the storage and processing load in further steps in analysis of data. The qualitative and quantitative analysis shows that best informative bands are selected using proposed method which gets high quality segmented image using FCM.

Spatial distribution preserving-based sparse subspace clustering for hyperspectral image

2019 ◽  
Vol 17 (02) ◽  
pp. 1940010
Author(s):  
Yiyang Ding ◽  
Anyong Qin ◽  
Zhaowei Shang ◽  
Jiye Qian
Keyword(s):  
Spatial Distribution ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Subspace Clustering ◽  
Original Data ◽  
Coefficient Matrix ◽  
Intrinsic Structure ◽  
Affine Subspaces ◽  
Novel Approach ◽  
Sparse Subspace Clustering

The high dimensionality and heterogeneity of the hyperspectral image (HSI) make a challenge to the application of machine learning methods, such as sparse subspace clustering (SSC). SSC is designed to represent data as an union of affine subspaces, while it cannot capture the latent structure of the given data. In Mosers theory, the distribution can represent the intrinsic structure efficiently. Hence, we propose a novel approach called spatial distribution preserving-based sparse subspace clustering (SSC-SDP) in this paper for HSI data, which can help sparse representation preserve the underlying manifold structure. Specifically, the density constraint is added by minimizing the inconsistency of the densities estimated in the HSI data and the corresponding sparse coefficient matrix. In addition, we incorporate spatial information into the density estimation of the original data, and the optimization solution based on alternating direction method of multipliers (ADMM) is devised. Three HSI data sets are conducted to evaluate the performance of our SSC-SDP compared with other state-of-art algorithms.

scholarly journals Spatial-Spectral Multiple Manifold Discriminant Analysis for Dimensionality Reduction of Hyperspectral Imagery

2019 ◽  
Vol 11 (20) ◽  
pp. 2414 ◽  
Author(s):  
Guangyao Shi ◽  
Hong Huang ◽  
Jiamin Liu ◽  
Zhengying Li ◽  
Lihua Wang
Keyword(s):  
Discriminant Analysis ◽  
Dimensionality Reduction ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Feature Learning ◽  
Spatial Domain ◽  
Classification Performance ◽  
Neighborhood Structure ◽  
Scatter Matrix ◽  
Manifold Structure

Hyperspectral images (HSI) possess abundant spectral bands and rich spatial information, which can be utilized to discriminate different types of land cover. However, the high dimensional characteristics of spatial-spectral information commonly cause the Hughes phenomena. Traditional feature learning methods can reduce the dimensionality of HSI data and preserve the useful intrinsic information but they ignore the multi-manifold structure in hyperspectral image. In this paper, a novel dimensionality reduction (DR) method called spatial-spectral multiple manifold discriminant analysis (SSMMDA) was proposed for HSI classification. At first, several subsets are obtained from HSI data according to the prior label information. Then, a spectral-domain intramanifold graph is constructed for each submanifold to preserve the local neighborhood structure, a spatial-domain intramanifold scatter matrix and a spatial-domain intermanifold scatter matrix are constructed for each sub-manifold to characterize the within-manifold compactness and the between-manifold separability, respectively. Finally, a spatial-spectral combined objective function is designed for each submanifold to obtain an optimal projection and the discriminative features on different submanifolds are fused to improve the classification performance of HSI data. SSMMDA can explore spatial-spectral combined information and reveal the intrinsic multi-manifold structure in HSI. Experiments on three public HSI data sets demonstrate that the proposed SSMMDA method can achieve better classification accuracies in comparison with many state-of-the-art methods.

scholarly journals Local and Global Geometric Structure Preserving and Application to Hyperspectral Image Classification

2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Huiwu Luo ◽  
Yuan Yan Tang ◽  
Chunli Li ◽  
Lina Yang
Keyword(s):  
Dimension Reduction ◽  
Geometric Structure ◽  
Hyperspectral Image ◽  
Global Structure ◽  
Hyperspectral Data ◽  
Intrinsic Structure ◽  
Data Set ◽  
Structure Preserving ◽  
Structure Information ◽  
Variance Matrix

Locality Preserving Projection (LPP) has shown great efficiency in feature extraction. LPP captures the locality by theK-nearest neighborhoods. However, recent progress has demonstrated the importance of global geometric structure in discriminant analysis. Thus, both the locality and global geometric structure are critical for dimension reduction. In this paper, a novel linear supervised dimensionality reduction algorithm, calledLocality and Global Geometric Structure Preserving(LGGSP) projection, is proposed for dimension reduction. LGGSP encodes not only the local structure information into the optimal objective functions, but also the global structure information. To be specific, two adjacent matrices, that is, similarity matrix and variance matrix, are constructed to detect the local intrinsic structure. Besides, a margin matrix is defined to capture the global structure of different classes. Finally, the three matrices are integrated into the framework of graph embedding for optimal solution. The proposed scheme is illustrated using both simulated data points and the well-known Indian Pines hyperspectral data set, and the experimental results are promising.

scholarly journals Double-Branch Multi-Attention Mechanism Network for Hyperspectral Image Classification

2019 ◽  
Vol 11 (11) ◽  
pp. 1307 ◽  
Author(s):  
Wenping Ma ◽  
Qifan Yang ◽  
Yue Wu ◽  
Wei Zhao ◽  
Xiangrong Zhang
Keyword(s):  
Image Classification ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
State Of The Art ◽  
Attention Mechanism ◽  
Hyperspectral Image Classification ◽  
Spatial Feature ◽  
Types Of Information ◽  
Different Characteristics ◽  
Better Than

Recently, Hyperspectral Image (HSI) classification has gradually been getting attention from more and more researchers. HSI has abundant spectral and spatial information; thus, how to fuse these two types of information is still a problem worth studying. In this paper, to extract spectral and spatial feature, we propose a Double-Branch Multi-Attention mechanism network (DBMA) for HSI classification. This network has two branches to extract spectral and spatial feature respectively which can reduce the interference between the two types of feature. Furthermore, with respect to the different characteristics of these two branches, two types of attention mechanism are applied in the two branches respectively, which ensures to extract more discriminative spectral and spatial feature. The extracted features are then fused for classification. A lot of experiment results on three hyperspectral datasets shows that the proposed method performs better than the state-of-the-art method.

Sign in / Sign up

Export Citation Format

Share Document