4.7 Article

Hyperspectral Super-Resolution via Interpretable Block-Term Tensor Modeling

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSTSP.2020.3045965

关键词

Hyperspectral super-resolution; block-term tensor decomposition; recoverability; regularization

资金

  1. National Natural Science Foundation of China (NSFC) [61772003, 61876203]
  2. Key Projects of Applied Basic Research in Sichuan Province [2020YJ0216]
  3. Applied Basic Research Project of Sichuan Province [21YYJC3042]
  4. National Science Foundation (NSF) [ECCS1608961, ECCS 1808159, ECCS 2024058]
  5. Army Research Office (ARO) [ARO W911NF-19-1-0247]
  6. NSFC [62071096, U19B2014, 62001089]
  7. Foundation of National Key Laboratory of Science, and Technology on Communications
  8. Innovation Fund of NCL (IFN) [IFN2019102]

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

This research introduces a method that utilizes coupled LL1 tensor decomposition model to address HSR problems, ensuring recoverability of SRI under mild conditions and interpretable latent factors as key constituents of spectral images. This approach allows for incorporating prior information to enhance performance.
Hyperspectral super-resolution (HSR) aims at fusing a pair of hyperspectral and multispectral images to recover a superresolution image (SRI). This work revisits coupled tensor decomposition (CTD)-based HSR. The vast majority of the HSR approaches take a low-rank matrix recovery perspective. The challenge is that theoretical guarantees for recovering the SRI using low-rank matrix models are either elusive or derived under stringent conditions. A couple of recent CTD-based methods ensure recoverability for the SRI under relatively mild conditions, leveraging algebraic properties of the canonical polyadic decomposition (CPD) and the Tucker decomposition models, respectively. However, the latent factors of both the CPD and Tucker models have no physical interpretations in the context of spectral image analysis, which makes incorporating prior information challenging-but using priors is often essential for enhancing performance in noisy environments. This work employs an idea that models spectral images as tensors following the block-term decomposition model with multilinear rank-(L-r, L-r, 1) terms (i.e., the LL1 model) and formulates the HSR problem as a coupled LL1 tensor decomposition problem. Similar to the existing CTD approaches, recoverability of the SRI is shown under mild conditions. More importantly, the latent factors of the LL1 model can be interpreted as the key constituents of spectral images, i.e., the endmembers' spectral signatures and abundance maps. This connection allows us to incorporate prior information for performance enhancement. A flexible algorithmic framework that can work with a series of structural information is proposed to take advantages of the model interpretability. The effectiveness is showcased using simulated and real data.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据