A manifold Hessian-regularized NMF for hyperspectral data unmixing

Abstract

ABSTRACTHyperspectral unmixing (HU) has drawn remarkable attention because it can decompose mixed pixels into a set of endmembers and abundance fractions. And the nonnegative matrix factorization (NMF) algorithm has been widely used for solving hyperspectral spectral unmixing problem. This letter proposes a Hessian graph regularized NMF (HGNMF) algorithm, which relies upon the construction of a Hessian graph representation, to solve the hyperspectral unmixing problem. According to the HGNMF algorithm, the smoothness in the estimated abundance maps is well promoted. Moreover, the optimized problem of HGNMF algorithm is also solved by employing the multiplicative updating rules. Compared to other algorithms, the proposed HGNMF algorithm demonstrates lots of advantages based on the simulated results of the synthetic data and real data sets.