2022
DOI: 10.1109/tgrs.2022.3176266
|View full text |Cite
|
Sign up to set email alerts
|

An Iterative Regularization Method Based on Tensor Subspace Representation for Hyperspectral Image Super-Resolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(15 citation statements)
references
References 73 publications
0
15
0
Order By: Relevance
“…Factorizationbased methods mainly decompose the target image and then build an optimization model to solve. The factorization-based methods include matrix factorization-based methods [31]- [34] and tensor decomposition-based methods [35]- [43]. Matrix factorization-based methods primarily transform the fusion task into an estimation of the spectral basis and corresponding coefficients.…”
Section: A Model-based Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Factorizationbased methods mainly decompose the target image and then build an optimization model to solve. The factorization-based methods include matrix factorization-based methods [31]- [34] and tensor decomposition-based methods [35]- [43]. Matrix factorization-based methods primarily transform the fusion task into an estimation of the spectral basis and corresponding coefficients.…”
Section: A Model-based Methodsmentioning
confidence: 99%
“…Based on tensor ring decomposition, He et al [40] designed a model that iteratively obtain corresponding core tensors from LRHS and HRMS images. A regularization method was proposed by Xu et al [43], which integrated two priors simultaneously to estimate tensor subspace and tensor coefficients and obtained excellent super-resolution results.…”
Section: A Model-based Methodsmentioning
confidence: 99%
“…Secondly, the difficulty in obtaining MTF-filter parameters during the degradation process is a potential influencing factor. Alternatively, some researchers use uniform filtering [31,32] and Gaussian filtering [29,30,36] to implement the spatial degradation. The size and the variance of Gaussian kernels used are different, making the accuracy of spatial degradation unreliable.…”
Section: Fr Quality Assessmentmentioning
confidence: 99%
“…Tucker decomposition and Canonical polyadic (CP) decomposition are widely used. The representative TR-based fusion methods include coupled sparse tensor factorization [27], nonlocal coupled tensor CP [28], low tensor multi-rank regularization (LTMR) [29], low tensor-train rank representation [30], unidirectional total variation with tucker decomposition (UTV) [31], tensor subspace representation-based regularization model (IR-TenSR) [32]. The deep CNN-based methods often train a network between ground-truth images (i.e., original HS images) and input images (i.e., low spatial resolution HS and high spatial resolution MS images).…”
Section: Introductionmentioning
confidence: 99%
“…The experimental results demonstrate that this strategy can effectively preserve spatial detail information in the recovered image. Xu et al [31] utilized an iterative regularization technique based on tensor sub-space representation to amalgamate paired multispectral and hyperspectral images, thereby reconstructing high-resolution hyperspectral images with distinct texture and sharp edges. Hong et al [32] proposed a decoupled and coupled high-spectral-resolution image super-resolution algorithm that progressively aggregates high-spectral and multi-spectral information.…”
Section: B Remote Sensing Image Super-resolutionmentioning
confidence: 99%