Abstract

This paper presents a new approach, called band subset selection (BSS)-based hyperspectral anomaly detection (AD), which selects multiple bands simultaneously as a band subset rather than selecting multiple bands one at a time as the tradition band selection (BS) does, referred to as sequential multiple BS (SQMBS). Its idea is to first use virtual dimensionality (VD) to determine the number of multiple bands, $n_{\mathrm {BS}}$ needed to be selected as a band subset and then develop two iterative process, sequential BSS (SQ-BSS) algorithm and successive BSS (SC-BSS) algorithm to find an optimal band subset numerically among all possible $n_{\mathrm {BS}}$ combinations out of the full band set. In order to terminate the search process the averaged least-squares error (ALSE) and 3-D receiver operating characteristic (3D ROC) curves are used as stopping criteria to evaluate performance relative to AD using the full band set. Experimental results demonstrate that BSS generally performs better background suppression while maintaining target detection capability compared to target detection using full band information.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.