29 March 2012 Metrics of spectral image complexity with application to large area search
Author Affiliations +
Abstract
Spectral image complexity is an ill-defined term that has been addressed previously in terms of dimensionality, multivariate normality, and other approaches. Here, we apply the concept of the linear mixture model to the question of spectral image complexity at spatially local scales. Essentially, the "complexity" of an image region is related to the volume of a convex set enclosing the data in the spectral space. The volume is estimated as a function of increasing dimensionality (through the use of a set of endmembers describing the data cloud) using the Gram Matrix approach. It is hypothesized that more complex regions of the image are composed of multiple, diverse materials and will thus occupy a larger volume in the hyperspace. The ultimate application here is large area image search without a priori information regarding the target signature. Instead, image cues will be provided based on local, relative estimates of the image complexity. The technique used to estimate the spectral image complexity is described and results are shown for representative image chips and a large area flightline of reflective hyperspectral imagery. The extension to the problem of large area search will then be described and results are shown for a 4-band multispectral image.
© 2012 Society of Photo-Optical Instrumentation Engineers (SPIE)
David W. Messinger, Amanda K. Ziemann, Ariel Schlamm, William Basener, "Metrics of spectral image complexity with application to large area search," Optical Engineering 51(3), 036201 (29 March 2012). https://doi.org/10.1117/1.OE.51.3.036201
JOURNAL ARTICLE
10 PAGES


SHARE
Back to Top