ITERATIVE ANOMALY DETECTION

Anomaly detection (AD) is designed to find targets that are spectrally distinct from their surrounding neighborhood. Unfortunately, commonly used anomaly detectors generally do not take into account its surrounding spatial information. This paper derives an iterative version of anomaly detection, iterative anomaly detection (IAD) to address this issue. Its idea is to use a Gaussian filter to capture spatial information of the anomaly detection map and then feeds back the Gaussian filtered AD map to create a new data cube. The whole process is repeated over again in an iterative manner. When IAD is terminated anomaly representatives are identified and can be used as desired target signatures to implement constrain energy minimization (CEM) so as to classify all detected anomalies. Accordingly, IAD can be considered as anomaly classification.