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.

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.

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.

scholarly journals A Dual-Path Small Convolution Network for Hyperspectral Image Classification

2021 ◽  
Vol 13 (17) ◽  
pp. 3411
Author(s):  
Lanxue Dang ◽  
Peidong Pang ◽  
Xianyu Zuo ◽  
Yang Liu ◽  
Jay Lee
Keyword(s):  
Hyperspectral Image ◽  
Middle Layer ◽  
Hyperspectral Data ◽  
Model Parameters ◽  
Data Sets ◽  
Testing Time ◽  
Spatial Features ◽  
Current State ◽  
Proposed Model ◽  
Fully Connected

Convolutional neural network (CNN) has shown excellent performance in hyperspectral image (HSI) classification. However, the structure of the CNN models is complex, requiring many training parameters and floating-point operations (FLOPs). This is often inefficient and results in longer training and testing time. In addition, the label samples of hyperspectral data are limited, and a deep network often causes the over-fitting phenomenon. Hence, a dual-path small convolution (DPSC) module is proposed. It is composed of two 1 × 1 small convolutions with a residual path and a density path. It can effectively extract abstract features from HSI. A dual-path small convolution network (DPSCN) is constructed by stacking DPSC modules. Specifically, the proposed model uses a DPSC module to complete the extraction of spectral and spectral–spatial features successively. It then uses a global average pooling layer at the end of the model to replace the conventional fully connected layer to complete the final classification. In the implemented study, all convolutional layers of the proposed network, except the middle layer, use 1 × 1 small convolution, effectively reduced model parameters and increased the speed of feature extraction processes. DPSCN was compared with several current state-of-the-art models. The results on three benchmark HSI data sets demonstrated that the proposed model is of lower complexity, has stronger generalization ability, and has higher classification efficiency.

scholarly journals Sparse Unmixing for Hyperspectral Image with Nonlocal Low-Rank Prior

2019 ◽  
Vol 11 (24) ◽  
pp. 2897 ◽  
Author(s):  
Yuhui Zheng ◽  
Feiyang Wu ◽  
Hiuk Jae Shim ◽  
Le Sun
Keyword(s):  
Mixed Model ◽  
Linear Mixed Model ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Simulated Data ◽  
Hyperspectral Data ◽  
Low Rank ◽  
Data Sets ◽  
Self Similarity ◽  
Model Framework

Hyperspectral unmixing is a key preprocessing technique for hyperspectral image analysis. To further improve the unmixing performance, in this paper, a nonlocal low-rank prior associated with spatial smoothness and spectral collaborative sparsity are integrated together for unmixing the hyperspectral data. The proposed method is based on a fact that hyperspectral images have self-similarity in nonlocal sense and smoothness in local sense. To explore the spatial self-similarity, nonlocal cubic patches are grouped together to compose a low-rank matrix. Then, based on the linear mixed model framework, the nuclear norm is constrained to the abundance matrix of these similar patches to enforce low-rank property. In addition, the local spatial information and spectral characteristic are also taken into account by introducing TV regularization and collaborative sparse terms, respectively. Finally, the results of the experiments on two simulated data sets and two real data sets show that the proposed algorithm produces better performance than other state-of-the-art algorithms.

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.

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.

Spectral-spatial destriping of hyperspectral image via correntropy based sparse representation and unidirectional Huber–Markov random fields

2017 ◽  
Vol 15 (06) ◽  
pp. 1750056 ◽  
Author(s):  
Yulong Wang ◽  
Yuan Yan Tang ◽  
Luoqing Li
Keyword(s):  
Sparse Representation ◽  
Random Fields ◽  
Markov Random Fields ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Spectral Correlation ◽  
Markov Random ◽  
Augmented Lagrange Multiplier

This paper presents a novel destriping method for hyperspectral images. Most of the previous destriping methods regard only the corrupted subimage as an isolated image and fail to consider the high spectral correlation between the subimages in different bands. This may impede their performance of removing striping noises. The proposed method takes advantage of both spectral and spatial information to contribute to the process of striping noise reduction. Firstly, a correntropy-based sparse representation (CSR) model is utilized to learn the high spectral correlation between the subimages in different bands. Then the spatial information of the target subimage with striping noise is incorporated into the CSR model with a unidirectional Huber–Markov random field prior. We devise an Augmented Lagrange Multiplier type of algorithm to efficiently compute the destriped results. The experimental results on two real-world hyperspectral data sets demonstrate the effectiveness of the proposed method.

scholarly journals Unsupervised Clustering for Hyperspectral Images

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 277 ◽  
Author(s):  
Laura Bilius ◽  
Stefan Pentiuc
Keyword(s):  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Data Sets ◽  
Hyperspectral Image Classification ◽  
Spectral Bands ◽  
Long Time ◽  
Parafac Decomposition ◽  
Classification Time

Hyperspectral images are becoming a valuable tool much used in agriculture, mineralogy, and so on. The challenge is to successfully classify the materials founded in the field relevant for different applications. Due to a large amount of data corresponding to a big number of spectral bands, the classification programs require a long time to analyze and classify the data. The purpose is to find a better method for reducing the classification time. We exploit various algorithms on real hyperspectral data sets to find out which algorithm is more effective. This paper presents a comparison of unsupervised hyperspectral image classification such as K-means, Hierarchical clustering, and Parafac decomposition, which allows the performance of the model reduction and feature extraction. The results showed that the method useful for big data is the classification of data after Parafac Decomposition.

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.

Sign in / Sign up

Export Citation Format

Share Document