Compared with traditional remote sensing images, hyperspectral images have the advantages of high spectral resolution, combining images with spectrum, and continuous spectrum. The phenomenon of mixed pixels in hyperspectral images seriously affects the accuracy of distinguishing objects on the ground, and has always been an important problem that hinders the further development of this technology. The most effective way to solve the mixed pixel problem is to perform mixed pixel unmixing. The purpose of hyperspectral unmixing is to obtain pure spectrum (endmembers) and their corresponding proportions (abundance). The nonnegative matrix factorization (NMF) technique has been widely adopted in the hyperspectral images unmixing problem due to its own advantages. The NMF method based on sparsity constraint can achieve better unmixing effect because of fully using of the sparse characteristic of the data. However, the unmixing model based on the sparse NMF still has shortcomings. Hyperspectral images contain a large amount of geometric structural information, which is not considered by most existing sparse NMF methods. To address those shortcomings, new regularization terms and weights can be introduced into the NMF model to better promote the unmixing performance. To solve this problem, a novel unmixing algorithm named spatial-spectral graph regularized sparse non-negative matrix factorization (SSGNMF) algorithm is proposed in this paper. Most of the sparse constrained unmixing algorithms have the problem of insufficient prior representation of abundance sparsity and using of spatial information insufficiently. On the one hand, the model of SSGNMF introduces graph regularization to preserve high-dimensional spatial information in hyperspectral images. On the other hand, the spatial weighting factor enables more spatial information to be incorporated into the unmixing model, and the spectral weighting factor can promote row sparsity of abundance matrices. By comparing with other classical algorithms, simulated and real hyperspectral data experimental results demonstrate that the introduction of dual weights and graph regularization can improve the unmixing effect, which verifies the validity of this algorithm. In addition, the experimental results also show that the graph regularization term and dual weights introduced in the NMF model in this paper can indeed promote the hyperspectral image unmixing performance well.
Hyperspectral unmixing aims to correctly estimate the endmembers and their corresponding abundance fractions in an HSI. Many hyperspectral unmixing methods have been proposed, including the longstanding geometry-based, statistics-based and non-negative matrix factorization (NMF)-based unmixing methods. The traditional NMF-based method expands the three-dimensional hyperspectral data into matrix form and decomposes it into the product of the endmember and the abundance, which causes a certain degree of information loss. The matrix-vector nonnegative tensor factorization algorithm solves this problem well by processing hyper-spectral data as a tensor and pioneers a new model based on tensor decomposition. However, such methods still suffer from underutilization of image information and unstable performance at low signal-to-noise ratios (SNR). To solve this problem, we proposed a new superpixel-based spatial weighted sparse nonnegative tensor factorization unmixing model (SupSWNTF), which better exploits the spatial information and improve the sparsity of the solution by adding constraints to the abundance matrix. A series of comparative experimental results on synthetic and real-world data sets show that our algorithm achieves the best unmixing results compared to other state-of-the-art algorithms.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.