Hyperspectral Unmixing Based on Clustered Multitask Networks
Sara Khoshsokhan Roozbeh Rajabi Hadi Zayyani



Quantum Adiabatic Algorithm Design using Reinforcement Learning
    Xiaopeng Li
    December 30, 2023
===============================================================



	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.



Spectral unmixing, Hyperspectral images, Sparsity constraint, LMS strategy, Remote sensing, Distributed optimization.




§ INTRODUCTION



Remote sensing is the science of obtaining information about objects or areas from a distance, by detecting the energy that is reflected from the Earth. One of the noteworthy remote sensing techniques is hyperspectral imagery that encounter with mixed pixels challenge. Materials that are present in the scene is named endmembers. Each endmember in a pixel is weighted by its fractional abundance. The spectral unmixing (SU) technique is used to decompose a reflectance spectrum into a set of given endmember spectra. In the linear mixing model (LMM) of spectral unmixing, in which supposed that the recorded reflectance of a particular pixel, is linearly mixed by endmembers which exist in that pixel. If the number of endmembers that are present in the scene and its signatures, are unknown, the SU problem becomes a blind source separation (BSS) problem <cit.>.

Nonnegative matrix factorization (NMF) <cit.>, is a practical method of spectral unmixing, which decomposes the data into two nonnegative matrices. Recently, this basic method was developed by adding constraints, sparsity is one of the constraints for improving performance of NMF algorithm that is applied to the NMF cost function using L_q regulaizers <cit.>. Regularization methods have been used to provide updating equations for signatures and abundances. Using L_ 1/2 regularization into NMF, which leads to an algorithm named  L_ 1/2-NMF, has been proposed in <cit.>, that enforces the sparsity of endmember abundances. Another approch is total variation regularized reweighted sparse NMF (TV-RSNMF) <cit.>, that the total variation regularizer is embedded into the reweighted sparse NMF.

Recent researches have shown that the spatial autocorrelation of pixels gives beneficial information for the spectral unmixing, so in this paper, clustering methods and the distributed strategy has been used for utilization of spatial information. To do this, a clustering algorithm is applied to group all pixels into clusters across the whole hyperspectral image <cit.>, before spectral unmixing, as is done in <cit.>. Then for using neighborhood information, a diffusion strategy such as least mean squares (LMS) is used because it has high stability over adaptive networks <cit.>.

To solve a distributed problem, a general network which has been named clustered multitask network <cit.>, is considered. The sparsity constrained distributed unmixing without clustering has been proposed in <cit.>. Here, we first cluster pixels using fuzzy c- means method (FCM), and then solve unmixing problem as a clustered multitask network using information of 8 neighboring pixels and sparsity constraint.

This paper is organized as follows. In section 2, we introduce the proposed method and optimize it. Section 3 provides simulation results and the last section gives conclusions.



§ HYPERSPECTRAL UNMIXING BASED ON CLUSTERED MULTITASK NETWORKS

In this section, a new method that utilizes clustering of pixels and neighborhood information is proposed. First, we will express linear mixing model in subsection 2.1, and then distributed algorithm is solved for SU problem in 2.2.



 §.§ Linear Mixing Model

To solve the SU problem, we focus on the linear mixing model (LMM). In this model, there exists a linear relation between the endmembers that weighted by their fractional abundances, in the scene. Mathematically, this model is described as:

    𝐲_k=𝐀𝐬_k+𝐯_k

where 𝐲_k is an L×1 observed data vector, 𝐀 is the L× c signature matrix, 𝐬_k=[s_k(1),s_k(2),..,s_k(c)]^T is the c×1 fractional abundance vector and 𝐯_k is assumed as a L×1 additive noise vector of k-th pixel of the image, when c, L and N denote the number of endmembers, bands and pixels, respectively.

In the SU problem, fractional abundance vectors have two constraints in each pixel, abundance sum to one constraint (ASC) and abundance nonnegativity constraint (ANC) <cit.>, which are as follows, for c endmembers in a scene. 

    ∑_n=1^c 𝐬_k(n)=1


    𝐬_k(n)≥0,n=1,...,c

Where 𝐬_k (n) is the fractional abundance of the n-th endmember in the k-th pixel of the image. Note that, in a BSS problem, only the observed vector is known and determination of two other matrices is our purpose.


 §.§ Distributed Cost Functions and Optimization

Primarily, the fuzzy c-means clustering is adopted on the dataset <cit.>. Then, as explained in <cit.>, three types of networks containing single task, multitask and clustered multitask networks are supposed. First, N nodes are considered in a clustered multitask network and a optimum vector at node k is estimated. A global cost function using LMS, J^global(𝐬_k(n)), defined as follows:

    J^global (𝐬_1,𝐬_2,...,𝐬_N)=∑_k=1^N 𝔼{|𝐲_k -𝐀𝐬_k|^2}

where 𝔼 is the expectation operator. Note that, the solution determined from global cost function, need to have access to information over all nodes, but the nodes can be considered to have availability only to information of its neighbors and the nodes of in the same cluster. Thus, the local cost function is used to solve this problem.

