3260 papers • 126 benchmarks • 313 datasets
Hyperspectral Unmixing is a procedure that decomposes the measured pixel spectrum of hyperspectral data into a collection of constituent spectral signatures (or endmembers) and a set of corresponding fractional abundances. Hyperspectral Unmixing techniques have been widely used for a variety of applications, such as mineral mapping and land-cover change detection. Source: An Augmented Linear Mixing Model to Address Spectral Variability for Hyperspectral Unmixing
(Image credit: Papersgraph)
These leaderboards are used to track progress in hyperspectral-unmixing-11
No benchmarks available.
Use these libraries to find hyperspectral-unmixing-11 models and implementations
No datasets available.
No subtasks available.
An interpretable methodological framework for low-rank multifeature hyperspectral unmixing based on tensor decomposition (MultiHU-TD) that incorporates the abundance sum-to-one constraint in the alternating optimization alternating direction method of multipliers (ADMM) algorithm and provide in-depth mathematical, physical, and graphical interpretation and connections with the extended linear mixing model.
A robust mixing model to describe hyperspectral data resulting from the mixture of several pure spectral signatures is introduced, which leads to a new form of robust nonnegative matrix factorization with a group-sparse outlier term.
The proposed Block-Simultaneous Direction Method of Multipliers (bSDMM) can be interpreted as a proximal analog to inexact coordinate descent methods under constraints under constraints and is well-suited for a range of optimization problems.
This paper proposes a novel endmember extraction and hyperspectral unmixing scheme, so-called EndNet, that is based on a two-staged autoencoder network that is scalable for large-scale data and it can be accelerated on graphical processing units.
This paper shows that the distribution of the mixed pixel (under the linear mixing model) is also a GMM (and this is shown from two perspectives), and proposes a Gaussian mixture models (GMM) that can not only estimate the abundances and distribution parameters, but also the distinct endmember set for each pixel.
The experimental results validate that the proposed hyperspectral unmixing technique outperforms baselines based on Root Mean Square Error (RMSE) and two fusion configurations that produce ideal abundance maps by using the abstract representations computed from previous layers.
It is shown that the linear mixture model implicitly puts certain architectural constraints on the network, and it effectively performs blind hyperspectral unmixing, especially true when using spectral angle distance as the network’s objective function.
The results validate that the proposed method obtains state-of-the-art hyperspectral unmixing performance particularly on the real datasets compared to the baseline techniques.
A more flexible approach, called unmixing with low-rank tensor regularization algorithm accounting for EM variability (ULTRA-V), that imposes low- rank structures through regularizations whose strictness is controlled by scalar parameters is proposed.
Adding a benchmark result helps the community track progress.