scholarly journals GRAPH-BASED SEMI-SUPERVISED HYPERSPECTRAL IMAGE CLASSIFICATION USING SPATIAL INFORMATION

2017 ◽  
Vol XLII-4/W4 ◽  
pp. 91-96
Author(s):  
N. Jamshidpour ◽  
S. Homayouni ◽  
A. Safari
Keyword(s):  
Image Classification ◽  
Supervised Classification ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Main Idea ◽  
Hyperspectral Data ◽  
Training Data ◽  
Data Sets ◽  
Hyperspectral Image Classification ◽  
Data Set

Hyperspectral image classification has been one of the most popular research areas in the remote sensing community in the past decades. However, there are still some problems that need specific attentions. For example, the lack of enough labeled samples and the high dimensionality problem are two most important issues which degrade the performance of supervised classification dramatically. The main idea of semi-supervised learning is to overcome these issues by the contribution of unlabeled samples, which are available in an enormous amount. In this paper, we propose a graph-based semi-supervised classification method, which uses both spectral and spatial information for hyperspectral image classification. More specifically, two graphs were designed and constructed in order to exploit the relationship among pixels in spectral and spatial spaces respectively. Then, the Laplacians of both graphs were merged to form a weighted joint graph. The experiments were carried out on two different benchmark hyperspectral data sets. The proposed method performed significantly better than the well-known supervised classification methods, such as SVM. The assessments consisted of both accuracy and homogeneity analyses of the produced classification maps. The proposed spectral-spatial SSL method considerably increased the classification accuracy when the labeled training data set is too scarce.When there were only five labeled samples for each class, the performance improved 5.92% and 10.76% compared to spatial graph-based SSL, for AVIRIS Indian Pine and Pavia University data sets respectively.

A novel semi-supervised learning framework for hyperspectral image classification

2016 ◽  
Vol 14 (02) ◽  
pp. 1640005 ◽  
Author(s):  
Zhijing Ye ◽  
Hong Li ◽  
Yalong Song ◽  
Jianzhong Wang ◽  
Jon Atli Benediktsson
Keyword(s):  
Image Classification ◽  
Supervised Learning ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Hyperspectral Image Classification ◽  
Learning Framework ◽  
Classification Framework ◽  
Adaptive Interpolation

In this paper, we propose a novel semi-supervised learning classification framework using box-based smooth ordering and multiple 1D-embedding-based interpolation (M1DEI) in [J. Wang, Semi-supervised learning using multiple one-dimensional embedding-based adaptive interpolation, Int. J. Wavelets Multiresolut. Inf. Process. 14(2) (2016) 11 pp.] for hyperspectral images. Due to the lack of labeled samples, conventional supervised approaches cannot generally perform efficient enough. On the other hand, obtaining labeled samples for hyperspectral image classification is difficult, expensive and time-consuming, while unlabeled samples are easily available. The proposed method can effectively overcome the lack of labeled samples by introducing new labeled samples from unlabeled samples in a label boosting framework. Furthermore, the proposed method uses spatial information from the pixels in the neighborhood of the current pixel to better catch the features of hyperspectral image. The proposed idea is that, first, we extract the box (cube data) of each pixel from its neighborhood, then apply multiple 1D interpolation to construct the classifier. Experimental results on three hyperspectral data sets demonstrate that the proposed method is efficient, and outperforms recent popular semi-supervised methods in terms of accuracies.

An Incremental Isomap Method for Hyperspectral Dimensionality Reduction and Classification

2021 ◽  
Vol 87 (6) ◽  
pp. 445-455
Author(s):  
Yi Ma ◽  
Zezhong Zheng ◽  
Yutang Ma ◽  
Mingcang Zhu ◽  
Ran Huang ◽  
...  
Keyword(s):  
Manifold Learning ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Training Data ◽  
Support Vector ◽  
Data Sets ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Data Points

Many manifold learning algorithms conduct an eigen vector analysis on a data-similarity matrix with a size of N×N, where N is the number of data points. Thus, the memory complexity of the analysis is no less than O(N2). We pres- ent in this article an incremental manifold learning approach to handle large hyperspectral data sets for land use identification. In our method, the number of dimensions for the high-dimensional hyperspectral-image data set is obtained with the training data set. A local curvature varia- tion algorithm is utilized to sample a subset of data points as landmarks. Then a manifold skeleton is identified based on the landmarks. Our method is validated on three AVIRIS hyperspectral data sets, outperforming the comparison algorithms with a k–nearest-neighbor classifier and achieving the second best performance with support vector machine.

