Simplex ACE: a constrained subspace detector

被引:13
|
作者
Ziemann, Amanda [1 ]
Theiler, James [1 ]
机构
[1] Los Alamos Natl Lab, Intelligence & Space Res Div, Space Data Sci & Syst Grp, Los Alamos, NM 87545 USA
关键词
hyperspectral; target detection; simplex detectors; subspace detectors; adaptive cosine estimator; matched filter; ALGORITHM; PLUMES;
D O I
10.1117/1.OE.56.8.081808
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
In hyperspectral target detection, one must contend with variability in both target materials and background clutter. While most algorithms focus on the background clutter, there are some materials for which there is substantial variability in the signatures of the target. When multiple signatures can be used to describe a target material, subspace detectors are often the detection algorithm of choice. However, as the number of variable target spectra increases, so does the size of the target subspace spanned by these spectra, which in turn increases the number of false alarms. Here, we propose a modification to this approach, wherein the target subspace is instead a constrained subspace, or a simplex without the sum-to-one constraint. We derive the simplex adaptive matched filter (simplex AMF) and the simplex adaptive cosine estimator (simplex ACE), which are constrained basis adaptations of the traditional subspace AMF and subspace ACE detectors. We present results using simplex AMF and simplex ACE for variable targets, and compare their performances against their subspace counterparts. Our primary interest is in the simplex ACE detector, and as such, the experiments herein seek to evaluate the robustness of simplex ACE, with simplex AMF included for comparison. Results are shown on hyperspectral images using both implanted and ground-truthed targets, and demonstrate the robustness of simplex ACE to target variability. (C) 2017 Society of Photo-Optical Instrumentation Engineers (SPIE)
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Performance comparison between orthogonal subspace projection and the constrained signal detector
    Johnson, Steven
    OPTICAL ENGINEERING, 2007, 46 (06)
  • [2] Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
    Hankui Peng
    Nicos G. Pavlidis
    Data Mining and Knowledge Discovery, 2022, 36 : 958 - 986
  • [3] Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
    Peng, Hankui
    Pavlidis, Nicos G.
    DATA MINING AND KNOWLEDGE DISCOVERY, 2022, 36 (03) : 958 - 986
  • [4] Constrained subspace modelling
    Vermaak, J
    Pérez, P
    2003 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL II, PROCEEDINGS, 2003, : 106 - 113
  • [5] A Subspace Constrained LSCM Algorithm
    Zhao Lijuan
    Feng Guangzeng
    2008 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEM, 2008, : 250 - 254
  • [6] ATTRIBUTE CONSTRAINED SUBSPACE LEARNING
    Babaee, Mohammadreza
    Babaei, Maryam
    Merget, Daniel
    Tiefenbacher, Philipp
    Rigoll, Gerhard
    2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2015, : 3941 - 3945
  • [7] Scaled Simplex Representation for Subspace Clustering
    Xu, Jun
    Yu, Mengyang
    Shao, Ling
    Zuo, Wangmeng
    Meng, Deyu
    Zhang, Lei
    Zhang, David
    IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (03) : 1493 - 1505
  • [8] Locality-constrained double-layer structure scaled simplex multi-view subspace clustering
    Liu, Zhengyan
    Wang, Huiwen
    Wang, Lihong
    Wang, Shanshan
    VISUAL COMPUTER, 2024,
  • [9] Matched symmetrical subspace detector
    Golikov, VS
    Pareja, FC
    PROCEEDINGS OF THE TENTH IEEE WORKSHOP ON STATISTICAL SIGNAL AND ARRAY PROCESSING, 2000, : 83 - 85
  • [10] Matched symmetrical subspace detector
    Golikov, Victor S.
    Pareja, Francisco C.
    IEEE Signal Processing Workshop on Statistical Signal and Array Processing, SSAP, 2000, : 83 - 85