Beyond the Sparsity-Based Target Detector: A Hybrid Sparsity and Statistics-Based Detector for Hyperspectral Images

Abstract

Hyperspectral images provide great potential for target detection, however, new challenges are also introduced for hyperspectral target detection, resulting that hyperspectral target detection should be treated as a new problem and modeled differently. Many classical detectors are proposed based on the linear mixing model and the sparsity model. However, the former type of model cannot deal well with spectral variability in limited endmembers, and the latter type of model usually treats the target detection as a simple classification problem and pays less attention to the low target probability. In this case, can we find an efficient way to utilize both the high-dimension features behind hyperspectral images and the limited target information to extract small targets? This paper proposes a novel sparsity-based detector named the hybrid sparsity and statistics detector (HSSD) for target detection in hyperspectral imagery, which can effectively deal with the above two problems. The proposed algorithm designs a hypothesis-specific dictionary based on the prior hypotheses for the test pixel, which can avoid the imbalanced number of training samples for a class-specific dictionary. Then, a purification process is employed for the background training samples in order to construct an effective competition between the two hypotheses. Next, a sparse representation-based binary hypothesis model merged with additive Gaussian noise is proposed to represent the image. Finally, a generalized likelihood ratio test is performed to obtain a more robust detection decision than the reconstruction residual-based detection methods. Extensive experimental results with three hyperspectral data sets confirm that the proposed HSSD algorithm clearly outperforms the state-of-the-art target detectors.

Biologically Visual Perceptual Model and Discriminative Model for Road Markings Detection and Recognition

“…As for computational cost [25,26], time complexity [27,28] is an important criterion for evaluating algorithms in practical applications, which describes the speed of algorithms. Table 5 shows the comparison of the time cost of the hybrid model and other models.…”

Graph Laplacian for image anomaly detection

“…To address these issues, recent work has iterated over RXD's idea, e.g., by considering subspace features [22,62], by using kernels to go beyond the Gaussian assumption [21,41], by applying dimensionality reduction [33], by improving how the background statistics are estimated [20,50], or by exploiting sparsity and compress sensing theory [23,26,72]. In this work we generalize RXD's idea by looking at it from the point of view of spectral graph theory.…”

Joint Sparse and Low-Rank Multi-Task Learning with Extended Multi-Attribute Profile for Hyperspectral Target Detection

“…Target detection is an active area in the hyperspectral community, which focuses on distinguishing specific target pixels from various background pixels with a priori knowledge of target [2,4]. Due to its both civil and military use [5,6], target detection has been extensively applied in many HSI applications.…”