So far, the problem of unmixing large or multitemporal hyperspectral data sets has been specifically addressed in the remote sensing literature only by a few dedicated strategies. Among them, some attempts have been made within a distributed estimation framework, in particular, relying on the alternating direction method of multipliers. In this paper, we propose to study the interest of a partially asynchronous distributed unmixing procedure based on a recently proposed asynchronous algorithm. Under standard assumptions, the proposed algorithm inherits its convergence properties from recent contributions in nonconvex optimization, while allowing the problem of interest to be efficiently addressed. Comparisons with a distributed synchronous counterpart of the proposed unmixing procedure allow its interest to be assessed on synthetic and real data. Besides, thanks to its genericity and flexibility, the procedure investigated in this paper can be implemented to address various matrix factorization problems.
|Journal||IEEE Transactions on Geoscience and Remote Sensing|
|Early online date||8 Oct 2018|
|Publication status||E-pub ahead of print - 8 Oct 2018|
- Hyperspectral (HS) unmixing
- nonconvex optimization
- partially asynchronous distributed estimation.
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Earth and Planetary Sciences(all)