Local Binary Patterns and Superpixel-Based Multiple Kernels for Hyperspectral Image Classification

Hyperspectral Image (HSI) classification plays a key role remote sensing field. Recently, deep learning has demonstrated its effectiveness in HSI Classification field. This paper presents a spectral-spatial HSI classification technique established on the deep learning based deep belief network (DBN) for deep and abstract feature extraction and adaptive boundary adjustment based segmentation. Proposed approach focuses on integrating the deep learning based spectral features and segmentation based spatial features into a framework for improved performance. Specifically, first the deep DBN model is exploited as a spectral feature extraction based classifier to extract the deep spectral features. Second, spatial contextual features are obtained by utilizing effective adaptive boundary adjustment based segmentation technique. Finally, maximum voting based criteria is operated to integrate the results of extracted spectral and spatial information for improved HSI classification. In general, exploiting spectral features from DBN process and spatial features from segmentation and integration of spectral and spatial information by maximum voting based criteria, has a substantial effect on the performance of HSI classification. Experimental performance on real and widely used hyperspectral data sets with different contexts and resolutions demonstrates the accuracy of the proposed technique and performance is comparable to several recently proposed HSI classification techniques.

Adaptive spectral-spatial feature fusion network for hyperspectral image classification using limited training samples

Due to the 3-D nature of hyperspectral images, as well as the spatial properties (such as regularity and continuity) of land covers, many 3-D feature extraction operators have been designed to fully exploit the joint spatial–spectral information. However, the large amount of obtained features can suffer from the “curse of dimensionality” problem, especially for the small training sample set. Moreover, various spatial–spectral features can represent the characteristics of the hyperspectral image from different aspects. In this paper, a multiple 3-D feature fusion framework (M3DF3) has been proposed for hyperspectral image classification. First, we extend the 2-D Gabor surface feature into 3-D (3DSF) domains to comply with the spatial–spectral structure of the hyperspectral image, which is directly applied on the original hyperspectral image instead of the Gabor features. Second, three 3-D feature extraction methods, including the 3-D morphological profile, the 3-D local binary pattern, and the proposed 3DSF, that, respectively, characterize the hyperspectral image from three different angles, i.e., morphology, local dependence, and shape smoothness, are fused under a multitask sparse representation framework to take full advantage of the multiple 3-D features together. The proposed M3DF3 approach was fully tested on three real-world hyperspectral image data, i.e., the widely used Indian Pines, Pavia University, and Houston University. The results show that our method can achieve as high as 68.22%, 79.44%, and 72.84% accuracies, respectively, even when only few samples, i.e., three samples per class, are used for training.

In recent studies, superpixel segmentation has been integrated into hyperspectral (HS) image classification methods. However, the existing superpixel-based classification methods usually suffer from two serious problems. First, the accuracy and efficiency of current superpixel segmentation approaches cannot meet the demands of practical applications for HS images; second, conventional superpixel-based classification methods generally consider each generated superpixel as a unit for the image classification, which may help to reduce the computing time but result in a significant decrease of the classification accuracy. To solve the problems, we propose a fast region growing based superpixel segmentation (FRGSS) algorithm and a novel texture-adaptive superpixel integration strategy (TASIS) for the HS image classification. Experimental results on real Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) HS images demonstrate that the proposed FRGSS outperforms the state-of-the-art superpixel algorithm. In addition, the superiority of the TASIS is verified compared to the pixel-wise and the conventional superpixel-based classification methods.

Hyperspectral image (HSI) classification has become one of the most significant tasks in the field of hyperspectral analysis. However, classifying each pixel in HSI accurately is challenging due to the curse of dimensionality and limited training samples. In this paper, we present an HSI classification architecture called camera spectral response network (CSR-Net), which can learn the optimal camera spectral response (CSR) function for HSI classification problems and effectively reduce the spectral dimensions of HSI. Specifically, we design a convolutional layer to simulate the capturing process of cameras, which learns the optimal CSR function for HSI classification. Then, spectral and spatial features are further extracted by spectral and spatial attention modules. On one hand, the learned CSR can be implemented physically and directly used to capture scenes, which makes the image acquisition process more convenient. On the other hand, compared with ordinary HSIs, we only need images with far fewer bands, without sacrificing the classification precision and avoiding the curse of dimensionality. The experimental results of four popular public hyperspectral datasets show that our method, with only a few image bands, outperforms state-of-the-art HSI classification methods which utilize the full spectral bands of images.

