Group-Aware Low-Rank Representation for Hyperspectral Image Classification

Accurate camouflage target distinction is often resorted to hyperspectral spectral imaging technique as for the rich spectral information contained in hyperspectral images. In this paper, a novel block-diagonal representation based camouflage target detection method is proposed for hyperspectral imagery. To better represent the multi-mode cluster background, an hyperspectral image is first clustered into different background clusters according to their spectral features. Then, an orthogonal background dictionary is learned for each cluster via a principle component analysis (PCA) learning scheme. The background and camouflage target often show different structures when projected onto those dictionaries. The former exhibits block-diagonal structure while the latter shows sparse structure. Inspired by this fact, we cast the block-diagonal structure into a low-rank representation model. With proper optimization of such model, the sparse camouflage targets can be accurately separated from the block-diagonal background. Experimental results on the real-world camouflage target datasets demonstrate that the proposed method outperforms the state-in-art hyperspectral camouflage target detection 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.

Band selection (BS) aims to choose a salient subset implied sufficient information from the numerous bands, which supplies a significantly efficient way to alleviate the barrier of dimensionality disaster for hyperspectral image classification (HSIC). This letter develops a semisupervised BS approach based on dual-constrained low-rank representation BS (DCLRR-BS) with two regularizations for HSIC. To be specific, a low-rank representation model is first proposed with super-pixel and imbalanced class-wise constraints, which are explicitly integrated to improve the performance of the band description. Next, the clusters are built adaptively based on graph theory in an unsupervised manner to rapid selection efficiency. A selection criterion is last designed to highlight the prominent band of each subset cluster to fulfill the BS procedure. Experimental results conducted on four types of classifiers with two real hyperspectral image (HSI) data sets demonstrate that the proposed DCLRR-BS method performs well in the imbalanced HSIC area.

The application of graph convolutional networks (GCN) in hyperspectral image (HSI) classification has become a promising method, thanks to its flexible convolution operation in any irregular image region. For the classification of HSI, GCN can extract more superpixel-level features with a topological structure, in comparison to the traditional convolutional neural networks (CNNs) using fixed square kernels distilling pixel-level features. To fully leverage the different levels of features, this study proposes a novel deep network referred to as a CNN-combined graph residual network ( C 2 GRN), which integrates the multilevel graph residual module and spectral-spatial features continuous learning module. During the extraction of topology information using the former module, HSI pixels are divided into superpixels and served as input nodes of the module to reduce the computational complexity and obtain the multilevel spatial relevance between adjacent superpixels. Besides, for the latter module, the spectral-spatial features are learnt continuously, which could obtain the finer pixel-level features. Finally, the captured spectral-spatial features of different levels are concatenated. This strategy could not only adequately utilize the correlation and difference of adjacent spatial but also obtain the finer and more valuable spectral-spatial information, which makes a significant boost in the HSI classification. Additionally, the experiment results demonstrate the superiority and availability of the C 2 GRN on three benchmark datasets of HSI, compared with the state-of-the-art methods for the classification of HSI.

Feature extraction (FE) methods based on low-rank representation (LRR) have become important topics in hyperspectral images (HSIs) data analysis. In this paper, a supervised FE method for HSIs data based on LRR with the ability to preserve the local pairwise constraints information (LRLPC) is proposed. LRLPC does not change the data dimensionality and only employs a technique to enrich the original feature space (OFS) and to obtain enriched feature space, which results in features richer than OFS. To overcome the problem of LRR in lacking the local structure information (LSI) of data, a local discriminative regularization term is imposed on the fitness function of LRR to keep the LSI of data. For nonlinear structure of data, LRLPC is extended to kernel LRLPC (KLRLPC) using kernel trick. Utilization of existing information in the pairwise constraints is useful for limited labeled samples situations as a common problem in HSI data analysis. The obtained experimental results using two well-known HSI data sets confirm the effectiveness of LRLPC and KLRLPC for dimension reduction and classification of HSIs.

This paper presents a novel method for anomaly detection in hyperspectral image(HSI) based on low-rank representation. In the observed HSI, the anomalies can be separated from the background. Since each pixel in the background can be approximately represented by a background dictionary, and the representation coefficients of the background pixels are correlative, a low-rank representation model is used to model the background part. Besides, to gain robust representation coefficient, the sum-to-one constraint is added. The advantage of the proposed low-rank representation sum-to-one (LRRSTO) method is that it makes use of the global correlation of the background and strength the robustness of the representation. Experiments results have been conducted using both simulated and real data sets. These experiments indicated that our algorithm achieves very promising performance.

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.

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.

