Hyperspectral Unmixing based on Clustered Multitask Networks

Abstract

Hyperspectral remote sensing is a prominent research topic in data processing. Most of the spectral unmixing algorithms are developed by adopting the linear mixing models. Nonnegative matrix factorization (NMF) and its developments are used widely for estimation of signatures and fractional abundances in the SU problem. Sparsity constraints was added to NMF, and was regularized by L q norm. In this paper, at first hyperspectral images are clustered by fuzzy c-means method, and then a new algorithm based on sparsity constrained distributed optimization is used for spectral unmixing. In the proposed algorithm, a network including clusters is employed. Each pixel in the hyperspectral images considered as a node in this network. The proposed algorithm is optimized with diffusion LMS strategy, and then the update equations for fractional abundance and signature matrices are obtained. Simulation results based on defined performance metrics illustrate advantage of the proposed algorithm in spectral unmixing of hyperspectral data compared with other methods.

Clustered multitask non-negative matrix factorization for spectral unmixing of hyperspectral data

“…23,24 Here, we have used clustered multitask network to solve SU problem. 25 Using clustered multitask network, only the neighborhood information of spectrally similar mixed pixels (those are in the same cluster) will be used in the proposed cost function. In order to generate a clustered network, we used the FCM clustering method on spectral features of hyperspectral data.…”