Hyperspectral image classification using multi-feature fusion

Local binary pattern (LBP) is a simple yet efficient image feature description algorithm that has been widely used in applications related to image classification. To more effectively make use of the local features of a hyperspectral image (HSI), a tensor-based spatial–spectral local binary pattern (TSSLBP) that can fully utilize the local spatial-spectral feature of an HSI is proposed. We specifically make efforts in three aspects. First, we construct a third-order tensor model for HSI to combine the local spatial and spectral features. Second, a dimension reduction method based on tensor decomposition is proposed to reduce redundant information of the HSI tensor model. Third, a joint spatial-spectral LBP coding algorithm is implemented based on the HSI tensor model to calculate the local spatial–spectral feature vector of HSI. To verify the effectiveness of the proposed TSSLBP, we apply it to the task of HSI classification and compare it with six existing algorithms. Experimental results on the three popular HSI datasets show that TSSLBP can fully utilize rich information in the local spatial–spectral domain and can significantly improve the classification accuracy of HSI, especially in the case of scarce training samples.

Hyperspectral image (HSI) classification is one of the most crucial tasks in remote sensing processing. The attention mechanism is preferable to a convolutional neural network (CNN), due to its superior ability to express information during HSI processing. Recently, numerous methods combining CNNs and attention mechanisms have been applied in HSI classification. However, it remains a challenge to achieve high-accuracy classification by fully extracting effective features from HSIs under the conditions of limited labeled samples. In this paper, we design a novel HSI classification network based on multiscale hybrid networks and attention mechanisms. The network consists of three subnetworks: a spectral-spatial feature extraction network, a spatial inverted pyramid network, and a classification network, which are employed to extract spectral-spatial features, to extract spatial features, and to obtain classification results, respectively. The multiscale fusion network and attention mechanisms complement each other by capturing local and global features separately. In the spatial pyramid network, multiscale spaces are formed through down-sampling, which can reduce redundant information while retaining important information. The structure helps the network better capture spatial features at different scales, and to improve classification accuracy. Experimental results on various public HSI datasets demonstrate that the designed network is extremely competitive compared to current advanced approaches, under the condition of insufficient samples.

Hyperspectral image (HSI) classification is an important technology for hyperspectral data analysis, which has the challenge of high dimensionality and limited training samples. Moreover, due to the spatial continuity of material distribution, it is reasonable to improve the performance of HSI classification from the local similarity viewpoint, i.e., pixels in the same local region have a high probability to share similar features. Therefore, in this paper, a novel method based on local similarity and kernel low-rank representation is proposed to improve the classification accuracy for HSI. First, taking into consideration that pixels in the same homogeneous region share similar spectral features (termed local similarity), the HSI is segmented by the superpixel segmentation algorithm to obtain the homogeneous regions. Then, a model of kernel low-rank representation based on local similarity (KLRRLS) is proposed for HSI classification. In the model of KLRRLS, the nonlinear structure characteristics of HSI are extracted by employing the kernel trick, and the low-rank constraint is used as a prior to restrict the recovery coefficient matrix in each segmentation region, thus efficiently solving the linear non-separable problem and exploiting the contextual information of HSI. Finally, the classification results are generated by fusing the result of each segmented map via the maximum voting mechanism. Experimental results on three real HSI datasets demonstrate that the proposed method can effectively improve the classification accuracy.

Hyperspectral image classification via nonlocal joint kernel sparse representation based on local covariance

Compressive sensing (CS) has been employed to compress and store hyperspectral images (HSI) to transfer extensive data efficiently, and obtaining high-quality reconstructed images is crucial for subsequent applications. Model-based methods usually capture the priors of HSI, including sparsity, global and nonlocal low-rankness, nonlocal self-similarity and global correlation. However, it is challenging to reasonably integrate different regularizations in a united framework and exploit various priors mentioned to reconstruct high-quality images. In this paper, a tensor optimization model based on the low-rank coefficient tensor and global prior (LRCTGP) is proposed for HSI reconstruction. Complementary regularization terms are integrated into a united framework and effectively promote the reconstruction results. First, we apply the mode- tensor-matrix product to decompose the original HSI rather than employing the regularization to capture the spectral low-rankness and simultaneously constrain the original and feature HSI. Then, tensor ring decomposition is employed to constrain the coefficient tensor with fewer bands, which is more efficient in the low-rank approximation and has smaller calculation costs than applying it to the original HSI. Moreover, integrating BM3D as a regularizer is more efficient than other patch-based models. Finally, considering the smoothness and global correlation, spatial-spectral total variation (SSTV) is applied to compensate for the shortcomings after decomposing the original and feature HSI, which complements the overall structure and details of reconstructed images and improves the reconstruction quality. Alternating direction method of multipliers (ADMM) is used to optimize the proposed model. Experimental results of the LRCTGP model on different HSI datasets are better than existing state-of-the-art approaches, which proves the superiority.

