A Comparative Analysis of Kernel Subspace Target Detectors for Hyperspectral Imagery
<p/> <p>Several linear and nonlinear detection algorithms that are based on spectral matched (subspace) filters are compared. Nonlinear (<it>kernel</it>) versions of these spectral matched detectors are also given and their performance is compared with linear versions. Severa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2007-01-01
|
| Series: | EURASIP Journal on Advances in Signal Processing |
| Online Access: | http://asp.eurasipjournals.com/content/2007/029250 |
| Summary: | <p/> <p>Several linear and nonlinear detection algorithms that are based on spectral matched (subspace) filters are compared. Nonlinear (<it>kernel</it>) versions of these spectral matched detectors are also given and their performance is compared with linear versions. Several well-known matched detectors such as matched subspace detector, orthogonal subspace detector, spectral matched filter, and adaptive subspace detector are extended to their corresponding kernel versions by using the idea of kernel-based learning theory. In kernel-based detection algorithms the data is assumed to be implicitly mapped into a high-dimensional kernel feature space by a nonlinear mapping, which is associated with a kernel function. The expression for each detection algorithm is then derived in the feature space, which is <it>kernelized</it> in terms of the kernel functions in order to avoid explicit computation in the high-dimensional feature space. Experimental results based on simulated toy examples and real hyperspectral imagery show that the kernel versions of these detectors outperform the conventional linear detectors.</p> |
|---|---|
| ISSN: | 1687-6172 1687-6180 |