2014/03/19 by Feiyun Zhu, Ying Wang, Zhu, Feiyun +7
Computer Science · Engineering · #Advanced Image Fusion Techniques #Artificial Intelligence (cs.AI) #Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #Geochemistry and Geologic Mapping #Remote-Sensing Image Classification #cs.AI #cs.CV
paper · pdf · doi:10.48550/arxiv.1403.4682
arxiv created 2014/03/19 · openalex publication_date 2014/03/19 · arxiv updated 2014/07/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Hyperspectral Unmixing (HU) has received increasing attention in the past decades due to its ability of unveiling information latent in hyperspectral data. Unfortunately, most existing methods fail to take advantage of the spatial information in data. To overcome this limitation, we propose a Structured Sparse regularized Nonnegative Matrix Factorization (SS-NMF) method from the following two aspects. First, we incorporate a graph Laplacian to encode the manifold structures embedded in the hyperspectral data space. In this way, the highly similar neighboring pixels can be grouped together. Second, the lasso penalty is employed in SS-NMF for the fact that pixels in the same manifold structure are sparsely mixed by a common set of relevant bases. These two factors act as a new structured sparse constraint. With this constraint, our method can learn a compact space, where highly similar pixels are grouped to share correlated sparse representations. Experiments on real hyperspectral data sets with different noise levels demonstrate that our method outperforms the state-of-the-art methods significantly.