Non-Negative Matrix Factorization with Averaged Kurtosis and Manifold Constraints for Blind Hyperspectral Unmixing

Abstract

The Nonnegative Matrix Factorization (NMF) algorithm and its variants have gained widespread popularity across various domains, including neural networks, text clustering, image processing, and signal analysis. In the context of hyperspectral unmixing (HU), an important task involving the accurate extraction of endmembers from mixed spectra, researchers have been actively exploring different regularization techniques within the traditional NMF framework. These techniques aim to improve the precision and reliability of the endmember extraction process in HU. In this study, we propose a novel HU algorithm called KMBNMF, which introduces an average kurtosis regularization term based on endmember spectra to enhance endmember extraction, additionally, it integrates a manifold regularization term into the average kurtosis-constrained NMF by constructing a symmetric weight matrix. This combination of these two regularization techniques not only optimizes the extraction process of independent endmembers but also improves the part-based representation capability of hyperspectral data. Experimental results obtained from simulated and real-world hyperspectral datasets demonstrate the competitive performance of the proposed KMBNMF algorithm when compared to state-of-the-art algorithms.

Keywords

• hyperspectral images (HSIs)
• nonnegative matrix factorization (NMF)
• manifold constraints
• average kurtosis constraints
• hyperspectral unmixing (HU)