4.7 Article

Nonlocal Tensor-Based Sparse Hyperspectral Unmixing

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TGRS.2020.3030233

关键词

Hyperspectral unmixing; joint sparsity; low-rank; nonlocal similarity; tensor

资金

  1. NSFC [61772003, 61876203, 61702083]
  2. Key Projects of Applied Basic Research in Sichuan Province [2020YJ0216]
  3. Science Strength Promotion Program of UESTC
  4. Fundamental Research Funds for the Central Universities [ZYGX2019J093]

向作者/读者索取更多资源

Sparse unmixing is an important technique for analyzing hyperspectral images, and this article proposes a nonlocal tensor-based sparse unmixing algorithm that groups similar patches in the image and applies low-rank constraint and joint sparsity for accurate abundance estimation. The effectiveness of the algorithm is demonstrated through experiments with simulated and real hyperspectral data sets.
Sparse unmixing is an important technique for analyzing and processing hyperspectral images (HSIs). Simultaneously exploiting spatial correlation and sparsity improves substantially abundance estimation accuracy. In this article, we propose to exploit nonlocal spatial information in the HSI for the sparse unmixing problem. Specifically, we first group similar patches in the HSI, and then unmix each group by imposing simultaneous a low-rank constraint and joint sparsity in the corresponding third-order abundance tensor. To this end, we build an unmixing model with a mixed regularization term consisting of the sum of the weighted tensor trace norm and the weighted tensor l(2,1)-norm of the abundance tensor. The proposed model is solved under the alternating direction method of multipliers framework. We term the developed algorithm as the nonlocal tensor-based sparse unmixing algorithm. The effectiveness of the proposed algorithm is illustrated in experiments with both simulated and real hyperspectral data sets.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据