Then, the neighborhood information is used to turn the cost function to a distributed problem. In a distributed network, relationships between neighboring nodes are used to improve accuracy. In this article, we utilize the squared Euclidean distance <cit.>, and the L_q regularizer for sparsity constraint that is used <cit.>. So, the following local cost function is defined, using LMS and adding the neighborhood and sparsity constraints:

    J^local (𝐬_k)= 𝔼{|𝐲_k-𝐀𝐬_k|^2}
    +η∑_l∈𝒩_k ∩ C(k)ρ_kl  ||𝐬_k-𝐬_l||^2   
        + λ ||𝐬_k||_q

where the 𝒩_k shows nodes that are in the neighborhood of node k, that is in the cluster C(k). η>0  denotes a regularization parameter <cit.>, that controls the effect of neighborhood term, λ is a scalar value that weights the sparsity function <cit.>, and the nonnegative coefficients ρ_kl are normalized spectral similarity which is obtained from correlation of data vectors <cit.>:

    λ = 1/√(L)∑_i√(N)-||𝐲_i||_1/||𝐲_i||_2/√(N-1)


    ρ_kj = θ (𝐲_k,𝐲_j)/∑_l ∈𝒩_k^-θ (𝐲_k,𝐲_l)

where 𝒩_k^- include neighbors of node k except itself, and θ is computed as <cit.>:

    θ (𝐲_k,𝐲_j) = 𝐲_k^T 𝐲_j/||𝐲_k|| ||𝐲_j||


Now, minimizing the cost function of (<ref>), using the iterative steepest-descent solution <cit.>, results to:

    𝐬_k^i+1 = P^+[ 𝐬_k^i+ μ𝐀^T (𝐲_k-𝐀𝐬_k)   
       - μη∑_l∈𝒩_k∩ C(k)ρ_kl (𝐬_l^i-𝐬_k^i)   
       - μλ( 𝐬_k^i) |𝐬_k^i|^q-2/||𝐬_k^i||_q^q-1]

where μ>0 is a step-size parameter, i denotes the iteration number, and P^+ operator projects vectors onto a simplex, that adopt the ASC and ANC constraints for abundance vectors. This operator explained in <cit.>.

Also, the spectral signatures matrix is updated similar to NMF algorithm, using multiplicative update rules <cit.>:

    𝐀^i+1=𝐀^i*𝐘𝐒^T/𝐀𝐒𝐒^T


A significant point in implementation of the algorithm is stopping criteria. This approach will be stopped until the maximum number of iteration (T), or the following stopping criteria is reached.

    ||J_new-J_old||<ϵ

where J_new and J_old are cost function values for two consecutive iterations and ϵ has been set to 10^-8 in our experiments. The proposed approach is summarized in Algorithm 1.




§ EXPERIMENTS AND RESULTS

In this section, for demonstration of quantitative comparison between the proposed method with different number of clusters, also between the proposed and other methods, the performance metrics such as spectral angle distance (SAD) and abundance angle distance (AAD) are used.





Primarily, the proposed algorithm has been applied on synthetic data. to generate this dataset, six signatures of USGS library have been selected randomly, using a 7×7 low pass filter and containing no pure pixels. Then, the zero mean Gaussian noise with 5 different levels of SNR have been added to generated data, and performance metrics have been computed by averaging 20 Monte-Carlo runs. To choose the best number of clusters in our experiments, the SAD performance metric has been evaluated, and then according to  <ref>, the best number of clusters has been set to 6, that is equal to number of endmembers. Also, values of μ and η has been considered equal to 0.02 and 0.1, respectively <cit.>, and q=1, to gain the best results. Then the proposed algorithm and some other algorithms such as VCA-FCLS <cit.>, NMF <cit.>, L_1/2-NMF <cit.>, distributed unmixing <cit.>, sparsity constrained distributed unmixing <cit.> and TV-RSNMF <cit.>, that is similar to the proposed algorithm without clustering step, has been applied on the generated synthetic dataset. The comparison of performance metrics of this 7 different methods has been shown in  <ref>, where the metrics of proposed algorithm is star-dashed line and excels other methods. Afterwards, the proposed algorithm has been applied on AVIRIS Cuprite real dataset <cit.>. After clustering into 12 clusters, the simulation results of spectral signatures and fractional abundances have been shown in  <ref> and  <ref>. Also, SAD performance metric of L_1/2-NMF, distributed unmixing, sparsity constrained distributed unmixing and proposed method on the real dataset have been compared in  <ref>, the results of proposed algorithm are available in the last column and has the best rmsSAD value.







§ CONCLUSION

Spectral unmixing (SU) is a technique to characterize mixed pixels in hyperspectral images measured by remote sensors. Decomposition of pixels in the scene into their constituent materials is the goal of spectral unmixing. This paper followed two steps, including the FCM clustering of hyperspectral images and then the sparsity constrained distributed unmixing method. This new algorithm considered sparsity, clustering and neighborhood information. Simulation results on synthetic and real datasets illustrated preference of proposed approach in comparison against NMF, L_1/2-NMF, VCA-FCLS, distributed unmixing and sparsity constrained distributed unmixing methods.











ieeetr


