返回
Pointwise Mutual Information-Based Graph Laplacian Regularized Sparse Unmixing
DOI:10.1109/LGRS.2022.3143302.png)
摘要
En 中文
Sparse unmixing (SU) aims to express the observed image signatures as a linear combination of pure spectra known a priori and has become a very popular technique with promising results in analyzing hyperspectral images (HSIs) over the past ten years. In SU, utilizing the spatial-contextual information allows for more realistic abundance estimation. To make full use of the spatial-spectral information, in this letter, we propose a pointwise mutual information (PMI)-based graph Laplacian (GL) regularization for SU. Specifically, we construct the affinity matrices via PMI by modeling the association between neighboring image features through a statistical framework and then we use them in the GL regularizer. We also adopt a double reweighted l(1) norm minimization scheme to promote the sparsity of fractional abundances. Experimental results on simulated and real datasets prove the effectiveness of the proposed method and its superiority over competing algorithms in the literature.
Keyword:
Graph regularization
hyperspectral unmixing
pointwise mutual information (PMI)
sparse regression
期刊
IF:
16.4
论文数:
1.0W
被引数:
5.1K
机构
引用论文
Hyperspectral Unmixing Using Double Reweighted Sparse Regression and Total Variation基于双重加权稀疏回归和总变异的高光谱解混
Sparse-Adaptive Hypergraph Discriminant Analysis for Hyperspectral Image Classification用于高光谱图像分类的稀疏自适应超图判别分析
Role of root exudates on assimilation of phosphorus in young and old Arabidopsis thaliana plants
PLOS ONE
IF0
Semisupervised Sparse Manifold Discriminative Analysis for Feature Extraction of Hyperspectral Images用于高光谱图像特征提取的半监督稀疏流形判别分析

