A Generalized Tensor Formulation for Hyperspectral Image Super-Resolution Under General Spatial Blurring

• URL: http://arxiv.org/abs/2409.18731v1
• Date: Fri, 27 Sep 2024 13:23:17 GMT
• Title: A Generalized Tensor Formulation for Hyperspectral Image Super-Resolution Under General Spatial Blurring
• Authors: Yinjian Wang, Wei Li, Yuanyuan Gui, Qian Du, James E. Fowler,
• Abstract summary: Hyperspectral super-resolution is commonly accomplished by fusing a hyperspectral imaging of low spatial resolution with a multispectral image of high spatial resolution. It is assumed in such tensor-based methods that the spatial-blurring operation that creates the observed hyperspectral image from the desired super-resolved image is separable into independent horizontal and vertical blurring. Recent work has argued that such separable spatial degradation is ill-equipped to model the operation of real sensors which may exhibit, for example, anisotropic blurring.
• Score: 9.163087502142107
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hyperspectral super-resolution is commonly accomplished by the fusing of a hyperspectral imaging of low spatial resolution with a multispectral image of high spatial resolution, and many tensor-based approaches to this task have been recently proposed. Yet, it is assumed in such tensor-based methods that the spatial-blurring operation that creates the observed hyperspectral image from the desired super-resolved image is separable into independent horizontal and vertical blurring. Recent work has argued that such separable spatial degradation is ill-equipped to model the operation of real sensors which may exhibit, for example, anisotropic blurring. To accommodate this fact, a generalized tensor formulation based on a Kronecker decomposition is proposed to handle any general spatial-degradation matrix, including those that are not separable as previously assumed. Analysis of the generalized formulation reveals conditions under which exact recovery of the desired super-resolved image is guaranteed, and a practical algorithm for such recovery, driven by a blockwise-group-sparsity regularization, is proposed. Extensive experimental results demonstrate that the proposed generalized tensor approach outperforms not only traditional matrix-based techniques but also state-of-the-art tensor-based methods; the gains with respect to the latter are especially significant in cases of anisotropic spatial blurring.

Related papers

• Integrating Generative and Physics-Based Models for Ptychographic Imaging with Uncertainty Quantification [0.0]
  Ptychography is a scanning coherent diffractive imaging technique that enables imaging nanometer-scale features in extended samples. This paper proposes a Bayesian inversion method for ptychography that performs effectively even with less overlap between neighboring scan locations.
  arXiv  Detail & Related papers  (2024-12-14T16:16:37Z)
• Orthogonal Subspace Decomposition for Generalizable AI-Generated Image Detection [58.87142367781417]
  A naively trained detector tends to favor overfitting to the limited and monotonous fake patterns, causing the feature space to become highly constrained and low-ranked. One potential remedy is incorporating the pre-trained knowledge within the vision foundation models to expand the feature space. By freezing the principal components and adapting only the remained components, we preserve the pre-trained knowledge while learning forgery-related patterns.
  arXiv  Detail & Related papers  (2024-11-23T19:10:32Z)
• Irregular Tensor Low-Rank Representation for Hyperspectral Image Representation [71.69331824668954]
  Spectral variations pose a common challenge in analyzing hyperspectral images (HSI) Low-rank tensor representation has emerged as a robust strategy, leveraging inherent correlations within HSI data. We propose a novel model for irregular tensor lowrank representation tailored to efficiently model irregular 3D cubes.
  arXiv  Detail & Related papers  (2024-10-24T02:56:22Z)
• Hyperspectral and multispectral image fusion with arbitrary resolution through self-supervised representations [23.04458119996]
  We propose a novel continuous low-rank factorization (CLoRF) by integrating two neural representations into the matrix factorization. This approach enables us to harness both the low rankness from the matrix factorization and the continuity from neural representation in a self-supervised manner.
  arXiv  Detail & Related papers  (2024-05-28T04:29:23Z)
• Guided Deep Generative Model-based Spatial Regularization for Multiband Imaging Inverse Problems [14.908906329456842]
  We propose a generic framework able to capitalize on an auxiliary acquisition of high spatial resolution to derive tailored data-driven spatial regularizations. More precisely, the regularization is conceived as a deep generative network able to encode spatial semantic features contained in this auxiliary image of high spatial resolution.
  arXiv  Detail & Related papers  (2023-06-29T03:48:50Z)
• Deep Orthogonal Hypersphere Compression for Anomaly Detection [24.520413393132323]
  Many well-known and effective anomaly detection methods assume that a reasonable decision boundary has a hypersphere shape. In this paper, we first propose a novel deep anomaly detection model that improves the original hypersphere learning. We propose a bi-hypersphere compression method to obtain a hyperspherical shell that yields a more compact decision region than a hyperball.
  arXiv  Detail & Related papers  (2023-02-13T15:10:18Z)
• Hyperspectral Mixed Noise Removal via Subspace Representation and Weighted Low-rank Tensor Regularization [10.131033322742363]
  We employ subspace representation and the weighted low-rank tensor regularization (SWLRTR) into the model to remove the mixed noise in the hyperspectral image. Experiments demonstrate that the SWLRTR method performs better than other hyperspectral denoising methods quantitatively and visually.
  arXiv  Detail & Related papers  (2021-11-13T05:30:56Z)
• Learning Spatial-Spectral Prior for Super-Resolution of Hyperspectral Imagery [79.69449412334188]
  In this paper, we investigate how to adapt state-of-the-art residual learning based single gray/RGB image super-resolution approaches. We introduce a spatial-spectral prior network (SSPN) to fully exploit the spatial information and the correlation between the spectra of the hyperspectral data. Experimental results on some hyperspectral images demonstrate that the proposed SSPSR method enhances the details of the recovered high-resolution hyperspectral images.
  arXiv  Detail & Related papers  (2020-05-18T14:25:50Z)
• Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation [105.33409035876691]
  This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. We design a novel structured tensor low-rank norm tailored to MVSC. We show that the proposed method outperforms state-of-the-art methods to a significant extent.
  arXiv  Detail & Related papers  (2020-04-30T11:52:12Z)
• Hyperspectral-Multispectral Image Fusion with Weighted LASSO [68.04032419397677]
  We propose an approach for fusing hyperspectral and multispectral images to provide high-quality hyperspectral output. We demonstrate that the proposed sparse fusion and reconstruction provides quantitatively superior results when compared to existing methods on publicly available images.
  arXiv  Detail & Related papers  (2020-03-15T23:07:56Z)
• PULSE: Self-Supervised Photo Upsampling via Latent Space Exploration of Generative Models [77.32079593577821]
  PULSE (Photo Upsampling via Latent Space Exploration) generates high-resolution, realistic images at resolutions previously unseen in the literature. Our method outperforms state-of-the-art methods in perceptual quality at higher resolutions and scale factors than previously possible.
  arXiv  Detail & Related papers  (2020-03-08T16:44:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.