Hyperspectral Anomaly Detection Using Collaborative Representation With Outlier Removal

Anomaly detection is one of the most important applications of hyperspectral imagery. In this paper, we propose a hyperspectral image anomaly detection method using collaborative representation detector with PCA remove outlier (PCAroCRD). The algorithm has two versions: global and local. In the collaborative representation detection (CRD) algorithm, if the test pixel is an anomalous pixel and several samples from background are also anomalous and similar to test pixel, then the judge error is likely to happen. In the proposed algorithm, PCA is adopted to extract main pixels information and remove abnormal pixels from background so as to obtain higher detection accuracy before estimating the samples. Experimental results indicate that the proposed algorithm outperforms the original collaborative representation detector (CRD), kernel version of CRD (KCRD), advanced CRD (CRDBORAD), and the traditional detection methods such as Global Reed-Xiaoli (RX) algorithm and the Local RX.

Whether or not a hyperspectral anomaly detector is effective is determined by two crucial issues, anomaly detectability and background suppressibility (BS), both of which are very closely related to two factors, the datasets used for a selected hyperspectral anomaly detector and detection measures used for its performance evaluation. This paper explores how anomaly detectability and BS play key roles in hyperspectral anomaly detection (HAD). To address these two issues, we investigate three key elements attributed to HAD. One is a selected hyperspectral anomaly detector, and another is the datasets used for experiments. The third one is the detection measures used to evaluate the effectiveness of a hyperspectral anomaly detector. As for hyperspectral anomaly detectors, twelve commonly used anomaly detectors were evaluated and compared. To address the appropriate use of datasets for HAD, seven popular and widely used datasets were studied for HAD. As for the third issue, the traditional area under a receiver operating characteristic (ROC) curve of detection probability—PD versus false alarm probability, PF, (AUC(D,F))—was extended to 3D ROC analysis where a 3D ROC curve was developed to generate three 2D ROC curves from which eight detection measures could be derived to evaluate HAD in all round aspects, including anomaly detectability, BS and joint anomaly detectability and BS. Qualitative analysis showed that many works reported in the literature which claimed that their developed hyperspectral anomaly detectors performed better than other anomaly detectors are actually not true because they overlooked these two issues. Specifically, a comprehensive study via extensive experiments demonstrated that these 3D ROC curve-derived detection measures can be further used to address the various characterizations of different data scenes and also to provide explanations as to why certain data scenes are not suitable for HAD.

Anomaly detection in Hyperspectral Imagery (HSI) has received considerable attention because of its potential application in several areas. Numerous anomaly detection algorithms for HSI have been proposed in the literature; however, due to the use of different datasets in previous studies, an extensive performance comparison of these algorithms is missing. In this paper, an overview of the current state of research in hyperspectral anomaly detection is presented by broadly dividing all the previously proposed algorithms into eight different categories. In addition, this paper presents the most comprehensive comparative analysis to-date in hyperspectral anomaly detection by evaluating 22 algorithms on 17 different publicly available datasets. Results indicate that attribute and edge-preserving filtering-based detection (AED), local summation anomaly detection based on collaborative representation and inverse distance weight (LSAD-CR-IDW) and local summation unsupervised nearest regularized subspace with an outlier removal anomaly detector (LSUNRSORAD) perform better as indicated by the mean and median values of area under the receiver operating characteristic (ROC) curves. Finally, this paper studies the effect of various dimensionality reduction techniques on anomaly detection. Results indicate that reducing the number of components to around 20 improves the performance; however, any further decrease deteriorates the performance.

Hyperspectral imagery systems have the ability to collect 3D digital images with rich spatial and spectral information. Anomaly detection is one of the interesting applications over last two decades in hyperspectral imagery. In this paper, we propose Collaborative Representation-Based with Outlier Removal Anomaly Detector (CRBORAD) method for HSI Anomaly Detection. We use both spectral and spatial information for detecting anomalies instead of using only spectral information that was introduced in our previous work. The proposed detector can adaptively estimate the background by its adjacent pixels within a sliding dual window. Before estimating background pixels, we remove outlier pixels that are significantly different from majority of pixels. It leads us to precise background approximation and better accuracy for detecting anomalies in subsequent stages. The residual image is constituted by subtracting the predicted background from the original HSI, and anomalies can be determined in the residual image, finally. Kernel extension of the proposed approach is also presented. We implemented the proposed algorithms on San Diego airport hyperspectral data. CRBORAD results are illustrated using receiver-operating-characteristic (ROC) curves, Area Under Curve (AUC) values and intuitive images. Comparing the results of the current study with four popular and previous methods shows that CRBORAD provides us an accurate method for detecting anomalies.

