scholarly journals Depthwise Separable Relation Network for Small Sample Hyperspectral Image Classification

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1673
Author(s):  
Aili Wang ◽  
Chengyang Liu ◽  
Dong Xue ◽  
Haibin Wu ◽  
Yuxiao Zhang ◽  
...  
Keyword(s):  
Hyperspectral Image ◽  
Computational Cost ◽  
Optimal Solution ◽  
Image Data ◽  
Small Sample ◽  
Hyperspectral Data ◽  
Small Samples ◽  
Model Training ◽  
Metric Distance ◽  
Training Efficiency

Although hyperspectral data provide rich feature information and are widely used in other fields, the data are still scarce. Training small sample data classification is still a major challenge for HSI classification based on deep learning. Recently, the method of mining sample relationships has been proved to be an effective method for training small samples. However, this strategy requires high computational power, which will increase the difficulty of network model training. This paper proposes a modified depthwise separable relational network to deeply capture the similarity between samples. In addition, in order to effectively mine the similarity between samples, the feature vectors of support samples and query samples are symmetrically spliced. According to the metric distance between symmetrical structures, the dependence of the model on samples can be effectively reduced. Firstly, in order to improve the training efficiency of the model, depthwise separable convolution is introduced to reduce the computational cost of the model. Secondly, the Leaky-ReLU function effectively activates all neurons in each layer of neural network to improve the training efficiency of the model. Finally, the cosine annealing learning rate adjustment strategy is introduced to avoid the model falling into the local optimal solution and enhance the robustness of the model. The experimental results on two widely used hyperspectral remote sensing image data sets (Pavia University and Kennedy Space Center) show that compared with seven other advanced classification methods, the proposed method achieves better classification accuracy under the condition of limited training samples.

Unmixing of large-scale hyperspectral data based on projected mini-batch gradient descent

2017 ◽  
Vol 15 (06) ◽  
pp. 1750059 ◽  
Author(s):  
Jing Li ◽  
Xiaorun Li ◽  
Liaoying Zhao
Keyword(s):  
Minimization Problem ◽  
Gradient Descent ◽  
Large Scale ◽  
Hyperspectral Image ◽  
Computational Cost ◽  
Nonnegative Matrix ◽  
Image Data ◽  
Real Data ◽  
Optimization Method ◽  
Hyperspectral Data

The minimization problem of reconstruction error over large hyperspectral image data is one of the most important problems in unsupervised hyperspectral unmixing. A variety of algorithms based on nonnegative matrix factorization (NMF) have been proposed in the literature to solve this minimization problem. One popular optimization method for NMF is the projected gradient descent (PGD). However, as the algorithm must compute the full gradient on the entire dataset at every iteration, the PGD suffers from high computational cost in the large-scale real hyperspectral image. In this paper, we try to alleviate this problem by introducing a mini-batch gradient descent-based algorithm, which has been widely used in large-scale machine learning. In our method, the endmember can be updated pixel set by pixel set while abundance can be updated band set by band set. Thus, the computational cost is lowered to a certain extent. The performance of the proposed algorithm is quantified in the experiment on synthetic and real data.

scholarly journals Efficient Lossless Compression of Multitemporal Hyperspectral Image Data

2018 ◽  
Vol 4 (12) ◽  
pp. 142 ◽  
Author(s):  
Hongda Shen ◽  
Zhuocheng Jiang ◽  
W. Pan
Keyword(s):  
Data Compression ◽  
Hyperspectral Image ◽  
Image Data ◽  
Lossless Compression ◽  
Large Data ◽  
Hyperspectral Data ◽  
Compression Performance ◽  
Temporal Correlations ◽  
Sensing Applications ◽  
Data Volume

Hyperspectral imaging (HSI) technology has been used for various remote sensing applications due to its excellent capability of monitoring regions-of-interest over a period of time. However, the large data volume of four-dimensional multitemporal hyperspectral imagery demands massive data compression techniques. While conventional 3D hyperspectral data compression methods exploit only spatial and spectral correlations, we propose a simple yet effective predictive lossless compression algorithm that can achieve significant gains on compression efficiency, by also taking into account temporal correlations inherent in the multitemporal data. We present an information theoretic analysis to estimate potential compression performance gain with varying configurations of context vectors. Extensive simulation results demonstrate the effectiveness of the proposed algorithm. We also provide in-depth discussions on how to construct the context vectors in the prediction model for both multitemporal HSI and conventional 3D HSI data.

A Large Margin Learning Method for Matching Images of Natural Objects with Different Dimensions

