Abstract: A Metropolis-within-Gibbs sampler for piecewise convex hyperspectral unmixing and endmember extraction is presented. The standard linear mixing model used for hyperspectral unmixing assumes that hyperspectral data reside in a single convex region. However, hyperspectral data are often nonconvex. Furthermore,… Read More
PublicationPublication
Landmine classification using possibilistic K-nearest neighbors with wideband electromagnetic induction data
Abstract: In this thesis, a possibilistic K-nearest neighbor classifier is presented to distinguish between and classify mine and non-mine targets on data obtained from wideband electromagnetic induction sensors. The goal of this work is to develop methods for classifying wide-band… Read More
Editorial: Algorithms for multispectral and hyperspectral image analysis
Abstract: Recent advances in multispectral and hyperspectral sensing technologies coupled with rapid growth in computing power have led to new opportunities in remote sensing—higher spatial and/or spectral resolution over larger areas leads to more detailed and comprehensive land cover mapping… Read More
Endmember extraction using the physics-based multi-mixture pixel model
Abstract: A method of incorporating the multi-mixture pixel model into hyperspectral endmember extraction is presented and discussed. A vast majority of hyperspectral endmember extraction methods rely on the linear mixture model to describe pixel spectra resulting from mixtures of endmembers.… Read More
Hyperspectral image analysis with piece-wise convex endmember estimation and spectral unmixing
Abstract: A hyperspectral endmember detection and spectral unmixing algorithm that finds multiple sets of endmembers is presented. This algorithm, the Piece-wise Convex Multiple Model Endmember Detection (P-COMMEND) algorithm, models a hyperspectral image using a piece-wise convex representation. By using a… Read More
Spectral unmixing cluster validity index for multiple sets of endmembers
Abstract: A hyperspectral pixel is generally composed of a relatively small number of endmembers. Several unmixing methods have been developed to enforce this concept through sparsity promotion or piece-wise convex mixing models. Piece-wise convex unmixing methods often require as parameters… Read More
Agent-based rumor spreading models for human geography applications
Abstract: Communication has a large impact on the outcome of a population’s response during disaster scenarios. The ability of a population to access news and disaster relief information as well as the population’s perception of the information they receive effects… Read More
A sparsity promoting bilinear unmixing model
Abstract: An algorithm, Bilinear SPICE (BISPICE), for simultaneously estimating the number of endmembers, the endmembers, and proportions for a bilinear mixing model is derived and evaluated. BISPICE generalizes the SPICE algorithm for linear mixing. The proportion estimation steps of SPICE… Read More
Bootstrapping for piece-wise convex endmember distribution detection
Abstract: A hyperspectral endmember detection and spectral unmixing algorithm that finds multiple sets of endmember distributions is presented. If endmembers are represented as random vectors, then they can be characterized by a multivariate probability distribution. These distributions are referred to… Read More
Using physics-based macroscopic and microscopic mixture models for hyperspectral pixel unmixing
Abstract: A method of incorporating macroscopic and microscopic reflectance models into hyperspectral pixel unmixing is presented and discussed. A vast majority of hyperspectral unmixing methods rely on the linear mixture model to describe pixel spectra resulting from mixtures of endmembers.… Read More