Abstract: The results from L1-Endmembers display the algorithm’s stability and accuracy with increasing levels of noise. The algorithm was extremely stable in the number of endmembers when compared to the SPICE algorithm and the Virtual Dimensionality methods for estimating the… Read More
Tag: hyperspectral
Multiple model endmember detection based on spectral and spatial information
Abstract: We introduce a new spectral mixture analysis approach. Unlike most available approaches that only use the spectral information, this approach uses the spectral and spatial information available in the hyperspectral data. Moreover, it does not assume a global convex… Read More
A comparison of deterministic and probabilistic approaches to endmember representation
Abstract: The piece-wise convex multiple model endmember detection algorithm (P-COMMEND) and the Piece-wise Convex End-member detection (PCE) algorithm autonomously estimate many sets of endmembers to represent a hyperspectral image. A piece-wise convex model with several sets of endmembers is more… Read More
PCE: piecewise convex endmember detection
Abstract: A new hyperspectral endmember detection method that represents endmembers as distributions, autonomously partitions the input data set into several convex regions, and simultaneously determines endmember distributions (EDs) and proportion values for each convex region is presented. Spectral unmixing methods… Read More
Spatially-smooth piece-wise convex endmember detection
Abstract: An endmember detection and spectral unmixing algorithm that uses both spatial and spectral information is presented. This method, Spatial Piece-wise Convex Multiple Model Endmember Detection (Spatial P-COMMEND), autonomously estimates multiple sets of endmembers and performs spectral unmixing for input… Read More
L1-endmembers: a robust endmember detection and spectral unmixing algorithm
Abstract: A hyperspectral endmember detection and spectral unmixing algorithm based on an l1 norm factorization of the input hyperspectral data is developed and compared to a method based on l2 norm factorization. Both algorithms, the L1-Endmembers algorithm based on the… Read More
Context-based endmember detection for hyperspectral imagery
Abstract: An endmember detection algorithm that simultaneously partitions an input data set into distinct contexts, estimates endmembers, number of endmembers, and abundances for each partition is presented. In contrast to previous endmember detection algorithms based on the convex geometry model,… Read More
Endmember detection using the dirichlet process
Abstract: An endmember detection algorithm for hyperspectral imagery using the Dirichlet process to determine the number of endmembers in a hyperspectral image is described. This algorithm provides an estimate of endmember spectra, proportion maps, and the number of endmembers needed… Read More
Hyperspectral endmember detection and band selection using bayesian methods
Abstract: Four methods of endmember detection and spectral unmixing are described. The methods determine endmembers and perform spectral unmixing while simultaneously determining the number of endmembers, representing endmembers as distributions, partitioning the input data set into several convex regions, or… Read More
Hyperspectral band selection and endmember detection using sparsity promoting priors
Abstract: This letter presents a simultaneous band selection and endmember detection algorithm for hyperspectral imagery. This algorithm is an extension of the sparsity promoting iterated constrained endmember (SPICE) algorithm. The extension adds spectral band weights and a sparsity promoting prior… Read More