Clustered Multitask Nonnegative Matrix Factorization for Spectral Unmixing of Hyperspectral Data
Not on the map. Why?
Abstract (arXiv)
In this paper, the new algorithm based on clustered multitask network is proposed to solve spectral unmixing problem in hyperspectral imagery. In the proposed algorithm, the clustered network is employed. Each pixel in the hyperspectral image considered as a node in this network. The nodes in the network are clustered using the fuzzy c-means clustering method. Diffusion least mean square strategy has been used to optimize the proposed cost function. To evaluate the proposed method, experiments are conducted on synthetic and real datasets. Simulation results based on spectral angle distance, abundance angle distance and reconstruction error metrics illustrate the advantage of the proposed algorithm compared with other methods.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 16 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.