Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Performance evaluation of hyperspectral detection algorithms for sub-pixel objects

Performance evaluation of hyperspectral detection algorithms for sub-pixel objects

Thumbnail Image
Download
Name

DiPietro-2010-Performance evaluation of hyperspectral detection algorithms for subpixel objects.pdf

Size

849.18 KB

Format

Adobe PDF

Checksum (MD5)

c36adb3f41ec6dd02586535b1c53b4bd

Author(s)
Manolakis, Dimitris G.
•
Lockwood, Ronald B.
•
DiPietro, R. S.
•
Cooley, T.
•
Jacobson, J.
Date Issued
April 2010
Journal
Proceedings of SPIE--the International Society for Optical Engineering; v.7695
Publisher
SPIE
Citation
R. S. DiPietro, D. Manolakis, R. Lockwood, T. Cooley and J. Jacobson, "Performance evaluation of hyperspectral detection algorithms for subpixel objects", Proc. SPIE 7695, 76951W (2010) © 2010 COPYRIGHT SPIE
Version
Final published version
Abstract
One of the fundamental challenges for a hyperspectral imaging surveillance system is the detection of sub-pixel objects in background clutter. The background surrounding the object, which acts as interference, provides the major obstacle to successful detection. Two additional limiting factors are the spectral variabilities of the background and the object to be detected. In this paper, we evaluate the performance of detection algorithms for sub-pixel objects using a replacement signal model, where the spectral variability is modeled by multivariate normal distributions. The detection algorithms considered are the classical matched filter, the matched filter with false alarm mitigation, the mixture tuned matched filter and the finite target matched filter. These algorithms are compared using simulated and actual hyperspectral imaging data.
MIT Department
Lincoln Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/60969
DOI of Published Version
https://doi.org/10.1117/12.850036
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.