Double Spatial Graph Laplacian Regularization for Sparse Unmixing
Author:
- 22 March 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 19 (1545598X) , 1-5
Abstract
Sparse unmixing is an ill-posed inverse problem to find the abundances of each mineral in a scene using a large spectral library. Since the homogeneous regions tend to have similar fractional abundances, including spatial-contextual information increases the performance of an unmixing algorithm. In this letter, we propose a double spatial graph Laplacian regularization for sparse unmixing (DSGLSU). The proposed method consists of two steps. In the first step, hyperspectral data are approximated using a suitable transformation to generate scaled (coarse) data to exploit the interpixel information. Then, a sparsity constrained optimization problem is solved in the approximation domain to produce a coarse abundance matrix. A low-resolution abundance map is obtained by applying an inverse transformation to a coarse abundance map. In the second step, a graph Laplacian and weighted sparsity regularized optimization problem is solved in the original domain to obtain an abundance map where the low-resolution abundance map obtained in the first step is used as a weight term in sparsity regularization. We perform experiments on two simulated data sets and a real data set. It has been shown that the proposed method outperforms the state-of-the-art spatially regularized sparse unmixing methods proposed in the literature.Keywords
This publication has 24 references indexed in Scilit:
- Reweighted Sparse Regression for Hyperspectral UnmixingIEEE Transactions on Geoscience and Remote Sensing, 2015
- A graph Laplacian regularization for hyperspectral data unmixing2015
- SLIC Superpixels Compared to State-of-the-Art Superpixel MethodsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- Total Variation Spatial Regularization for Sparse Hyperspectral UnmixingIEEE Transactions on Geoscience and Remote Sensing, 2012
- A tutorial on spectral clusteringStatistics and Computing, 2007
- Vertex component analysis: a fast algorithm to unmix hyperspectral dataIEEE Transactions on Geoscience and Remote Sensing, 2005
- Image quality assessment: from error visibility to structural similarityIEEE Transactions on Image Processing, 2004
- Spectral unmixingIEEE Signal Processing Magazine, 2002
- Fully constrained least squares linear spectral mixture analysis method for material quantification in hyperspectral imageryIEEE Transactions on Geoscience and Remote Sensing, 2001
- Nonlinear total variation based noise removal algorithmsPhysica D: Nonlinear Phenomena, 1992