Paper
17 May 2016 Comparing performance of standard and iterative linear unmixing methods for hyperspectral signatures
Travis R. Gault, Melissa E. Jansen, Mallory E. DeCoster, E. David Jansing, Benjamin M. Rodriguez
Author Affiliations +
Abstract
Linear unmixing is a method of decomposing a mixed signature to determine the component materials that are present in sensor’s field of view, along with the abundances at which they occur. Linear unmixing assumes that energy from the materials in the field of view is mixed in a linear fashion across the spectrum of interest. Traditional unmixing methods can take advantage of adjacent pixels in the decomposition algorithm, but is not the case for point sensors. This paper explores several iterative and non-iterative methods for linear unmixing, and examines their effectiveness at identifying the individual signatures that make up simulated single pixel mixed signatures, along with their corresponding abundances. The major hurdle addressed in the proposed method is that no neighboring pixel information is available for the spectral signature of interest. Testing is performed using two collections of spectral signatures from the Johns Hopkins University Applied Physics Laboratory’s Signatures Database software (SigDB): a hand-selected small dataset of 25 distinct signatures from a larger dataset of approximately 1600 pure visible/near-infrared/short-wave-infrared (VIS/NIR/SWIR) spectra. Simulated spectra are created with three and four material mixtures randomly drawn from a dataset originating from SigDB, where the abundance of one material is swept in 10% increments from 10% to 90%with the abundances of the other materials equally divided amongst the remainder. For the smaller dataset of 25 signatures, all combinations of three or four materials are used to create simulated spectra, from which the accuracy of materials returned, as well as the correctness of the abundances, is compared to the inputs. The experiment is expanded to include the signatures from the larger dataset of almost 1600 signatures evaluated using a Monte Carlo scheme with 5000 draws of three or four materials to create the simulated mixed signatures. The spectral similarity of the inputs to the output component signatures is calculated using the spectral angle mapper. Results show that iterative methods significantly outperform the traditional methods under the given test conditions.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Travis R. Gault, Melissa E. Jansen, Mallory E. DeCoster, E. David Jansing, and Benjamin M. Rodriguez "Comparing performance of standard and iterative linear unmixing methods for hyperspectral signatures", Proc. SPIE 9840, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XXII, 984027 (17 May 2016); https://doi.org/10.1117/12.2224060
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Monte Carlo methods

Algorithm development

Sensors

Computer simulations

Spectroscopy

Applied physics

Databases

RELATED CONTENT

Multi-agent data fusion workstation (MADFW) architecture
Proceedings of SPIE (March 20 1998)
High-speed hazard avoidance for mobile robots in rough terrain
Proceedings of SPIE (September 02 2004)
New developments on VCA unmixing algorithm
Proceedings of SPIE (October 10 2008)
Simple real-time data fusion
Proceedings of SPIE (March 22 2001)
Truncated Dempster-Shafer optimization and benchmarking
Proceedings of SPIE (April 03 2000)

Back to Top