Hyperspectral Image Super-Resolution Algorithm Based on Graph Regular Tensor Ring Decomposition.

This paper introduces a novel hyperspectral image super-resolution algorithm based on graph-regularized tensor ring decomposition aimed at resolving the challenges of hyperspectral image super-resolution. This algorithm seamlessly integrates graph regularization and tensor ring decomposition, presenting an innovative fusion model that effectively leverages the spatial structure and spectral information inherent in hyperspectral images. At the core of the algorithm lies an iterative optimization process embedded within the objective function. This iterative process incrementally refines latent feature representations. It incorporates spatial smoothness constraints and graph regularization terms to enhance the quality of super-resolution reconstruction and preserve image features. Specifically, low-resolution hyperspectral images (HSIs) and high-resolution multispectral images (MSIs) are obtained through spatial and spectral downsampling, which are then treated as nodes in a constructed graph, efficiently fusing spatial and spectral information. By utilizing tensor ring decomposition, HSIs and MSIs undergo feature decomposition, and the objective function is formulated to merge reconstructed results with the original images. Through a multi-stage iterative optimization procedure, the algorithm progressively enhances latent feature representations, leading to super-resolution hyperspectral image reconstruction. The algorithm's significant achievements are demonstrated through experiments, producing sharper, more detailed high-resolution hyperspectral images (HRIs) with an improved reconstruction quality and retained spectral information. By combining the advantages of graph regularization and tensor ring decomposition, the proposed algorithm showcases substantial potential and feasibility within the domain of hyperspectral image super-resolution. [ABSTRACT FROM AUTHOR]