Abstract
Blind hyperspectral unmixing is the task of jointly estimating the spectral signatures of material in a hyperspectral images and their abundances at each pixel. The size of hyperspectral images are usually very large, which may raise difficulties for classical optimization algorithms, due to limited memory of the hardware used. One solution to this problem is to consider distributed algorithms. In this paper, we develop a distributed sparse hyperspectral unmixing algorithm using the alternating direction method of multipliers (ADMM) algorithm and ℓ1 sparse regularization. Each sub-problem does not need to have access to the whole hyperspectral image. The algorithm is evaluated using a very large real hyperspectral image.
Original language | English |
---|---|
Title of host publication | 2016 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2016 - Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 6994-6997 |
Number of pages | 4 |
ISBN (Electronic) | 9781509033324 |
DOIs | |
Publication status | Published - 1 Nov 2016 |
Event | 36th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2016 - Beijing, China Duration: 10 Jul 2016 → 15 Jul 2016 |
Publication series
Name | International Geoscience and Remote Sensing Symposium (IGARSS) |
---|---|
Volume | 2016-November |
Conference
Conference | 36th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2016 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 10/07/16 → 15/07/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
Other keywords
- alternating direction method of multipliers
- blind signal separation
- dyadic cyclic descent
- feature extraction
- Hyperspectral unmixing
- linear unmixing
- optimization