scholarly journals Spectral and Spatial Classification of Hyperspectral Images Based on Random Multi-Graphs

2018 ◽  
Vol 10 (8) ◽  
pp. 1271 ◽  
Author(s):  
Feng Gao ◽  
Qun Wang ◽  
Junyu Dong ◽  
Qizhi Xu
Keyword(s):  
Image Classification ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Small Sample ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
High Dimensional ◽  
Hyperspectral Image Classification ◽  
Spatial Classification ◽  
Spatial Features

Hyperspectral image classification has been acknowledged as the fundamental and challenging task of hyperspectral data processing. The abundance of spectral and spatial information has provided great opportunities to effectively characterize and identify ground materials. In this paper, we propose a spectral and spatial classification framework for hyperspectral images based on Random Multi-Graphs (RMGs). The RMG is a graph-based ensemble learning method, which is rarely considered in hyperspectral image classification. It is empirically verified that the semi-supervised RMG deals well with small sample setting problems. This kind of problem is very common in hyperspectral image applications. In the proposed method, spatial features are extracted based on linear prediction error analysis and local binary patterns; spatial features and spectral features are then stacked into high dimensional vectors. The high dimensional vectors are fed into the RMG for classification. By randomly selecting a subset of features to create a graph, the proposed method can achieve excellent classification performance. The experiments on three real hyperspectral datasets have demonstrated that the proposed method exhibits better performance than several closely related methods.

scholarly journals Active Semi-Supervised Random Forest for Hyperspectral Image Classification

2019 ◽  
Vol 11 (24) ◽  
pp. 2974 ◽  
Author(s):  
Youqiang Zhang ◽  
Guo Cao ◽  
Xuesong Li ◽  
Bisheng Wang ◽  
Peng Fu
Keyword(s):  
Random Forest ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Great Success ◽  
Full Potential ◽  
Hyperspectral Image Classification ◽  
Unified Framework ◽  
Proposed Model

Random forest (RF) has obtained great success in hyperspectral image (HSI) classification. However, RF cannot leverage its full potential in the case of limited labeled samples. To address this issue, we propose a unified framework that embeds active learning (AL) and semi-supervised learning (SSL) into RF (ASSRF). Our aim is to utilize AL and SSL simultaneously to improve the performance of RF. The objective of the proposed method is to use a small number of manually labeled samples to train classifiers with relative high classification accuracy. To achieve this goal, a new query function is designed to query the most informative samples for manual labeling, and a new pseudolabeling strategy is introduced to select some samples for pseudolabeling. Compared with other AL- and SSL-based methods, the proposed method has several advantages. First, ASSRF utilizes the spatial information to construct a query function for AL, which can select more informative samples. Second, in addition to providing more labeled samples for SSL, the proposed pseudolabeling method avoids bias caused by AL-labeled samples. Finally, the proposed model retains the advantages of RF. To demonstrate the effectiveness of ASSRF, we conducted experiments on three real hyperspectral data sets. The experimental results have shown that our proposed method outperforms other state-of-the-art methods.

Semi-Supervised Classification for Hyperspectral Image Based on Tri-Training

2014 ◽  
Vol 687-691 ◽  
pp. 3644-3647 ◽  
Author(s):  
Li Guo Wang ◽  
Yue Shuang Yang ◽  
Ting Ting Lu
Keyword(s):  
Supervised Classification ◽  
Hyperspectral Image ◽  
Learning Algorithm ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Hyperspectral Image Classification ◽  
Training Set ◽  
De Algorithm ◽  
Training Samples ◽  
Limited Training Samples

Hyperspectral image classification is difficult due to the high dimensional features but limited training samples. Tri-training learning is a widely used semi-supervised classification method that addresses the problem of lacking of labeled examples. In this paper, a novel semi-supervised learning algorithm based on tri-training method is proposed. The proposed algorithm combines margin sampling (MS) technique and differential evolution (DE) algorithm to select the most informative samples and perturb them randomly. Then the samples we obtained, which can fulfill the labeled data distribution and introduce diversity to multiple classifiers, are added to training set to train base classifiers for tri-training. The proposed algorithm is experimentally validated using real hyperspectral data sets, indicating that the combination of MS and DE can significantly reduce the need of labeled samples while achieving high accuracy compared with state-of-the-art algorithms.

