English

Clustered Multitask Nonnegative Matrix Factorization for Spectral Unmixing of Hyperspectral Data

Computer Vision and Pattern Recognition 2019-05-21 v1

Abstract

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.

Keywords

Cite

@article{arxiv.1905.08032,
  title  = {Clustered Multitask Nonnegative Matrix Factorization for Spectral Unmixing of Hyperspectral Data},
  author = {Sara Khoshsokhan and Roozbeh Rajabi and Hadi Zayyani},
  journal= {arXiv preprint arXiv:1905.08032},
  year   = {2019}
}

Comments

one column, 22 pages, 12 figures, journal. arXiv admin note: substantial text overlap with arXiv:1902.07593, arXiv:1812.10788

R2 v1 2026-06-23T09:13:05.355Z