Spectral Unmixing Of Hyperspectral Data Research Articles

The Influence of Noise Intensity in the Nonlinear Spectral Unmixing of Hyperspectral Data

The Influence of Noise Intensity in the Nonlinear Spectral Unmixing of Hyperspectral Data

Non-linear spectral unmixing of hyperspectral data using Modified PPNMM

Spectral unmixing is one of the unique advantages of hyperspectral images to map the type of species. Such images contain a high spectral resolution making it a classical problem of signal processing at each pixel, which is supposedly formed by the interaction of variously constituted end-members (also known as mixed pixels). Finding the abundance of any feature (or class or end-member) may require these mixed pixels to be unmixed through mixing models. This study proposes a linear mixing model and a non-linear mixing model combined for spectral unmixing and suggests a modified mixing model. We proposed linearly unmixed abundances to be used as prior probabilities for non-linear mixing models. We have applied these methods to synthetic data to check performance and robustness. Synthetic data was created using the reflectance spectra of various end-members collected in the study region through rigorous field surveys. Abundance accuracy, reconstruction accuracy, and other statistical measures were used to assess overall accuracy, with results showing that Modified PPNMM performs better than PPNMM and LMM. The performance outcome is further validated with a satellite dataset (hyperspectral data of Hyperion) with randomly distributed points.

Clustered multitask non-negative matrix factorization for spectral unmixing of hyperspectral data

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.

Sparsity-Constrained Distributed Unmixing of Hyperspectral Data

Spectral unmixing (SU) is a technique to characterize mixed pixels in hyperspectral images measured by remote sensors. Most of the spectral unmixing algorithms are developed using the linear mixing models. To estimate endmembers and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are widely used in the SU problem. One of the constraints which was added to NMF is sparsity, that was regularized by L q norm. In this paper, a new algorithm based on distributed optimization is suggested for spectral unmixing. In the proposed algorithm, a network including single-node clusters is employed. Each pixel in the hyperspectral images is considered as a node in this network. The sparsity-constrained distributed unmixing is optimized with diffusion least mean p-power (LMP) strategy, and then the update equations for fractional abundance and signature matrices are obtained. Afterward, the proposed algorithm is analyzed for different values of LMP power and L q norms. Simulation results based on defined performance metrics illustrate the advantage of the proposed algorithm in spectral unmixing of hyperspectral data compared with other methods.

DISTRIBUTED UNMIXING OF HYPERSPECTRAL DATAWITH SPARSITY CONSTRAINT

Abstract. Spectral unmixing (SU) is a data processing problem in hyperspectral remote sensing. The significant challenge in the SU problem is how to identify endmembers and their weights, accurately. For estimation of signature and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are used widely in the SU problem. One of the constraints which was added to NMF is sparsity constraint that was regularized by L1/2 norm. In this paper, a new algorithm based on distributed optimization has been used for spectral unmixing. In the proposed algorithm, a network including single-node clusters has been employed. Each pixel in hyperspectral images considered as a node in this network. The distributed unmixing with sparsity constraint has been 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. The results show that the AAD and SAD of the proposed approach are improved respectively about 6 and 27 percent toward distributed unmixing in SNR=25dB.

Hybrid Spectral Unmixing: Using Artificial Neural Networks for Linear/Non-Linear Switching

Spectral unmixing is a key process in identifying spectral signature of materials and quantifying their spatial distribution over an image. The linear model is expected to provide acceptable results when two assumptions are satisfied: (1) The mixing process should occur at macroscopic level and (2) Photons must interact with single material before reaching the sensor. However, these assumptions do not always hold and more complex nonlinear models are required. This study proposes a new hybrid method for switching between linear and nonlinear spectral unmixing of hyperspectral data based on artificial neural networks. The neural networks was trained with parameters within a window of the pixel under consideration. These parameters are computed to represent the diversity of the neighboring pixels and are based on the Spectral Angular Distance, Covariance and a non linearity parameter. The endmembers were extracted using Vertex Component Analysis while the abundances were estimated using the method identified by the neural networks (Vertex Component Analysis, Fully Constraint Least Square Method, Polynomial Post Nonlinear Mixing Model or Generalized Bilinear Model). Results show that the hybrid method performs better than each of the individual techniques with high overall accuracy, while the abundance estimation error is significantly lower than that obtained using the individual methods. Experiments on both synthetic dataset and real hyperspectral images demonstrated that the proposed hybrid switch method is efficient for solving spectral unmixing of hyperspectral images as compared to individual algorithms.