scholarly journals Spatial–Spectral Squeeze-and-Excitation Residual Network for Hyperspectral Image Classification

2019 ◽  
Vol 11 (7) ◽  
pp. 884 ◽  
Author(s):  
Li Wang ◽  
Jiangtao Peng ◽  
Weiwei Sun
Keyword(s):  
Network Architecture ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Learning Networks ◽  
Hyperspectral Image Classification ◽  
Residual Network ◽  
Noise Interference ◽  
Spectral Bands

Jointly using spectral and spatial information has become a mainstream strategy in the field of hyperspectral image (HSI) processing, especially for classification. However, due to the existence of noisy or correlated spectral bands in the spectral domain and inhomogeneous pixels in the spatial neighborhood, HSI classification results are often degraded and unsatisfactory. Motivated by the attention mechanism, this paper proposes a spatial–spectral squeeze-and-excitation (SSSE) module to adaptively learn the weights for different spectral bands and for different neighboring pixels. The SSSE structure can suppress or motivate features at a certain position, which can effectively resist noise interference and improve the classification results. Furthermore, we embed several SSSE modules into a residual network architecture and generate an SSSE-based residual network (SSSERN) model for HSI classification. The proposed SSSERN method is compared with several existing deep learning networks on two benchmark hyperspectral data sets. Experimental results demonstrate the effectiveness of our proposed network.

A Double-Strategy-Check Active Learning Algorithm for Hyperspectral Image Classification

2019 ◽  
Vol 85 (11) ◽  
pp. 841-851
Author(s):  
Ying Cui ◽  
Xiaowei Ji ◽  
Kai Xu ◽  
Liguo Wang
Keyword(s):  
Active Learning ◽  
Image Classification ◽  
Traditional Method ◽  
Hyperspectral Image ◽  
Learning Algorithm ◽  
Semisupervised Learning ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Classification Methods ◽  
Hyperspectral Image Classification

Applying limited labeled samples to improve classification results is a challenge in hyperspectral images. Active Learning (AL) and Semisupervised Learning (SSL) are two promising techniques to achieve this challenge. Combining AL with SSL is an excellent idea for hyperspectral image classification. The traditional method, such as the Collaborative Active and Semisupervised Learning algorithm (CASSL), may introduce many incorrect pseudolabels and shows premature convergence. To overcome these drawbacks, a novel framework named Double-Strategy-Check Collaborative Active and Semisupervised Learning (DSC-CASSL) is proposed in this paper. This framework combines two different AL algorithms and SSL in a collaborative mode. The double-strategy verification can gradually improve the pseudolabeling accuracy and facilitate SSL. We evaluate the performance of DSC-CASSL on four hyperspectral data sets and compare it with that of four hyperspectral image classification methods. Our results suggest that DSC-CASSL leads to consistent improvement for hyperspectral image classification.

scholarly journals Deep Spectral Spatial Inverted Residual Network for Hyperspectral Image Classification

2021 ◽  
Vol 13 (21) ◽  
pp. 4472
Author(s):  
Tianyu Zhang ◽  
Cuiping Shi ◽  
Diling Liao ◽  
Liguo Wang
Keyword(s):  
Image Classification ◽  
Data Augmentation ◽  
Hyperspectral Image ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Hyperspectral Image Classification ◽  
Feature Maps ◽  
Spatial Feature ◽  
Global Context

Convolutional neural networks (CNNs) have been widely used in hyperspectral image classification in recent years. The training of CNNs relies on a large amount of labeled sample data. However, the number of labeled samples of hyperspectral data is relatively small. Moreover, for hyperspectral images, fully extracting spectral and spatial feature information is the key to achieve high classification performance. To solve the above issues, a deep spectral spatial inverted residuals network (DSSIRNet) is proposed. In this network, a data block random erasing strategy is introduced to alleviate the problem of limited labeled samples by data augmentation of small spatial blocks. In addition, a deep inverted residuals (DIR) module for spectral spatial feature extraction is proposed, which locks the effective features of each layer while avoiding network degradation. Furthermore, a global 3D attention module is proposed, which can realize the fine extraction of spectral and spatial global context information under the condition of the same number of input and output feature maps. Experiments are carried out on four commonly used hyperspectral datasets. A large number of experimental results show that compared with some state-of-the-art classification methods, the proposed method can provide higher classification accuracy for hyperspectral images.

Sign in / Sign up

Export Citation Format

Share Document