scholarly journals Semi-Supervised Classification for Hyperspectral Images Based on Multiple Classifiers and Relaxation Strategy

2018 ◽  
Vol 7 (7) ◽  
pp. 284 ◽  
Author(s):  
Fuding Xie ◽  
Dongcui Hu ◽  
Fangfei Li ◽  
Jun Yang ◽  
Deshan Liu
Keyword(s):  
Supervised Classification ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Multinomial Logistic Regression ◽  
Hyperspectral Data ◽  
Classification Result ◽  
Training Samples ◽  
Comparison Results ◽  
Local Mean ◽  
Limited Training Samples

Hyperspectral image (HSI) classification is a fundamental and challenging problem in remote sensing and its various applications. However, it is difficult to perfectly classify remotely sensed hyperspectral data by directly using classification techniques developed in pattern recognition. This is partially owing to a multitude of noise points and the limited training samples. Based on multinomial logistic regression (MLR), the local mean-based pseudo nearest neighbor (LMPNN) rule, and the discontinuity preserving relaxation (DPR) method, in this paper, a semi-supervised method for HSI classification is proposed. In pre-processing and post-processing, the DPR strategy is adopted to denoise the original hyperspectral data and improve the classification accuracy, respectively. The application of two classifiers, MLR and LMPNN, can automatically acquire more labeled samples in terms of a few labeled instances per class. This is termed the pre-classification procedure. The final classification result of the HSI is obtained by employing the MLRsub approach. The effectiveness of the proposal is experimentally evaluated by two real hyperspectral datasets, which are widely used to test the performance of the HSI classification algorithm. The comparison results using several competing methods confirm that the proposed method is effective, even for limited training samples.

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 A DIVERSIFIED DEEP BELIEF NETWORK FOR HYPERSPECTRAL IMAGE CLASSIFICATION

2016 ◽  
Vol XLI-B7 ◽  
pp. 443-449
Author(s):  
P. Zhong ◽  
Z. Q. Gong ◽  
C. Schönlieb
Keyword(s):  
Image Classification ◽  
Real World ◽  
Hyperspectral Image ◽  
Classification Performance ◽  
Fine Tuning ◽  
Hyperspectral Image Classification ◽  
Latent Factors ◽  
Deep Model ◽  
Training Samples ◽  
Limited Training Samples

In recent years, researches in remote sensing demonstrated that deep architectures with multiple layers can potentially extract abstract and invariant features for better hyperspectral image classification. Since the usual real-world hyperspectral image classification task cannot provide enough training samples for a supervised deep model, such as convolutional neural networks (CNNs), this work turns to investigate the deep belief networks (DBNs), which allow unsupervised training. The DBN trained over limited training samples usually has many “dead” (never responding) or “potential over-tolerant” (always responding) latent factors (neurons), which decrease the DBN’s description ability and thus finally decrease the hyperspectral image classification performance. This work proposes a new diversified DBN through introducing a diversity promoting prior over the latent factors during the DBN pre-training and fine-tuning procedures. The diversity promoting prior in the training procedures will encourage the latent factors to be uncorrelated, such that each latent factor focuses on modelling unique information, and all factors will be summed up to capture a large proportion of information and thus increase description ability and classification performance of the diversified DBNs. The proposed method was evaluated over the well-known real-world hyperspectral image dataset. The experiments demonstrate that the diversified DBNs can obtain much better results than original DBNs and comparable or even better performances compared with other recent hyperspectral image classification methods.

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 Attention-Based Residual Network with Scattering Transform Features for Hyperspectral Unmixing with Limited Training Samples

2020 ◽  
Vol 12 (3) ◽  
pp. 400 ◽  
Author(s):  
Zeng ◽  
Ritz ◽  
Zhao ◽  
Lan
Keyword(s):  
Neural Network ◽  
Additive Noise ◽  
Hyperspectral Data ◽  
Training Data ◽  
K Nearest Neighbors ◽  
Practical Applications ◽  
Hyperspectral Unmixing ◽  
Scattering Transform ◽  
Training Samples ◽  
Limited Training Samples

