Structured Sparse Method for Hyperspectral Unmixing
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MultiHU-TD: Multifeature Hyperspectral Unmixing Based on Tensor Decomposition
UnMix-NeRF: Spectral Unmixing Meets Neural Radiance Fields
Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization
Learning Interpretable Deep Disentangled Neural Networks for Hyperspectral Unmixing
Image Processing and Machine Learning for Hyperspectral Unmixing: An Overview and the HySUPP Python Package
Dynamical Hyperspectral Unmixing with Variational Recurrent Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.