Kernel-Based Spectral Matched Signal Detectors for Hyperspectral Target Detection
In this paper, we compare several detection algorithms that are based on spectral matched (subspace) filters. Nonlinear (kernel) versions of these spectral matched (subspace) detectors are also discussed and their performance is compared with the linear versions. Several well-known matched detectors, such as matched subspace detector, orthogonal subspace detector, spectral matched filter and adaptive subspace detector (adaptive cosine estimator) are extended to their corresponding kernel versions by using the idea of kernel-based learning theory. In kernel-based detection algorithms the data is implicitly mapped into a high dimensional kernel feature space by a nonlinear mapping which is associated with a kernel function. The detection algorithm is then derived in the feature space which is kernelized in terms of the kernel functions in order to avoid explicit computation in the high dimensional feature space. Experimental results based on real hyperspectral imagery show that the kernel versions of these detectors outperform the conventional linear detectors.