GEOLOGICAL MAPPING BY COMBINING SPECTRAL UNMIXING AND CLUSTER ANALYSIS FOR HYPERSPECTRAL DATA

Spectral unmixing of hyperspectral data often fails to select some minerals and rocks having flat spectra but no diagnostic absorption features as endmembers, even if they are actually important endmembers. To avoid this problem, we propose a novel approach that combined two methods: spectral unmixing and full-pixel classification. First, all pixels were divided into two categories, hydrothermally altered areas and unaltered rocks based on the absorption depth of 2.0 to 2.5 μm. For the hydrothermally altered areas, endmembers were extracted by the Improved Causal Random Pixel Purity Index (ICRPPI) method, which was improved from the existing Pixel Purity Index (PPI) and Causal Random Pixel Purity Index (CRPPI) methods. Endmember abundance in each pixel was calculated by linear spectral unmixing. In a separate operation, k-means clustering was applied to the unaltered rock areas. Finally, the results of these two methods were combined to generate a single distribution map of rocks and minerals. This approach was applied to the airborne hyperspectral HyMap data of Cuprite, Nevada, U.S.A. We confirmed that our mapping result was consistent with the existing geological map as well as our field survey result.

GEOLOGICAL MAPPING BY COMBINING SPECTRAL UNMIXING AND CLUSTER ANALYSIS FOR HYPERSPECTRAL DATA

Abstract. Spectral unmixing of hyperspectral data often fails to select some minerals and rocks having flat spectra but no diagnostic absorption features as endmembers, even if they are actually important endmembers. To avoid this problem, we propose a novel approach that combined two methods: spectral unmixing and full-pixel classification. First, all pixels were divided into two categories, hydrothermally altered areas and unaltered rocks based on the absorption depth of 2.0 to 2.5 μm. For the hydrothermally altered areas, endmembers were extracted by the Improved Causal Random Pixel Purity Index (ICRPPI) method, which was improved from the existing Pixel Purity Index (PPI) and Causal Random Pixel Purity Index (CRPPI) methods. Endmember abundance in each pixel was calculated by linear spectral unmixing. In a separate operation, k-means clustering was applied to the unaltered rock areas. Finally, the results of these two methods were combined to generate a single distribution map of rocks and minerals. This approach was applied to the airborne hyperspectral HyMap data of Cuprite, Nevada, U.S.A. We confirmed that our mapping result was consistent with the existing geological map as well as our field survey result.

Fast Spatial Preprocessing for Spectral Unmixing of Hyperspectral Data on Graphics Processing Units

Spectral unmixing is an important technique for hyperspectral data exploitation. It amounts at finding a set of pure spectral signatures (endmembers) of the most representative materials in the scene, and estimating their abundance fractions. The integration of spatial information prior to spectral unmixing of hyperspectral data has attracted much attention in recent years. Several approaches have been developed for the purpose of guiding endmember identification algorithms to spatially representative, yet spectrally pure endmembers. In particular, the spatial preprocessing (SPP) algorithm can be used prior to most existing spectral-based endmember identification techniques, thus promoting the selection of endmembers in spatially representative areas of the scene. However, most SPP techniques are computationally expensive, which adds significant burden to the spectral unmixing process. In this paper, we present three parallel implementations of SPP that have been specifically developed for commodity graphics processing units (GPUs). We perform an evaluation of these techniques using two GPU architectures from NVidia: GeForce GTX 580 and GeForce GTX 870M, which reveals that real-time processing performance can be obtained for real hyperspectral data sets collected by the airborne visible infra-red imaging spectrometer (AVIRIS).