In this paper, collaborative representation is proposed for anomaly detection in hyperspectral imagery. The algorithm is directly based on the concept that each pixel in background can be approximately represented by its spatial neighborhoods, while anomalies cannot. The representation is assumed to be the linear combination of neighboring pixels, and the collaboration of representation is reinforced by l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> -norm minimization of the representation weight vector. To adjust the contribution of each neighboring pixel, a distance-weighted regularization matrix is included in the optimization problem, which has a simple and closed-form solution. By imposing the sum-to-one constraint to the weight vector, the stability of the solution can be enhanced. The major advantage of the proposed algorithm is the capability of adaptively modeling the background even when anomalous pixels are involved. A kernel extension of the proposed approach is also studied. Experimental results indicate that our proposed detector may outperform the traditional detection methods such as the classic Reed-Xiaoli (RX) algorithm, the kernel RX algorithm, and the state-of-the-art robust principal component analysis based and sparse-representation-based anomaly detectors, with low computational cost.

Collaborative representation-based detector (CRD), as the most representative anomaly detection method, has been widely applied in the field of hyperspectral anomaly detection (HAD). However, the sliding dual window of the original CRD introduces high computational complexity. Moreover, most HAD models only consider a single spectral or spatial feature of the hyperspectral image (HSI), which is unhelpful for improving detection accuracy. To solve these problems, in terms of speed and accuracy, we propose a novel anomaly detection approach, named Random Collective Representation-based Detector with Multiple Feature (RCRDMF). This method includes the following steps. This method first extract the different features include spectral feature, Gabor feature, extended multiattribute profile (EMAP) feature, and extended morphological profile (EMP) feature matrix from the HSI image, which enables us to improve the accuracy of HAD by combining the multiple spectral and spatial features. The ensemble and random collaborative representation detector (ERCRD) method is then applied, which can improve the anomaly detection speed. Finally, an adaptive weight approach is proposed to calculate the weight for each feature. Experimental results on six hyperspectral datasets demonstrate that the proposed approach has the superiority over accuracy and speed.

Hyperspectral anomaly detection (HAD) remains a challenging task due to the complex spectral variability and spatial heterogeneity of real-world scenes. Reconstruction-based methods have been widely explored for deep learning-based HAD, but they rely on the assumption that background pixels can be faithfully reconstructed while anomalous pixels cannot. Although intuitive, this dichotomy oversimplifies the spectral–spatial characteristics of hyperspectral data and often fails in practice. In particular, when background regions exhibit strong variability or when anomalies share spectral similarities with their surroundings, reconstruction-based methods tend to generate false alarms and suffer from limited robustness. To overcome these limitations, this paper moves beyond the reconstruction-based paradigm and proposes HTDC, a novel hyperbolic Transformer with dual-momentum contrastive learning framework, which shifts the focus from background reconstruction to discriminative representation learning at both global and local levels. Firstly, a custom-designed multi-view data augmentation module generates complementary views from different perspectives, enriching spectral diversity and alleviating the limitations of contrastive learning under homogeneous samples. Secondly, a hyperbolic Transformer encoder exploits the hierarchical and structured nature of hyperspectral data, where hyperbolic geometry enables more effective attention aggregation than Euclidean space. Subsequently, a dual-momentum mechanism with dual temporal queues further stabilizes global learning while dynamically adapting to local changes, thereby mitigating sensitivity to class imbalance and spectral drift. Finally, in the detection stage, a sliding dual-window detection strategy with exponential mapping and guided filtering is employed to suppress background interference and enhance spatial contrast. Extensive experiments on multiple real hyperspectral images acquired by different sensors across various scenes demonstrate that the proposed HTDC consistently outperforms the state-of-the-art methods in HAD tasks.

