|
Title
|
|
|
|
Non-linear spectral unmixing by geodesic simplex volume maximization
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Spectral mixtures observed in hyperspectral imagery often display non-linear mixing effects. Since most traditional unmixing techniques are based upon the linear mixing model, they perform poorly in finding the correct endmembers and their abundances in the case of non-linear spectral mixing. In this paper, we present an unmixing algorithm that is capable of extracting endmembers and determining their abundances in hyperspectral imagery under non-linear mixing assumptions. The algorithm is based upon simplex volume maximization, and uses shortest-path distances in a nearest-neighbor graph in spectral space, hereby respecting the non-trivial geometry of the data manifold in the case of non-linearly mixed pixels.We demonstrate the algorithm on an artificial data set, the AVIRIS Cuprite data set, and a hyperspectral image of a heathland area in Belgium. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
IEEE journal of selected topics in signal processing. - New York, N.Y.
| |
|
Publication
|
|
|
|
New York, N.Y.
:
2011
| |
|
ISSN
|
|
|
|
1932-4553
[print]
1941-0484
[online]
| |
|
DOI
|
|
|
|
10.1109/JSTSP.2010.2088377
| |
|
Volume/pages
|
|
|
|
5
:3
(2011)
, p. 534-542
| |
|
ISI
|
|
|
|
000290750700015
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|