Hyperspectral Unmixing via L₁/₂ Sparsity-Constrained Nonnegative Matrix Factorization

Hyperspectral unmixing is a crucial preprocessing step for material classification and recognition. In the last decade, nonnegative matrix factorization (NMF) and its extensions have been intensively studied to unmix hyperspectral imagery and recover the material end-members. As an important constraint for NMF, sparsity has been modeled making use of the L₁ regularizer. Unfortunately, the L₁ regularizer cannot enforce further sparsity when the full additivity constraint of material abundances is used, hence limiting the practical efficacy of NMF methods in hyperspectral unmixing. In this paper, we extend the NMF method by incorporating the L₁/₂ sparsity constraint, which we name L₁/₂ -NMF. The L₁/₂ regularizer not only induces sparsity but is also a better choice among Lₐ (0 regularizers. We propose an iterative estimation algorithm for L₁/₂ -NMF, which provides sparser and more accurate results than those delivered using the L₁ norm. We illustrate the utility of our method on synthetic and real hyperspectral data and compare our results to those yielded by other state-of-the-art methods.