Although hyperspectral anomaly detection is commonly conducted in the visible, near-infrared, and shortwave infrared spectral regions, there has been less research on hyperspectral anomaly detection in the longwave infrared (LWIR) hyperspectral region. The radiance of thermal infrared hyperspectral imagery is determined by the temperature and emissivity. To avoid the detection uncertainty caused by the single factor of temperature, emissivity can be introduced to detect anomalies. However, in the emissivity domain, the spectral contrast and signal-to-noise ratio (SNR) are low, which makes it difficult to separate the anomalies from the background. In this paper, an anomaly detection method combining emissivity and a segmented low-rank prior (EaSLRP) is proposed for use with thermal infrared hyperspectral imagery. The EaSLRP method is divided into three parts—1) temperature/emissivity retrieval, 2) extraction of the thermal infrared hyperspectral background information, and 3) Mahalanobis distance detection. A homogeneous region generation method is also proposed to solve the problem of the complex global background leading to inaccurate background estimation. The GoDec method is used for matrix decomposition and background information extraction and to remove some of the noise. The proposed Mahalanobis distance detector then uses the background component and original image for anomaly detection, while highlighting the spectral difference between the anomalies and background. This method can also suppress the influence of noise, to some extent. The experimental results obtained with airborne Fourier transform thermal infrared spectrometer hyperspectral images demonstrate that the EaSLRP method is effective when compared with the Reed–Xiaoli detector (RXD), the segmented RX detector (SegRX), the low-rank and sparse representation-based detector (LRASR), the low-rank and sparse matrix decomposition (LRaSMD)-based Mahalanobis distance method (LSMAD), and the locally enhanced low-rank prior method (LELRP-AD).

Anomaly detection in hyperspectral imaging is crucial for remote sensing, driving the development of numerous algorithms. However, systematic studies reveal a dichotomy where algorithms generally excel at either detecting anomalies in specific datasets or generalizing across heterogeneous datasets (i.e., lack adaptability). A key source of this dichotomy may center on the singular and like biases frequently employed by existing algorithms. Current research lacks experimentation into how integrating insights from diverse biases might counteract problems in singularly biased approaches. Addressing this gap, we propose stacking-based ensemble learning for hyperspectral anomaly detection (SELHAD). SELHAD introduces the integration of hyperspectral anomaly detection algorithms with diverse biases (e.g., Gaussian, density, partition) into a singular ensemble learning model and learns the factor to which each bias should contribute so anomaly detection performance is optimized. Additionally, it introduces bootstrapping strategies into hyperspectral anomaly detection algorithms to further increase robustness. We focused on five representative algorithms embodying common biases in hyperspectral anomaly detection and demonstrated how they result in the previously highlighted dichotomy. Subsequently, we demonstrated how SELHAD learns the interplay between these biases, enabling their collaborative utilization. In doing so, SELHAD transcends the limitations inherent in individual biases, thereby alleviating the dichotomy and advancing toward more adaptable solutions.

Lately, generative adversarial networks (GAN)-based methods have drawn extensive attention and achieved a promising performance in the field of hyperspectral anomaly detection (HAD) owing to GAN’s powerful data generation capability. However, without considering the background spatial features, most of these methods can not obtain a GAN with a strong background generation ability. Besides, they fail to address the hyperspectral image (HSI) redundant information disturbance problem in the anomaly detection part. To solve these issues, the unsupervised generative adversarial network with background spatial feature enhancement and irredundant pooling (BEGAIP) is proposed for HAD. To make better use of features, spatial and spectral features union extraction idea is also applied to the proposed model. To be specific, in spatial branch, a new background spatial feature enhancement way is proposed to get a data set containing relatively pure background information to train GAN and reconstruct a more vivid background image. In a spectral branch, irredundant pooling (IP) is invented to remove redundant information, which can also enhance the background spectral feature. Finally, the features obtained from the spectral and spatial branch are combined for HAD. The experimental results conducted on several HSI data sets display that the model proposed acquire a better performance than other relevant algorithms.

The Reed–Xiaoli (RX) algorithm has been widely used as an anomaly detector for hyperspectral images. Recently, kernel RX (KRX) has been proven to yield high performance in anomaly detection and change detection. In this paper, we present a generalization of the KRX algorithm. The novel algorithm is called cluster KRX (CKRX), which becomes KRX under certain conditions. The key idea is to group background pixels into clusters and then apply a fast eigendecomposition algorithm to generate the anomaly detection index. Both global and local versions of CKRX have been implemented. Application to anomaly detection using actual hyperspectral images is included. In addition to anomaly detection, the CKRX algorithm has been integrated with other prediction algorithms for change detection. Spatially registered visible and near-infrared hyperspectral images collected from a tower-based geometry have been used in the anomaly and change detection studies. Receiver operating characteristics curves and actual computation times were used to compare different algorithms. It was demonstrated that CKRX has comparable detection performance as KRX, but with much lower computational requirements.

