Abstract

Hyperspectral anomaly detection (HAD) as a special target detection can automatically locate anomaly objects whose spectral information are quite different from their surroundings, without any prior information about background and anomaly. In recent years, HAD methods based on the low rank representation (LRR) model have caught much attention, and achieved good results. However, LRR is a global structure model, which inevitably ignores the local geometrical information of hyperspectral image. Furthermore, most of these methods need to construct dictionaries with clustering algorithm in advance, and they are carried out stage by stage. In this paper, we introduce a locality constrained term inspired by manifold learning topreserve the local geometrical structure during the LRR process, and incorporate the dictionary learning into the optimization process of the LRR. Our proposed method is an one-stage algorithm, which can obtain the low rank representation coefficient matrix, the dictionary matrix, and the residual matrix referring to anomaly simultaneously. One simulated and three real hyperspectral images are used as test datasets. Three metrics, including the ROC curve, AUC value, and box plot, are used to evaluate the detection performance. The visualized results demonstrate convincingly that our method can not only detect anomalies accurately, but also suppress the background information and noises effectively. The three evaluation metrics also prove that our method is superior to other typical methods.

Highlights

  • As a 3D data cube, hyperspectral image (HSI) contains both spatial and spectral information

  • The low representation coefficient matrix, the dictionary matrix, and the residual matrix referring to anomaly will be obtained simultaneously

  • Unlike most of the existing Hyperspectral anomaly detection (HAD) algorithms based on low rank representation (LRR) model, our proposed method introduced a locality constrained LRR model to model the background and anomaly part

Read more

Summary

Introduction

As a 3D data cube, hyperspectral image (HSI) contains both spatial and spectral information. The sparse representation (SR)-based HAD method assumes that a background pixel can be linearly expressed by a dictionary with corresponding spare vector [18], but anomaly pixel can not. In [23], a low-rank and sparse matrix decomposition-based (LRaSMD) anomaly detection algorithm was proposed, in which the Go Decomposition algorithm [24] was used to decompose original HSI. It employed a sparse regularization term to constrain the representation coefficient matrix, and the dictionary was constructed by the clustering algorithm. We proposed a locality constrained low rank representation and automatic dictionary learning-based hyperspectral anomaly detector (LCLRR). We introduce an locality constrained low rank representation to model the background and anomaly part for the HSI. Our HAD method is a one-step algorithm, the representation coefficient matrix, dictionary matrix and anomaly matrix can be obtained simultaneously.

LRR for Hyperspectral Anomaly Detection
Locality Constrained LRR
Active Dictionary Learning for LRR
Optimization Procedure of LCLRR
HSI Dataset
Comparison Algorithm and Evaluation Metrics
Detection Performance
Background
Parameters Analyses and Discussion
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call