31 May 2019 Clustered multitask non-negative matrix factorization for spectral unmixing of hyperspectral data
Sara Khoshsokhan, Roozbeh Rajabi, Hadi Zayyani
Author Affiliations +
Abstract
The algorithm based on a 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 is 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.
© 2019 Society of Photo-Optical Instrumentation Engineers (SPIE) 1931-3195/2019/$25.00 © 2019 SPIE
Sara Khoshsokhan, Roozbeh Rajabi, and Hadi Zayyani "Clustered multitask non-negative matrix factorization for spectral unmixing of hyperspectral data," Journal of Applied Remote Sensing 13(2), 026509 (31 May 2019). https://doi.org/10.1117/1.JRS.13.026509
Received: 6 September 2018; Accepted: 10 May 2019; Published: 31 May 2019
Lens.org Logo
CITATIONS
Cited by 9 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Reflectivity

Hyperspectral imaging

Signal to noise ratio

Matrices

Data modeling

Algorithm development

Mathematical modeling

Back to Top