ABSTRACTIn the area of hyperspectral image (HSI) classification, graph-based semi-supervised learning (SSL) has been proved to be highly effective. Constructing a proper graph is critical for graph-based SSL tasks. In HSI, spectral distance is widely used to calculate the weight of graph edge, though it can be influenced by noise and outliers. Meanwhile, links among all the data points are incorporated in the graph, including those from different subspaces. Thus the constructed graph might contain incorrect information. In this letter, a novel semi-supervised HSI classification method using local low-rank representation (SL2R) is proposed. Edge weight calculation will not be affected by noise or outliers thanks to the robustness of low-rank representation (LRR). Since each graph is constructed at local level, where pixels are basically embedded in the same subspace, links among uncorrelated pixels can be removed. Moreover, spatial context is naturally characterized by low-rank constraint on adjacent pixels. Experimental results on two data sets (Indian Pines and Botswana) confirm the effectiveness of the proposed method.

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.

Recently, low-rank representation (LRR) methods have been widely applied for hyperspectral anomaly detection, due to their potentials in separating the backgrounds and anomalies. However, existing LRR models generally convert 3-D hyperspectral images (HSIs) into 2-D matrices, inevitably leading to the destruction of intrinsic 3-D structure properties in HSIs. To this end, we propose a novel tensor low-rank and sparse representation (TLRSR) method for hyperspectral anomaly detection. A 3-D TLR model is expanded to separate the LR background part represented by a tensorial background dictionary and corresponding coefficients. This representation characterizes the multiple subspace property of the complex LR background. Based on the weighted tensor nuclear norm and the LF,1 sparse norm, a dictionary is designed to make its atoms more relevant to the background. Moreover, a principal component analysis (PCA) method can be assigned as one preprocessing step to exact a subset of HSI bands, retaining enough the HSI object information and reducing computational time of the postprocessing tensorial operations. The proposed model is efficiently solved by the well-designed alternating direction method of multipliers (ADMMs). A comparison with the existing algorithms via experiments establishes the competitiveness of the proposed method with the state-of-the-art competitors in the hyperspectral anomaly detection task.

Hyperspectral images (HSIs) own inherent complexity, so, clustering for HSIs is a very challenging task. In this paper, we utilized a semi-supervised subspace clustering method based on non-negative low-rank representation (NNLRR) algorithm for HSI clustering. Firstly, NNLRR used Gaussian fields and harmonic functions into the low-rank representation (LRR) model. Secondly, NNLRR guided the affinity matrix construction by the supervision information. Next, finding a non-negative low-rank matrix, the matrix represents each sample by some other linear combination points, and the affinity matrix is obtained by the matrix. Then, accomplishing the affinity matrix construction and subspace clustering simultaneously. Thanks for the unification of the two steps, we can guarantee the overall optimum. Experimental results on classical data set show that, the algorithm is effective for hyperspectral image clustering.

Most hyperspectral image (HSI) classification methods assume that all classes in the test set are present during training. However, in real-world applications, acquiring labeled training samples is challenging. As a result, it is difficult for the training dataset to cover all possible land cover types, leading to the generalized zero-shot learning (GZSL) problem. Recently, vision-language models (VLMs) have provided rich semantic priors for land cover classes, offering promising potential for GZSL. However, two fundamental gaps hinder their application to HSI classification: the task paradigm gap, arising from the difference between image-level VLMs and the pixel-level HSI classification task; and the knowledge gap, due to the inconsistency between VLM features and HSI spectral–spatial representations. To bridge both gaps, a novel framework leveraging VLM semantic priors for GZSL in HSI classification is proposed, primarily using pseudo-labeling technique to provide knowledge for unseen classes. Specifically, a pseudo-label generation and enhancement module enables a paradigm transition from image-level understanding to pixel-level classification by incorporating HSI’s spatial information. A pseudo-label correction module then refines noisy labels using spectral cues to address the knowledge gap. Finally, a global learning strategy integrates pseudo-label distillation, supervised learning, and feature regularization to classify seen classes while enabling generalization to unseen ones. Experiments on benchmark HSI datasets demonstrate the proposed method’s superiority in generalized zero-shot classification. This work highlights the potential of VLMs in advancing HSI classification in practical applications.

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.

In recent years, representation-based methods have attracted more attention in the hyperspectral image (HSI) classification. Among them, sparse representation-based classifier (SRC) and collaborative representation-based classifier (CRC) are the two representative methods. However, SRC only focuses on sparsity but ignores the data correlation information. While CRC encourages grouping correlated variables together but lacks the ability of variable selection. As a result, SRC and CRC are incapable of producing satisfied performance. To address these issues, in this work, a correlation adaptive representation (CAR) is proposed, enabling a CAR-based classifier (CARC). Specifically, the proposed CARC is able to explore sparsity and data correlation information jointly, generating a novel representation model that is adaptive to the structure of the dictionary. To further exploit the correlation between the test samples and the training samples effectively, a distance-weighted Tikhonov regularization is integrated into the proposed CARC. Furthermore, to handle the small training sample problem in the HSI classification, a multi-feature correlation adaptive representation-based classifier (MFCARC) and MFCARC with Tikhonov regularization (MFCART) are presented to improve the classification performance by exploring the complementary information across multiple features. The experimental results show the superiority of the proposed methods over state-of-the-art algorithms.