2015 ◽  
pp. 323-341
Author(s):  
Haoyi Zhou ◽  
Jun Zhou ◽  
Haichuan Yang ◽  
Cheng Yan ◽  
Xiao Bai ◽  
...  
Keyword(s):  
Feature Matching ◽  
Hyperspectral Image ◽  
Graph Matching ◽  
Graph Model ◽  
Image Data ◽  
Weighted Graph ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Natural Objects ◽  
Different Dimensions

Imaging devices are of increasing use in environmental research requiring an urgent need to deal with such issues as image data, feature matching over different dimensions. Among them, matching hyperspectral image with other types of images is challenging due to the high dimensional nature of hyperspectral data. This chapter addresses this problem by investigating structured support vector machines to construct and learn a graph-based model for each type of image. The graph model incorporates both low-level features and stable correspondences within images. The inherent characteristics are depicted by using a graph matching algorithm on extracted weighted graph models. The effectiveness of this method is demonstrated through experiments on matching hyperspectral images to RGB images, and hyperspectral images with different dimensions on images of natural objects.

Image Fusion in Hyperspectral Image Classification using Genetic Algorithm

2016 ◽  
Vol 2 (3) ◽  
pp. 703 ◽  
Author(s):  
B. Saichandana ◽  
K. Srinivas ◽  
R. KiranKumar
Keyword(s):  
Genetic Algorithm ◽  
Image Fusion ◽  
Image Classification ◽  
Empirical Mode Decomposition ◽  
Hyperspectral Image ◽  
Image Data ◽  
Hyperspectral Data ◽  
Hyperspectral Image Classification ◽  
Mode Decomposition ◽  
Fused Image

<p>Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. This paper presents hyperspectral image classification mechanism using genetic algorithm with empirical mode decomposition and image fusion used in preprocessing stage. 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, image fusion is performed on the hyperspectral bands to selectively merge the maximum possible features from the source images to form a single image. This fused image is classified using genetic algorithm. Different indices, such as K-means (KMI), Davies-Bouldin Index (DBI), and Xie-Beni Index (XBI) are used as objective functions. This method increases classification accuracy of hyperspectral image.</p>

Dimensionality Reduction and Classification of Hyperspectral Images using Genetic Algorithm

2016 ◽  
Vol 3 (3) ◽  
pp. 503 ◽  
Author(s):  
R. Kiran Kumar ◽  
B. Saichandana ◽  
K. Srinivas
Keyword(s):  
Genetic Algorithm ◽  
Dimensionality Reduction ◽  
Hyperspectral Image ◽  
Image Data ◽  
Unsupervised Classification ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Data Set ◽  
Mode Decomposition ◽  
Fused Image

<p>This paper presents genetic algorithm based band selection and classification on hyperspectral image data set. Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. In this paper, first filtering based on 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, band selection is done using genetic algorithm in-order to remove bands that convey less information. This dimensionality reduction minimizes many requirements such as storage space, computational load, communication bandwidth etc which is imposed on the unsupervised classification algorithms. Next image fusion is performed on the selected hyperspectral bands to selectively merge the maximum possible features from the selected images to form a single image. This fused image is classified using genetic algorithm. Three different indices, such as K-means Index (KMI) and Jm measure are used as objective functions. This method increases classification accuracy and performance of hyperspectral image than without dimensionality reduction.</p>

scholarly journals Improved Classification Method Based on the Diverse Density and Sparse Representation Model for a Hyperspectral Image

Sensors ◽  
2019 ◽  
Vol 19 (24) ◽  
pp. 5559
Author(s):  
Na Li ◽  
Ruihao Wang ◽  
Huijie Zhao ◽  
Mingcong Wang ◽  
Kewang Deng ◽  
...  
Keyword(s):  
Sparse Representation ◽  
Infrared Imaging ◽  
Hyperspectral Image ◽  
Matching Pursuit ◽  
Small Sample Size ◽  
Small Sample ◽  
Hyperspectral Data ◽  
Classification Method ◽  
Diverse Density

To solve the small sample size (SSS) problem in the classification of hyperspectral image, a novel classification method based on diverse density and sparse representation (NCM_DDSR) is proposed. In the proposed method, the dictionary atoms, which learned from the diverse density model, are used to solve the noise interference problems of spectral features, and an improved matching pursuit model is presented to obtain the sparse coefficients. Airborne hyperspectral data collected by the push-broom hyperspectral imager (PHI) and the airborne visible/infrared imaging spectrometer (AVIRIS) are applied to evaluate the performance of the proposed classification method. Results illuminate that the overall accuracies of the proposed model for classification of PHI and AVIRIS images are up to 91.59% and 92.83% respectively. In addition, the kappa coefficients are up to 0.897 and 0.91.

