Dimensionality Reduction of Hyperspectral Image Using Spatial-Spectral Regularized Sparse Hypergraph Embedding

Hong Huang; Meili Chen; Yule Duan

doi:10.3390/rs11091039

Dimensionality Reduction of Hyperspectral Image Using Spatial-Spectral Regularized Sparse Hypergraph Embedding

Remote Sensing ◽

10.3390/rs11091039 ◽

2019 ◽

Vol 11 (9) ◽

pp. 1039 ◽

Cited By ~ 4

Author(s):

Hong Huang ◽

Meili Chen ◽

Yule Duan

Keyword(s):

Dimensionality Reduction ◽

Hyperspectral Image ◽

Spatial Coherence ◽

Graph Embedding ◽

Classification Performance ◽

Spectral Structure ◽

Coherence Property ◽

Dr Method ◽

Point To Point ◽

Embedding Methods

Many graph embedding methods are developed for dimensionality reduction (DR) of hyperspectral image (HSI), which only use spectral features to reflect a point-to-point intrinsic relation and ignore complex spatial-spectral structure in HSI. A new DR method termed spatial-spectral regularized sparse hypergraph embedding (SSRHE) is proposed for the HSI classification. SSRHE explores sparse coefficients to adaptively select neighbors for constructing the dual sparse hypergraph. Based on the spatial coherence property of HSI, a local spatial neighborhood scatter is computed to preserve local structure, and a total scatter is computed to represent the global structure of HSI. Then, an optimal discriminant projection is obtained by possessing better intraclass compactness and interclass separability, which is beneficial for classification. Experiments on Indian Pines and PaviaU hyperspectral datasets illustrated that SSRHE effectively develops a better classification performance compared with the traditional spectral DR algorithms.

Download Full-text

Dimensionality Reduction of Hyperspectral Image Based on Local Constrained Manifold Structure Collaborative Preserving Embedding

Remote Sensing ◽

10.3390/rs13071363 ◽

2021 ◽

Vol 13 (7) ◽

pp. 1363

Author(s):

Guangyao Shi ◽

Fulin Luo ◽

Yiming Tang ◽

Yuan Li

Keyword(s):

Dimensionality Reduction ◽

Hyperspectral Image ◽

Collaborative Representation ◽

Data Sets ◽

Neighborhood Structure ◽

Collaborative Relationship ◽

Manifold Structure ◽

Local Neighborhood ◽

Dr Method ◽

Effective Dimensionality

Graph learning is an effective dimensionality reduction (DR) manner to analyze the intrinsic properties of high dimensional data, it has been widely used in the fields of DR for hyperspectral image (HSI) data, but they ignore the collaborative relationship between sample pairs. In this paper, a novel supervised spectral DR method called local constrained manifold structure collaborative preserving embedding (LMSCPE) was proposed for HSI classification. At first, a novel local constrained collaborative representation (CR) model is designed based on the CR theory, which can obtain more effective collaborative coefficients to characterize the relationship between samples pairs. Then, an intraclass collaborative graph and an interclass collaborative graph are constructed to enhance the intraclass compactness and the interclass separability, and a local neighborhood graph is constructed to preserve the local neighborhood structure of HSI. Finally, an optimal objective function is designed to obtain a discriminant projection matrix, and the discriminative features of various land cover types can be obtained. LMSCPE can characterize the collaborative relationship between sample pairs and explore the intrinsic geometric structure in HSI. Experiments on three benchmark HSI data sets show that the proposed LMSCPE method is superior to the state-of-the-art DR methods for HSI classification.

Download Full-text

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

Remote Sensing ◽

10.3390/rs11202414 ◽

2019 ◽

Vol 11 (20) ◽

pp. 2414 ◽

Cited By ~ 1

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.

Download Full-text

Hyperspectral Image Dimensionality Reduction via Graph Embedding in Core Tensor Space

IEEE Geoscience and Remote Sensing Letters ◽

10.1109/lgrs.2020.2979816 ◽

2020 ◽

pp. 1-5

Author(s):

Peng Wang ◽

Chengyong Zheng ◽

Shengwu Xiong

Keyword(s):

Dimensionality Reduction ◽

Hyperspectral Image ◽

Graph Embedding ◽

Tensor Space

Download Full-text

Large Margin Graph Embedding-Based Discriminant Dimensionality Reduction

Scientific Programming ◽

10.1155/2021/2934362 ◽

2021 ◽

Vol 2021 ◽

pp. 1-12

Author(s):

Yanjia Tian ◽

Xiang Feng

Keyword(s):

Dimensionality Reduction ◽

Evaluation Method ◽

Graph Embedding ◽

Classification Performance ◽

Intrinsic Geometry ◽

The Past ◽

Discriminant Ability ◽

Reduction Methods ◽

Public Datasets ◽

Better Than

