L1/2 Sparsity Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing
MetadataShow full item record
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, sparsity has been modeled making use of L1 or L2 regularizers. However, the full additivity constraint of material abundances is often overlooked, hence, limiting the practical efficacy of these methods. In this paper, we extend the NMF algorithm by incorporating the L1/2 sparsity constraint. The L1/2-NMF provides more sparse and accurate results than the other regularizers by considering the end-member additivity constraint explicitly in the optimisation process. Experiments on the synthetic and real hyperspectral data validate the proposed algorithm.
Proceedings of Digital Image Computing: Techniques and Applications
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Pattern Recognition and Data Mining