Active Learning via Multi-View and Local Proximity Co-Regularization for Hyperspectral Image Classification

2011 ◽  
Vol 5 (3) ◽  
pp. 618-628 ◽  
Author(s):  
Wei Di ◽  
Melba M. Crawford
Keyword(s):  
Active Learning ◽  
Image Classification ◽  
Hyperspectral Image ◽  
Computational Cost ◽  
Hyperspectral Data ◽  
Unlabeled Data ◽  
Support Vector ◽  
Svm Classifier ◽  
Small Subset ◽  
Hyperspectral Image Classification

A novel co-regularization framework for active learning is proposed for hyperspectral image classification. The first regularizer explores the intrinsic multi-view information embedded in the hyperspectral data. By adaptively and quantitatively measuring the disagreement level, it focuses only on samples with high uncertainty and builds a contention pool which is a small subset of the overall unlabeled data pool, thereby mitigating the computational cost. The second regularizer is based on the &#x201C;consistency assumption&#x201D; and designed on a spatial or the spectral based manifold space. It serves to further focus on the most informative samples within the contention pool by penalizing rapid changes in the classification function evaluated on proximally close samples in a local region. Such changes may be due to the lack of capability of the current learner to describe the unlabeled data. Incorporating manifold learning into the active learning process enforces the clustering assumption and avoids the degradation of the distance measure associated with the original high-dimensional spectral features. One spatial and two local spectral embedding methods are considered in this study, in conjunction with the support vector machine (SVM) classifier implemented with a radial basis function (RBF) kernel. Experiments show excellent performance on AVIRIS and Hyperion hyperspectral data as compared to random sampling and the state-of-the-art SVMSIMPLE.

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.

A Large Margin Learning Method for Matching Images of Natural Objects With Different Dimensions

2019 ◽  
pp. 561-580
Author(s):  
Haoyi Zhou ◽  
Jun Zhou ◽  
Haichuan Yang ◽  
Cheng Yan ◽  
Xiao Bai ◽  
...  
Keyword(s):  
Feature Matching ◽  
Hyperspectral Image ◽  
Graph Matching ◽  
Graph Model ◽  
Image Data ◽  
Weighted Graph ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Natural Objects ◽  
Different Dimensions

Imaging devices are of increasing use in environmental research requiring an urgent need to deal with such issues as image data, feature matching over different dimensions. Among them, matching hyperspectral image with other types of images is challenging due to the high dimensional nature of hyperspectral data. This chapter addresses this problem by investigating structured support vector machines to construct and learn a graph-based model for each type of image. The graph model incorporates both low-level features and stable correspondences within images. The inherent characteristics are depicted by using a graph matching algorithm on extracted weighted graph models. The effectiveness of this method is demonstrated through experiments on matching hyperspectral images to RGB images, and hyperspectral images with different dimensions on images of natural objects.

scholarly journals Hybrid Depth-Separable Residual Networks for Hyperspectral Image Classification

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Cuijie Zhao ◽  
Hongdong Zhao ◽  
Guozhen Wang ◽  
Hong Chen
Keyword(s):  
Hyperspectral Image ◽  
Computational Cost ◽  
Ground Truth ◽  
Hyperspectral Data ◽  
Deep Convolutional Neural Networks ◽  
Convolutional Network ◽  
Benchmark Datasets ◽  
Deep Convolutional Network ◽  
3D Cnn

At present, the classification of the hyperspectral image (HSI) based on the deep convolutional network has made great progress. Due to the high dimensionality of spectral features, limited samples of ground truth, and high nonlinearity of hyperspectral data, effective classification of HSI based on deep convolutional neural networks is still difficult. This paper proposes a novel deep convolutional network structure, namely, a hybrid depth-separable residual network, for HSI classification, called HDSRN. The HDSRN model organically combines 3D CNN, 2D CNN, multiresidual network ROR, and depth-separable convolutions to extract deeper abstract features. On the one hand, due to the addition of multiresidual structures and skip connections, this model can alleviate the problem of over fitting, help the backpropagation of gradients, and extract features more fully. On the other hand, the depth-separable convolutions are used to learn the spatial feature, which reduces the computational cost and alleviates the decline in accuracy. Extensive experiments on the popular HSI benchmark datasets show that the performance of the proposed network is better than that of the existing prevalent methods.

Sign in / Sign up

Export Citation Format

Share Document