Dictionary Learning-Cooperated Matrix Decomposition for Hyperspectral Target Detection

Abstract

Hyperspectral target detection is one of the most challenging tasks in remote sensing due to limited spectral information. Many algorithms based on matrix decomposition (MD) are proposed to promote the separation of the background and targets, but they suffer from two problems: (1) Targets are detected with the criterion of reconstruction residuals, and the imbalanced number of background and target atoms in union dictionary may lead to misclassification of targets. (2) The detection results are susceptible to the quality of the apriori target spectra, thus obtaining inferior performance because of the inevitable spectral variability. In this paper, we propose a matrix decomposition-based detector named dictionary learning-cooperated matrix decomposition (DLcMD) for hyperspectral target detection. The procedure of DLcMD is two-fold. First, the low rank and sparse matrix decomposition (LRaSMD) is exploited to separate targets from the background due to its insensitivity to the imbalanced number of background and target atoms, which can reduce the misclassification of targets. Inspired by dictionary learning, the target atoms are updated during LRaSMD to alleviate the impact of spectral variability. After that, a binary hypothesis model specifically designed for LRaSMD is proposed, and a generalized likelihood ratio test (GLRT) is performed to obtain the final detection result. Experimental results on five datasets have shown the reliability of the proposed method. Especially in the Los Angeles-II dataset, the area under the curve (AUC) value is nearly 16% higher than the average value of the other seven detectors, which reveals the superiority of DLcMD in hyperspectral target detection.