Abstract

The topological anomaly detection (TAD) algorithm differs from other anomaly detection algorithms in that it does not rely on the data's being normally distributed. We have built on this advantage of TAD by extending the algorithm so that it gives a measure of the number of anomalous objects, rather than the number of anomalous pixels, in a hyperspectral image. We have done this by identifying and integrating clusters of anomalous pixels, which we accomplished with a graph-theoretical method that combines spatial and spectral information. By applying our method, the Anomaly Clustering algorithm, to hyperspectral images, we have found that our method integrates small clusters of anomalous pixels, such as those corresponding to rooftops, into single anomalies; this improves visualization and interpretation of objects. We have also performed a local linear embedding (LLE) analysis of the TAD results to illustrate its application as a means of grouping anomalies together. By performing the LLE algorithm on just the anomalies identified by the TAD algorithm, we drastically reduce the amount of computation needed for the computationally-heavy LLE algorithm. We also propose an application of a shifted QR algorithm to improve the speed of the LLE algorithm.

Library of Congress Subject Headings

Remote sensing--Data processing; Image processing--Digital techniques; Multispectral photography--Data processing; Spectrum analysis; Computer algorithms

Publication Date

5-20-2009

Document Type

Thesis

Department, Program, or Center

School of Mathematical Sciences (COS)

Advisor

Ross, David

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: TA1637 .D674 2009

Campus

RIT – Main Campus

Download

Share

COinS