Sparse and low-rank matrix decomposition-based method for hyperspectral anomaly detection

A sparse and low-rank matrix decomposition-based method is proposed for anomaly detection in hyperspectral data. High-dimensional data are decomposed into low-rank and sparse matrices representing background and anomalies, respectively. The problem of the decomposition process is defined from the dictionary learning point of view. Therefore, our way of obtaining these matrices differs from previous studies. It aims to find a correct partition of the data and separate anomaly pixels from the background. After decomposition, Mahalanobis distance is applied to the sparse part of the data to get anomaly locations. Three hyperspectral data sets are used for evaluation. Experimental results suggest that anomaly detection performance of the proposed method surpasses those of the state-of-the-art methods.