This paper proposes a framework for unmixing of hyperspectral data that is based on utilizing the scattering transform to extract deep features that are then used within a neural network. Previous research has shown that using the scattering transform combined with a traditional K-nearest neighbors classifier (STFHU) is able to achieve more accurate unmixing results compared to a convolutional neural network (CNN) applied directly to the hyperspectral images. This paper further explores hyperspectral unmixing in limited training data scenarios, which are likely to occur in practical applications where the access to large amounts of labeled training data is not possible. Here, it is proposed to combine the scattering transform with the attention-based residual neural network (ResNet). Experimental results on three HSI datasets demonstrate that this approach provides at least 40% higher unmixing accuracy compared to the previous STFHU and CNN algorithms when using limited training data, ranging from 5% to 30%, are available. The use of the scattering transform for deriving features within the ResNet unmixing system also leads more than 25% improvement when unmixing hyperspectral data contaminated by additive noise.

scholarly journals A Sparse Representation-Based Sample Pseudo-Labeling Method for Hyperspectral Image Classification

2020 ◽  
Vol 12 (4) ◽  
pp. 664 ◽  
Author(s):  
Binge Cui ◽  
Jiandi Cui ◽  
Yan Lu ◽  
Nannan Guo ◽  
Maoguo Gong
Keyword(s):  
Sparse Representation ◽  
Image Classification ◽  
Information Entropy ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Hyperspectral Image Classification ◽  
Training Set ◽  
Training Samples ◽  
Labeling Method

Hyperspectral image classification methods may not achieve good performance when a limited number of training samples are provided. However, labeling sufficient samples of hyperspectral images to achieve adequate training is quite expensive and difficult. In this paper, we propose a novel sample pseudo-labeling method based on sparse representation (SRSPL) for hyperspectral image classification, in which sparse representation is used to select the purest samples to extend the training set. The proposed method consists of the following three steps. First, intrinsic image decomposition is used to obtain the reflectance components of hyperspectral images. Second, hyperspectral pixels are sparsely represented using an overcomplete dictionary composed of all training samples. Finally, information entropy is defined for the vectorized sparse representation, and then the pixels with low information entropy are selected as pseudo-labeled samples to augment the training set. The quality of the generated pseudo-labeled samples is evaluated based on classification accuracy, i.e., overall accuracy, average accuracy, and Kappa coefficient. Experimental results on four real hyperspectral data sets demonstrate excellent classification performance using the new added pseudo-labeled samples, which indicates that the generated samples are of high confidence.

scholarly journals COUPLE GRAPH BASED LABEL PROPAGATION METHOD FOR HYPERSPECTRAL REMOTE SENSING DATA CLASSIFICATION

2018 ◽  
Vol XLII-3 ◽  
pp. 1795-1798
Author(s):  
X. P. Wang ◽  
Y. Hu ◽  
J. Chen
Keyword(s):  
Manifold Learning ◽  
Classification Accuracy ◽  
Supervised Classification ◽  
Hyperspectral Image ◽  
Remote Sensing Data ◽  
Graph Laplacian ◽  
Hyperspectral Data ◽  
Label Propagation ◽  
Hyperspectral Image Classification ◽  
Adjacency Graph

Graph based semi-supervised classification method are widely used for hyperspectral image classification. We present a couple graph based label propagation method, which contains both the adjacency graph and the similar graph. We propose to construct the similar graph by using the similar probability, which utilize the label similarity among examples probably. The adjacency graph was utilized by a common manifold learning method, which has effective improve the classification accuracy of hyperspectral data. The experiments indicate that the couple graph Laplacian which unite both the adjacency graph and the similar graph, produce superior classification results than other manifold Learning based graph Laplacian and Sparse representation based graph Laplacian in label propagation framework.

Sign in / Sign up

Export Citation Format

Share Document