Adaptive matched subspace detectors for hyperspectral imaging applications
Authors:
- C. SiracusaCSC. Siracusa
- G. ShawGSG. Shaw
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (15206149) , 3153-3156
Abstract
Real-time detection and identification of man-made objects or materials ("targets") from airborne platforms using hyperspectral sensors are of great interest for civilian and military applications. Over the past several years, different algorithms for the detection of targets with known spectral signature have been developed. Most of these algorithms have been reviewed by Manolakis, Shaw and Keshava (see Algorithms for Multispectral and Hyperspectral Imagery, Orlando, FL, April 2000, SPIE) within a unified theoretical and notational framework. In this paper we study adaptive matched subspace detection algorithms for low probability, single-pixel or subpixel targets. These algorithms explore the linear mixing model to both specify the desired target and characterize the interfering background. The derived algorithms are theoretically and experimentally evaluated with regard to two desirable properties: capacity to operate in constant false alarm rate (CFAR) mode and target "visibility" enhancement. Furthermore, an approach is presented for taking into account target variability, when present, to improve detection.Keywords
This publication has 4 references indexed in Scilit:
- Comparative analysis of hyperspectral adaptive matched filter detectors2000
- Discrimination of poorly exposed lithologies in imaging spectrometer dataJournal of Geophysical Research, 1995
- Hyperspectral image classification and dimensionality reduction: an orthogonal subspace projection approachIEEE Transactions on Geoscience and Remote Sensing, 1994
- Matched subspace detectorsIEEE Transactions on Signal Processing, 1994