Performance Evaluation of Various Hyperspectral Nonlinear Unmixing Algorithms
Year: 2018
Type: article
Abstract: Nonlinear unmixing of hyperspectral images has shown considerable attention in image and signal processing research areas. Hyperspectral unmixing identifies endmembers spectral signatures and the abundance fractions of each endmemeber within each pixel of an observed hyperspectral scene. Over the last few years, several nonlinear unmixing algorithms have been proposed. This paper presents an empirical comparison of several popular and recent algorithms of supervised nonlinear unmixing algorithms. Namely, we compared Kernel-based algorithms, graph Laplacian regularization algorithm, and nonlinear unmixing algorithm using a generalized bilinear model (GBM). These unmixing algorithms estimate the abundances of linear, bilinear and intimate mixtures of hyperspectral data. We assessed the performance of these algorithms using Root Mean SquareError on the same data sets.
Authors: Awabed Jibreen, Nourah Alqahtani, Ouiem Bchir
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2788613324
