Study of the gOMP Algorithm for Recovery of Compressed Sensed Hyperspectral Images

• URL: http://arxiv.org/abs/2401.14786v1
• Date: Fri, 26 Jan 2024 11:20:11 GMT
• Title: Study of the gOMP Algorithm for Recovery of Compressed Sensed Hyperspectral Images
• Authors: Jon Alvarez Justo, Milica Orlandic
• Abstract summary: This work studies a data sparsification pre-processing stage prior to compression to ensure the sparsity of the pixels. Since the image pixels are not strictly sparse, this work studies a data sparsification pre-processing stage prior to compression to ensure the sparsity of the pixels.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hyperspectral Imaging (HSI) is used in a wide range of applications such as remote sensing, yet the transmission of the HS images by communication data links becomes challenging due to the large number of spectral bands that the HS images contain together with the limited data bandwidth available in real applications. Compressive Sensing reduces the images by randomly subsampling the spectral bands of each spatial pixel and then it performs the image reconstruction of all the bands using recovery algorithms which impose sparsity in a certain transform domain. Since the image pixels are not strictly sparse, this work studies a data sparsification pre-processing stage prior to compression to ensure the sparsity of the pixels. The sparsified images are compressed $2.5\times$ and then recovered using the Generalized Orthogonal Matching Pursuit algorithm (gOMP) characterized by high accuracy, low computational requirements and fast convergence. The experiments are performed in five conventional hyperspectral images where the effect of different sparsification levels in the quality of the uncompressed as well as the recovered images is studied. It is concluded that the gOMP algorithm reconstructs the hyperspectral images with higher accuracy as well as faster convergence when the pixels are highly sparsified and hence at the expense of reducing the quality of the recovered images with respect to the original images.

Related papers

• HyperColorization: Propagating spatially sparse noisy spectral clues for reconstructing hyperspectral images [2.7214317850962106]
  We present a colorization to reconstruct hyperspectral images from a grayscale guide image and spatially sparse spectral clues. Our algorithm generalizes to varying spectral dimensions for hyperspectral images, and show that colorizing in a low-rank space reduces compute time and the impact of shot noise.
  arXiv  Detail & Related papers  (2024-03-18T16:33:43Z)
• A Comparative Study of Compressive Sensing Algorithms for Hyperspectral Imaging Reconstruction [2.485120307677001]
  This work addresses the recovery of hyperspectral images 2.5x compressed. The gOMP algorithm achieves superior accuracy and faster recovery in comparison to the other algorithms.
  arXiv  Detail & Related papers  (2024-01-26T10:38:39Z)
• Hyperspectral Image Compression Using Sampling and Implicit Neural Representations [2.3931689873603603]
  Hyperspectral images record the electromagnetic spectrum for a pixel in the image of a scene. With the decreasing cost of capturing these images, there is a need to develop efficient techniques for storing, transmitting, and analyzing hyperspectral images. This paper develops a method for hyperspectral image compression using implicit neural representations.
  arXiv  Detail & Related papers  (2023-12-04T01:10:04Z)
• Restoration of the JPEG Maximum Lossy Compressed Face Images with Hourglass Block based on Early Stopping Discriminator [0.0]
  This paper addresses the restoration of JPEG images that have suffered significant loss due to maximum compression using a GAN-based net-work method. The network incorporates two loss functions, LF Loss and HF Loss, to generate natural and high-performance images. Results show that the blocking phe-nomenon in lost compressed images was removed, and recognizable identities were generated.
  arXiv  Detail & Related papers  (2023-06-22T09:21:48Z)
• Gated Multi-Resolution Transfer Network for Burst Restoration and Enhancement [75.25451566988565]
  We propose a novel Gated Multi-Resolution Transfer Network (GMTNet) to reconstruct a spatially precise high-quality image from a burst of low-quality raw images. Detailed experimental analysis on five datasets validates our approach and sets a state-of-the-art for burst super-resolution, burst denoising, and low-light burst enhancement.
  arXiv  Detail & Related papers  (2023-04-13T17:54:00Z)
• Analysis of the Effect of Low-Overhead Lossy Image Compression on the Performance of Visual Crowd Counting for Smart City Applications [78.55896581882595]
  Lossy image compression techniques can reduce the quality of the images, leading to accuracy degradation. In this paper, we analyze the effect of applying low-overhead lossy image compression methods on the accuracy of visual crowd counting.
  arXiv  Detail & Related papers  (2022-07-20T19:20:03Z)
• Compressed Smooth Sparse Decomposition [3.8644240125444]
  We propose a fast and data-efficient method with theoretical performance guarantee for sparse anomaly detection in images. The proposed method, named Compressed Smooth Sparse Decomposition (CSSD), is a one-step method that unifies the compressive image acquisition and decomposition-based image processing techniques. Compared to traditional smooth and sparse decomposition algorithms, significant transmission cost reduction and computational speed boost can be achieved with negligible performance loss.
  arXiv  Detail & Related papers  (2022-01-19T03:50:41Z)
• Implicit Neural Representations for Image Compression [103.78615661013623]
  Implicit Neural Representations (INRs) have gained attention as a novel and effective representation for various data types. We propose the first comprehensive compression pipeline based on INRs including quantization, quantization-aware retraining and entropy coding. We find that our approach to source compression with INRs vastly outperforms similar prior work.
  arXiv  Detail & Related papers  (2021-12-08T13:02:53Z)
• Hyperspectral Image Super-resolution via Deep Progressive Zero-centric Residual Learning [62.52242684874278]
  Cross-modality distribution of spatial and spectral information makes the problem challenging. We propose a novel textitlightweight deep neural network-based framework, namely PZRes-Net. Our framework learns a high resolution and textitzero-centric residual image, which contains high-frequency spatial details of the scene.
  arXiv  Detail & Related papers  (2020-06-18T06:32:11Z)
• 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)
• Discernible Image Compression [124.08063151879173]
  This paper aims to produce compressed images by pursuing both appearance and perceptual consistency. Based on the encoder-decoder framework, we propose using a pre-trained CNN to extract features of the original and compressed images. Experiments on benchmarks demonstrate that images compressed by using the proposed method can also be well recognized by subsequent visual recognition and detection models.
  arXiv  Detail & Related papers  (2020-02-17T07:35:08Z)

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.