Hyperspectral anomaly detection (HAD) aims to separate subtle anomalies of a given hyperspectral image (HSI) from its background, which is a hot topic as well as a challenging inverse problem. Despite the significant success of the deep learning-based HAD methods, they are hard to interpret due to their black-box nature. Meanwhile, deep learning methods suffer from the identity mapping (IM) problem, referring to the network excessively focusing on the precise reconstruction of the background while neglecting the appropriate representation of anomalies. To this end, this paper proposes a self-attention-aided deep unfolding tensor representation network (SATRNet) for interpretable HAD by solving the tensor representation (TR)-based optimization model within the framework of deep networks. In particular, a Self-Attention Learning Module (SALM) was first designed to extract discriminative features of the input HSI. The HAD problem was then formulated as a tensor representation problem by exploring both the low-rankness of the background and the sparsity of the anomaly. A Weight Learning Module (WLM) exploring local details was also generated for precise background reconstruction. Finally, a deep network was built to solve the TR-based problem through unfolding and parameterizing the iterative optimization algorithm. The proposed SATRNet prevents the network from learning meaningless mappings, making the network interpretable to some extent while essentially solving the IM problem. The effectiveness of the proposed SATRNet is validated on 11 benchmark HSI datasets. Notably, the performance of SATRNet against adversarial attacks is also investigated in the experimentation, which is the first work exploring adversarial robustness in HAD to the best of our knowledge.

Sparse representation-based background modeling facilitates much recent progress in hyperspectral anomaly detection (AD). The sparse representation of background often exhibits underlying structure, which is crucial to distinguish between background and anomaly. However, how to exploit such underlying structure is still challenging. To address this problem, we present a novel hyperspectral AD method, which can exploit the structured sparsity in modeling the background more accurately. With the plausible background area detected by a local RX detector, a robust background spectrum dictionary is learned in a principal component analysis way. A reweighted Laplace prior-based structured sparse representation model is then employed to reconstruct the spectrum of each pixel. With considering the structured sparsity in representation, the background pixels can be reconstructed more accurately than the anomaly ones, which thus can be detected based on the reconstruction error. To further improve the detection performance, an intracluster reconstruction model is developed to exploit the spatial similarity among the background pixels in the same cluster. The anomaly pixels can then be detected based on the cost of intracluster reconstruction error. By linearly combining these two detection results, improvement is obviously achieved on detection accuracy. Experimental results on both simulated and real-world data sets demonstrate that the proposed method outperforms several state-of-the-art hyperspectral AD methods.

The low rank and sparse representation (LRSR) technique has attracted increasing attention for hyperspectral anomaly detection (HAD). Although a large quantity of research based on LRSR for HAD is proposed, the detection performance is still limited, due to the unsatisfactory dictionary construction and insufficient consideration of global and local characteristics. To tackle the above-mentioned concern, a novel HAD method, termed dual collaborative constraints regularized low-rank and sparse representation via robust dictionaries construction, is proposed in this article. Concretely, a robust dictionary construction strategy, which thoroughly excavates the potential of the density estimation model and local outlier factor, is proposed to yield pure and representative dictionary atoms. To fully exploit the global and local characteristics of hyperspectral images, dual collaborative constraints corresponding to the background and anomaly components are imposed on the LRSR model. Notably, two weighted matrices are further exerted on the representation coefficients to improve the effect of collaborative constraints, considering the fact that the surrounding pixels similar to the testing pixel should be given a large weight, otherwise the weight is expected to be small. In this way, the background and anomaly components can be well modeled. Additionally, a nonlinear transformation operation, which combines the output of the density estimation model and local outlier factor with the detection result derived from the LRSR model, is developed to suppress the background. The experiments conducted on one simulated dataset and three real datasets demonstrate the superiority of the proposed method compared with the four typical methods and four state-of-the-art methods.

Hyperspectral anomaly detection (HAD) is a challenging task since it identifies the anomaly targets without prior knowledge. In recent years, deep learning methods have emerged as one of the most popular algorithms in the HAD. These methods operate on the assumption that the background is well reconstructed while anomalies cannot, and the degree of anomaly for each pixel is represented by reconstruction errors. However, most approaches treat all background pixels of a hyperspectral image (HSI) as one type of ground object. This assumption does not always hold in practical scenes, making it difficult to distinguish between backgrounds and anomalies effectively. To address this issue, a novel deep feature aggregation network (DFAN) is proposed in this paper, and it develops a new paradigm for HAD to represent multiple patterns of backgrounds. The DFAN adopts an adaptive aggregation model, which combines the orthogonal spectral attention module with the background-anomaly category statistics module. This allows effective utilization of spectral and spatial information to capture the distribution of the background and anomaly. To optimize the proposed DFAN better, a novel multiple aggregation separation loss is designed, and it is based on the intra-similarity and inter-difference from the background and anomaly. The constraint function reduces the potential anomaly representation and strengthens the potential background representation. Additionally, the extensive experiments on the six real hyperspectral datasets demonstrate that the proposed DFAN achieves superior performance for HAD. The code is available at https://github.com/ChengXi-1217/DFAN-HAD.