Category: Publication

Abstract: We present a computational framework for modeling geospatial dynamics of crowd emotions as part of anticipatory analysis. The framework is based on agent based modeling (ABM) and evaluation-activation space for emotion representation. ABM is a simulation technique that uses the actions and interactions of individual agents to represent the behavior of a given population […]

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, in standard endmember extraction and unmixing methods, endmembers are generally represented as a single point […]

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 electromagnetic induction data into one of several target classes or a non-target class. For some […]

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 and more sensitive target detection. However, these massive hyperspectral datasets provide new challenges as well. […]

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. Methods exist to unmix hyperspectral pixels using nonlinear models, but rely on severely limiting assumptions […]

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 piece-wise convex representation, non-convex hyperspectral data are more accurately characterized. For example, the well-known Indian […]

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 the number of endmembers and the number of sets of endmembers needed. However, these values […]

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 behavior during a disaster scenario. In this paper, two agent-based rumor (information) spreading models are […]

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 and BISPICE are similar. However, the endmember updates, one novel aspect of the work, are […]

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 as endmember distributions. The proposed method combines the Piece-wise Convex Multiple Model Endmember Detection (PCOMMEND) […]