# An Elliptic Kernel Unsupervised Autoencoder-Graph Convolutional Network Ensemble Model for Hyperspectral Unmixing

arXiv: https://arxiv.org/abs/2406.06742 · HTML: https://mlsanity.com/paper/2406.06742/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 11 of its 59 references that are in the map.
- First posted on arXiv 10 Jun 2024.

## Builds on (most cited first, 11 of 11)

- [Graph Convolutional Networks for Hyperspectral Image Classification](https://mlsanity.com/paper/2008.02457/) (2020)
- [Spectral Variability in Hyperspectral Data Unmixing: A Comprehensive Review](https://mlsanity.com/paper/2001.07307/) (2020)
- [Hyperspectral Unmixing: Ground Truth Labeling, Datasets, Benchmark Performances and Survey](https://mlsanity.com/paper/1708.05125/) (2017)
- [Fusformer: A Transformer-based Fusion Approach for Hyperspectral Image Super-resolution](https://mlsanity.com/paper/2109.02079/) (2021)
- [EndNet: Sparse AutoEncoder Network for Endmember Extraction and Hyperspectral Unmixing](https://mlsanity.com/paper/1708.01894/) (2017)
- [Hyperspectral Image Classification With Context-Aware Dynamic Graph Convolutional Network](https://mlsanity.com/paper/1909.11953/) (2019)
- [Trends in deep learning for medical hyperspectral image analysis](https://mlsanity.com/paper/2011.13974/) (2020)
- [Spectral Variability Aware Blind Hyperspectral Image Unmixing Based on Convex Geometry](https://mlsanity.com/paper/1904.03888/) (2019)
- [Convolutional Autoencoder for Blind Hyperspectral Image Unmixing](https://mlsanity.com/paper/2011.09420/) (2020)
- [Pixel-to-Abundance Translation: Conditional Generative Adversarial Networks Based on Patch Transformer for Hyperspectral Unmixing](https://mlsanity.com/paper/2312.13127/) (2023)
- [A Multibranch Convolutional Neural Network for Hyperspectral Unmixing](https://mlsanity.com/paper/2208.02361/) (2022)

## Abstract (arXiv)

Spectral Unmixing is an important technique in remote sensing used to analyze hyperspectral images to identify endmembers and estimate abundance maps. Over the past few decades, performance of techniques for endmember extraction and fractional abundance map estimation have significantly improved. This article presents an ensemble model workflow called Autoencoder Graph Ensemble Model (AEGEM) designed to extract endmembers and fractional abundance maps. An elliptical kernel is applied to measure spectral distances, generating the adjacency matrix within the elliptical neighborhood. This information is used to construct an elliptical graph, with centroids as senders and remaining pixels within the geometry as receivers. The next step involves stacking abundance maps, senders, and receivers as inputs to a Graph Convolutional Network, which processes this input to refine abundance maps. Finally, an ensemble decision-making process determines the best abundance maps based on root mean square error metric. The proposed AEGEM is assessed with benchmark datasets such as Samson, Jasper, and Urban, outperforming results obtained by baseline algorithms. For the Samson dataset, AEGEM excels in three abundance maps: water, tree and soil yielding values of 0.081, 0.158, and 0.182, respectively. For the Jasper dataset, results are improved for the tree and water endmembers with values of 0.035 and 0.060 in that order, as well as for the mean average of the spectral angle distance metric 0.109. For the Urban dataset, AEGEM outperforms previous results for the abundance maps of roof and asphalt, achieving values of 0.135 and 0.240, respectively. Additionally, for the endmembers of grass and roof, AEGEM achieves values of 0.063 and 0.094.