Published 2010 | Version v1
Conference paper

A simple scheme for unmixing hyperspectral data based on the geometry of the n-dimensional simplex

Description

In this paper, we study the problem of decomposing spectra in hyperspectral data into the sum of pure spectra, or endmembers. We propose to jointly extract the endmembers and estimate the corresponding fractions, or abundances. For this purpose, we show that these abundances can be easily computed using volume of simplices, from the same information used in the classical N-Findr algorithm. This results into a simple scheme for unmixing hyperspectral data, with low computational complexity. Experimental results show the efficiency of the proposed method.

Abstract

International audience

Additional details

Created:
December 4, 2022
Modified:
November 28, 2023