Optimizing the Endmembers Using Volume Invariant Constrained Model.

The linear mixture model (LMM) plays a crucial role in the spectral unmixing of hyperspectral data. Under the assumption of LMM, the solution with the minimum reconstruction error is considered to be the ideal endmember. However, for practical hyperspectral data sets, endmembers that enclose all the pixels are physically meaningless due to the effect of noise. Therefore, in many cases, it is not sufficient to consider only the reconstruction error, some constraints (for instance, volume constraint) need to be added to the endmembers. The two terms can be considered as serving two forces: minimizing the reconstruction error forces the endmembers to move outward and thus enlarges the volume of the simplex while the endmember constraint acts in the opposite direction by driving the endmembers to move inward so as to constrain the volume to be smaller. Many existing methods obtain their solution just by balancing the two contradictory forces. The solution acquired in this way can not only minimize the reconstruction error but also be physically meaningful. Interestingly, we find, in this paper, that the two forces are not completely contradictory with each other, and the reconstruction error can be further reduced without changing the volume of the simplex. And more interestingly, our method can further optimize the solution provided by all the endmember extraction methods (both endmember selection methods and endmember generation methods). After optimization, the final endmembers outperform the initial solution in terms of reconstruction error as well as accuracy. The experiments on simulated and real hyperspectral data verify the validation of our method.

Sparsity Constrained Graph Regularized NMF for Spectral Unmixing of Hyperspectral Data

Hyperspectral images contain mixed pixels due to low spatial resolution of hyperspectral sensors. Mixed pixels are pixels containing more than one distinct material called endmembers. The presence percentages of endmembers in mixed pixels are called abundance fractions. Spectral unmixing problem refers to decomposing these pixels into a set of endmembers and abundance fractions. Due to nonnegativity constraint on abundance fractions, nonnegative matrix factorization methods (NMF) have been widely used for solving spectral unmixing problem. In this paper we have used graph regularized NMF (GNMF) method combined with sparseness constraint to decompose mixed pixels in hyperspectral imagery. This method preserves the geometrical structure of data while representing it in low dimensional space. Adaptive regularization parameter based on temperature schedule in simulated annealing method also has been used in this paper for the sparseness term. Proposed algorithm is applied on synthetic and real datasets. Synthetic data is generated based on endmembers from USGS spectral library. AVIRIS Cuprite dataset is used as real dataset for evaluation of proposed method. Results are quantified based on spectral angle distance (SAD) and abundance angle distance (AAD) measures. Results in comparison with other methods show that the proposed method can unmix data more effectively. Specifically for the Cuprite dataset, performance of the proposed method is approximately 10% better than the VCA and Sparse NMF in terms of root mean square of SAD.

Derivative spectral unmixing of hyperspectral data applied to mixtures of lichen and rock

Spectral mixture analysis (SMA) has been used extensively in the hyperspectral remote sensing community for the subpixel abundance estimation of targets. However, the task of defining every endmember can be difficult, as evident from the importance attributed to the topic in the recent literature. The effectiveness of SMA can be compromised when the required spectral endmembers are not well constrained in terms of their spectral magnitude and shape. The spectral magnitude of the endmembers is more difficult to obtain than their spectral shape, in part because the effects of the atmosphere and topography are difficult to constrain. This paper presents a derivative spectral unmixing (DSU) model, which is an extension of the spectral mixture analysis and derivative analysis. Using a DSU approach, it is possible to estimate the fraction of an endmember characterized by one or more diagnostic absorption features despite having only a general knowledge of the spectral shapes of the remaining endmembers. The DSU is assessed using spectral data acquired for a lichen-covered rock sample, and the estimated fractions of lichen and rock are assessed against that obtained from a high spatial resolution digital photograph. The results of the laboratory experiments suggests that the DSU is a promising algorithm for the quantitative analysis of hyperspectral data, but experiments on airborne/spaceborne imagery are now required to assess its value for geological mapping.