Discriminant graph embedding-based dimensionality reduction methods have attracted more and more attention over the past few decades. These methods construct an intrinsic graph and penalty graph to preserve the intrinsic geometry structures of intraclass samples and separate the interclass samples. However, the marginal samples cannot be accurately characterized only by penalty graphs since they treat every sample equally. In practice, these marginal samples often influence the classification performance, which needs to be specially tackled. In this study, the near neighbors’ hypothesis margin of marginal samples has been further maximized to separate the interclass samples and improve the discriminant ability by integrating intrinsic graph and penalty graph. A novel discriminant dimensionality reduction named LMGE-DDR has been proposed. Several experiments on public datasets have been conducted to verify the effectiveness of the proposed LMGE-DDR such as ORL, Yale, UMIST, FERET, CMIU-PIE09, and AR. LMGE-DDR performs better than other compared methods, and the corresponding standard deviation of LMGE-DDR is smaller than others. This demonstrates that the evaluation method verifies the effectiveness of the introduced method.

Download Full-text

Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art

Data Science and Engineering ◽

10.1007/s41019-021-00155-3 ◽

2021 ◽

Author(s):

Yun Peng ◽

Byron Choi ◽

Jianliang Xu

Keyword(s):

Machine Learning ◽

Combinatorial Optimization ◽

Graph Embedding ◽

Partial Solution ◽

Complex Data ◽

Learning Methods ◽

Graph Learning ◽

Second Stage ◽

End To End ◽

Embedding Methods

AbstractGraphs have been widely used to represent complex data in many applications, such as e-commerce, social networks, and bioinformatics. Efficient and effective analysis of graph data is important for graph-based applications. However, most graph analysis tasks are combinatorial optimization (CO) problems, which are NP-hard. Recent studies have focused a lot on the potential of using machine learning (ML) to solve graph-based CO problems. Most recent methods follow the two-stage framework. The first stage is graph representation learning, which embeds the graphs into low-dimension vectors. The second stage uses machine learning to solve the CO problems using the embeddings of the graphs learned in the first stage. The works for the first stage can be classified into two categories, graph embedding methods and end-to-end learning methods. For graph embedding methods, the learning of the the embeddings of the graphs has its own objective, which may not rely on the CO problems to be solved. The CO problems are solved by independent downstream tasks. For end-to-end learning methods, the learning of the embeddings of the graphs does not have its own objective and is an intermediate step of the learning procedure of solving the CO problems. The works for the second stage can also be classified into two categories, non-autoregressive methods and autoregressive methods. Non-autoregressive methods predict a solution for a CO problem in one shot. A non-autoregressive method predicts a matrix that denotes the probability of each node/edge being a part of a solution of the CO problem. The solution can be computed from the matrix using search heuristics such as beam search. Autoregressive methods iteratively extend a partial solution step by step. At each step, an autoregressive method predicts a node/edge conditioned to current partial solution, which is used to its extension. In this survey, we provide a thorough overview of recent studies of the graph learning-based CO methods. The survey ends with several remarks on future research directions.

Download Full-text

Hyperspectral Image Classification with Localized Graph Convolutional Filtering

Remote Sensing ◽

10.3390/rs13030526 ◽

2021 ◽

Vol 13 (3) ◽

pp. 526

Author(s):

Shengliang Pu ◽

Yuanfeng Wu ◽

Xu Sun ◽

Xiaotong Sun

Keyword(s):

Hyperspectral Image ◽

Principal Component ◽

Representation Learning ◽

Classification Performance ◽

Hyperspectral Data ◽

Spectral Graph Theory ◽

Feature Reduction ◽

Graph Representation ◽

Novel Method ◽

Local Graph

The nascent graph representation learning has shown superiority for resolving graph data. Compared to conventional convolutional neural networks, graph-based deep learning has the advantages of illustrating class boundaries and modeling feature relationships. Faced with hyperspectral image (HSI) classification, the priority problem might be how to convert hyperspectral data into irregular domains from regular grids. In this regard, we present a novel method that performs the localized graph convolutional filtering on HSIs based on spectral graph theory. First, we conducted principal component analysis (PCA) preprocessing to create localized hyperspectral data cubes with unsupervised feature reduction. These feature cubes combined with localized adjacent matrices were fed into the popular graph convolution network in a standard supervised learning paradigm. Finally, we succeeded in analyzing diversified land covers by considering local graph structure with graph convolutional filtering. Experiments on real hyperspectral datasets demonstrated that the presented method offers promising classification performance compared with other popular competitors.

Download Full-text

Data Augmentation and Spectral Structure Features for Limited Samples Hyperspectral Classification

Remote Sensing ◽

10.3390/rs13040547 ◽

2021 ◽

Vol 13 (4) ◽

pp. 547

Author(s):

Wenning Wang ◽

Xuebin Liu ◽

Xuanqin Mou

Keyword(s):

Classification Accuracy ◽

Data Augmentation ◽

Classification Problem ◽

Classification Performance ◽

Spectral Structure ◽

Limited Sample ◽

Sample Classification ◽

Training Samples ◽

Traditional Classification ◽

Hyperspectral Classification

For both traditional classification and current popular deep learning methods, the limited sample classification problem is very challenging, and the lack of samples is an important factor affecting the classification performance. Our work includes two aspects. First, the unsupervised data augmentation for all hyperspectral samples not only improves the classification accuracy greatly with the newly added training samples, but also further improves the classification accuracy of the classifier by optimizing the augmented test samples. Second, an effective spectral structure extraction method is designed, and the effective spectral structure features have a better classification accuracy than the true spectral features.

Download Full-text