Clustered Multitask Nonnegative Matrix Factorization for Spectral Unmixing of Hyperspectral Data
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Hyperspectral Unmixing Based on Clustered Multitask Networks
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 d…
Distributed OptimizationHyperspectral UnmixingSAR Images Clustering Based on Modified Nonlinear Orthogonal Nonnegative Matrix Factorization (NMF)
This study presents the results of unsupervised learning (clustering) on Synthetic Aperture Radar (SAR) images. Fast and accurate clustering allows us to perform Automatic Target Recognition (ATR) in SAR images. Data can…
ClusteringForecasting Nonnegative Time Series via Sliding Mask Method (SMM) and Latent Clustered Forecast (LCF)
We consider nonnegative time series forecasting framework. Based on recent advances in Nonnegative Matrix Factorization (NMF) and Archetypal Analysis, we introduce two procedures referred to as Sliding Mask Method (SMM) …
ClusteringDimensionality ReductionMatrix CompletionTime Series+2Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containin…
Hyperspectral UnmixingA Review of Nonnegative Matrix Factorization Methods for Clustering
Nonnegative Matrix Factorization (NMF) was first introduced as a low-rank matrix approximation technique, and has enjoyed a wide area of applications. Although NMF does not seem related to the clustering problem at first…
Clustering