Robust Hyperspectral Unmixing with Correntropy based Metric
원문 초록
Hyperspectral unmixing is one of the crucial steps for many hyperspectral applications. The problem of hyperspectral unmixing has proven to be a difficult task in unsupervised work settings where the endmembers and abundances are both unknown. What is more, this task becomes more challenging in the case that the spectral bands are degraded with noise. This paper presents a robust model for unsupervised hyperspectral unmixing. Specifically, our model is developed with the correntropy based metric where the non-negative constraints on both endmembers and abundances are imposed to keep physical significance. In addition, a sparsity prior is explicitly formulated to constrain the distribution of the abundances of each endmember. To solve our model, a half-quadratic optimization technique is developed to convert the original complex optimization problem into an iteratively re-weighted NMF with sparsity constraints. As a result, the optimization of our model can adaptively assign small weights to noisy bands and give more emphasis on noise-free bands. In addition, with sparsity constraints, our model can naturally generate sparse abundances. Experiments on synthetic and real data demonstrate the effectiveness of our model in comparison to the related state-of-the-art unmixing models.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.