NEW METHODS OF SPECTRAL-DENSITY BASED GRAPH CONSTRUCTION AND THEIR APPLICATION TO HYPERSPECTRAL IMAGE ANALYSIS

Simple item page
dc.contributor.advisorQu, John J
dc.contributor.authorStevens, Jeff
dc.creatorStevens, Jeff
dc.date.accessioned2018-10-22T01:19:53Z
dc.date.available2018-10-22T01:19:53Z
dc.date.issued2017
dc.description.abstractThe past decade has seen the emergence of many hyperspectral image (HSI) analysis algorithms based on graph theory and derived manifold-coordinates. Yet, despite the growing number of algorithms, there has been limited study of the graphs constructed from spectral data themselves. Which graphs are appropriate for various HSI analyses—and why? This research aims to begin addressing these questions as the performance of graph-based techniques is inextricably tied to the graphical model constructed from the spectral data. We begin with a literature review providing a survey of spectral graph construction techniques currently used by the hyperspectral community, starting with simple constructs demonstrating basic concepts and then incrementally adding components to derive more complex approaches. Throughout this development, we discuss algorithm advantages and disadvantages for different types of hyperspectral analysis. A focus is provided on techniques influenced by spectral density through which the concept of community structure arises. Through the use of simulated and real HSI data, we demonstrate density-based edge allocation produces more uniform nearest neighbor lists than non-density based techniques through increasing the number of intracluster edges, facilitating higher k-nearest neighbor (k-NN) classification performance. Imposing the common mutuality constraint to symmetrify adjacency matrices is demonstrated to be beneficial in most circumstances, especially in rural (less cluttered) scenes. Many complex adaptive edge-reweighting techniques are shown to slightly degrade nearest-neighbor list characteristics. Analysis suggests this condition is possibly attributable to the validity of characterizing spectral density by a single variable representing data scale for each pixel. Additionally, it is shown that imposing mutuality hurts the performance of adaptive edge-allocation techniques or any technique that aims to assign a low number of edges (<10) to any pixel. A simple k bias addresses this problem.
dc.format.extent229 pages
dc.identifier.urihttps://hdl.handle.net/1920/11274
dc.language.isoen
dc.rightsCopyright 2017 Jeff Stevens
dc.subjectRemote sensing
dc.subjectComputer science
dc.subjectConcertation of Measure
dc.subjectGraph Theory
dc.subjectHubness
dc.subjectHyperspectral Imaging
dc.subjectImaging Spectroscopy
dc.subjectSpectral graph construction
dc.titleNEW METHODS OF SPECTRAL-DENSITY BASED GRAPH CONSTRUCTION AND THEIR APPLICATION TO HYPERSPECTRAL IMAGE ANALYSIS
dc.typeDissertation
thesis.degree.disciplineComputational Sciences and Informatics
thesis.degree.grantorGeorge Mason University
thesis.degree.levelPh.D.

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Stevens_gmu_0883E_11602.pdf
Size:
12.76 MB
Format:
Adobe Portable Document Format
Download

Collections

College of Science