Abstract

The hyperspectral image superresolution (HSI-SR) problem aims to improve the spatial quality of a low spatial resolution HSI by fusing the LR-HSI with the corresponding high spatial resolution multispectral image. The generated HSI with high spatial quality, i.e., the target high spatial resolution hyperspectral image (HR-HSI), generally has some fundamental latent properties, e.g., the sparsity, and the piecewise smoothness along with the three modes (i.e., width, height, and spectral mode). However, limited works consider both properties in the HSI-SR problem. In this work, a novel unidirectional total variation (TV) based approach is been proposed. On the one hand, we consider that the target HR-HSI exhibits both the sparsity and the piecewise smoothness on the three modes, and they can be depicted well by the $\ell _1$ -norm and TV, respectively. On the other hand, we utilize the classical Tucker decomposition to decompose the target HR-HSI (a three-mode tensor) as a sparse core tensor multiplied by the dictionary matrices along with the three modes. Especially, we impose the $\ell _1$ -norm on core tensor to characterize the sparsity and the unidirectional TV on three dictionaries to characterize the piecewise smoothness. The proximal alternating optimization scheme and the alternating direction method of multipliers are used to iteratively solve the proposed model. Experiments on three common datasets illustrate that the proposed approach has better performance than some current state-of-the-art HSI-SR methods. Please find source code from: https://liangjiandeng.github.io/ .

Highlights

  • H YPERSPECTRAL images (HSIs) contain abundant spectral information because of the powerful capture ability of hyperspectral imaging sensors

  • We have presented a novel unidirectional TVbased approach for the hyperspectral image superresolution (HSI-SR) problem

  • We first consider that the target high spatial resolution hyperspectral image (HR-HSI) exhibits both the sparsity and the piecewise smoothness on the three modes and utilize the classical Tucker decomposition to decompose the target HR-HSI as a sparse core tensor multiplied by the dictionary matrices along with the three modes

Read more

Summary

INTRODUCTION

H YPERSPECTRAL images (HSIs) contain abundant spectral information because of the powerful capture ability of hyperspectral imaging sensors. Dian et al [34] first proposed a nonlocal sparse tensor factorization approach used for the HSI-SR problem, where they first divided the target HR-HSI as some cubes and utilized the classical Tucker decomposition to factorize each cube as a sparse core tensor multiplied by dictionary matrices with three modes. Dian et al [38] gave a subspace-based low tensor multirank regularization (LTMR) approach, where they approximated the HR-HSI by spectral subspace and the coefficients They obtained the spectral subspace by singular value decomposition, the corresponding coefficients were generated by utilizing the LTMR prior.

Notations and Preliminaries
Related Works
Proposed Model
Motivations
PROPOSED ALGORITHM
Optimization Problem of U1
Optimization Problem of U2
Optimization Problem of U3
Optimization Problem of G
Termination Criterion for Algorithms 1–4
Convergence of the Proposed Algorithm
Computational Complexity of the Proposed Algorithm
Compared Algorithms
Datasets
Parameters Discussion
Quantitative Metrics
Experimental Results
Discussion
CONCLUSION
OPTIMIZATION PROBLEM OF U1
OPTIMIZATION PROBLEM OF U2
OPTIMIZATION PROBLEM OF U3
OPTIMIZATION PROBLEM OF G
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call