Deep learning methods, especially convolutional neural networks(CNN), have been widely used in hyperspectral image(HSI) classification. Recently, graph convolutional networks (GCN) have shown great potential in HSI classification problem. However, the existing GCN-based methods have several problems. First, the existing methods rely too much on the adjacency matrix, which cannot be changed during training. Furthermore, most of them can only use a single kind of feature, and fail to extract the spectral-spatial information from the HSI. Finally, for the existing GCN-based methods, it is difficult to achieve the same accuracy as the mature CNN methods. In this paper, we propose a spectral-spatial hypergraph convolutional neural network (S²HCN) for HSI classification. Compared with the existing GCN-based methods, S²HCN has the following advantages. Different from the adjacency matrix that is fixed during training of GCN, S²HCN can dynamically update the weight of the hyperedge during training, which reduces the reliance on prior information to a certain extent. In addition, S²HCN generates hyperedges from the spectral and spatial features independently, and adopts the incidence matrix composed of all hyperedges to replace the adjacency matrix in GCN. In this way, the spectral and spatial features can be better integrated. Finally, compared to a simple graph structure, the hypergraph structure can express the high-dimensional relationships in the data, which is beneficial to classification problems. Sufficient experiments on two popular HSI datasets have proved the effectiveness of S²HCN.

The hyperspectral image (HSI) classification applications become widespread in multiple applications. Therefore, the accurate classification of ground features using HSIs is an important research topic that has received a lot of interest. However, the conventional approaches failed to classify the pixels perfectly, which resulted in reduced accuracy. Thus, this work is focused on implementation of HSI classification using generative adversarial networks (HCGAN-Net). Initially, Gabor filtering is applied on HSIs for elimination of different types of noises, which also extracts the spatial features. Then, probabilistic principal component analysis (PCA) is applied to perform the dimensionality reduction operation, which also selects the best features using probability dependencies between spatial features. Then, spatial features are extracted for each spectral band and forms the hybrid spatial-spectral features. Finally, HCGAN-Net is used to performs the HSI classification operation using trained spatial-spectral features. The simulation results show that the proposed HCGAN-Net resulted in superior subjective and objective performance as compared to state of art HSI classifiers on various datasets.

A spatial-spectral metric learning (SSML) framework for hyperspectral image (HSI) classification is proposed. SSML learns a metric by considering both the spectral characteristics and spatial features represented as the mean of neighboring pixels. It first performs the local pixel neighborhood preserving embedding (LPNPE) to reduce the dimensionality of HSI and meanwhile to preserve the spatial local similarity structure. Then, it learns a spectral and spatial distance metric, separately. Finally, the combination of the spectral and spatial metrics yields a joint spatial-spectral metric. It is followed by a nearest neighbor (NN) classifier for HSI classification. SSML shows good performance over the spectral and spatial NN and SVM on the benchmark hyperspectral data set of Indian Pines.

Combining spectral and spatial information has been proven to be an effective way for hyperspectral image (HSI) classification. However, making full use of spectral-spatial information of HSI still remains an open problem, especially when only a small number of labeled samples are available. In this paper, a new spectral-spatial feature extraction method called locally homogeneous covariance matrix representation (LHCMR) is proposed for the fusion of spectral and spatial information. Specially, to make use of neighborhood homogeneity of land covers, original HSI is first segmented into many superpixels using our modified entropy rate superpixel segmentation. Then, to acquire the most similar pixels, we propose to construct neighborhoods of each pixel from the overlapping areas between the corresponding superpixels and the sliding window centered on it. Subsequently, covariance matrix representations (CMRs) of different pixels can be obtained. In the classification stage, we fed the obtained CMRs into SVM with Log-Euclidean-based kernel for classification. Compared to the traditional approach that utilizes neighboring information only within a fixed window, the proposed local homogeneity strategy can absorb more discriminative spectral-spatial features. Experimental results from a series of available HSI datasets show that our proposed method is superior to several state-of-the-art methods, especially when the training set is very limited.