GPU-Accelerated Algorithms for Compressed Signals Recovery with Application to Astronomical Imagery Deblurring

07/07/2017
by   Attilio Fiandrotti, et al.
0

Compressive sensing promises to enable bandwidth-efficient on-board compression of astronomical data by lifting the encoding complexity from the source to the receiver. The signal is recovered off-line, exploiting GPUs parallel computation capabilities to speedup the reconstruction process. However, inherent GPU hardware constraints limit the size of the recoverable signal and the speedup practically achievable. In this work, we design parallel algorithms that exploit the properties of circulant matrices for efficient GPU-accelerated sparse signals recovery. Our approach reduces the memory requirements, allowing us to recover very large signals with limited memory. In addition, it achieves a tenfold signal recovery speedup thanks to ad-hoc parallelization of matrix-vector multiplications and matrix inversions. Finally, we practically demonstrate our algorithms in a typical application of circulant matrices: deblurring a sparse astronomical image in the compressed domain.

READ FULL TEXT

page 7

page 23

research
03/16/2020

Metrics for Evaluating the Efficiency of Compressing Sensing Techniques

Compressive sensing has been receiving a great deal of interest from res...
research
10/30/2019

Superset Technique for Approximate Recovery in One-Bit Compressed Sensing

One-bit compressed sensing (1bCS) is a method of signal acquisition unde...
research
11/17/2021

Accelerating JPEG Decompression on GPUs

The JPEG compression format has been the standard for lossy image compre...
research
07/25/2015

Making sense of randomness: an approach for fast recovery of compressively sensed signals

In compressed sensing (CS) framework, a signal is sampled below Nyquist ...
research
10/04/2019

GPU Fast Convolution via the Overlap-and-Save Method in Shared Memory

We present an implementation of the overlap-and-save method, a method fo...
research
12/20/2019

Covering point-sets with parallel hyperplanes and sparse signal recovery

Let S be a set of k > n points in a Euclidean space R^n, n ≥ 1. How many...
research
09/08/2020

GPU Parallel Computation of Morse-Smale Complexes

The Morse-Smale complex is a well studied topological structure that rep...

Please sign up or login with your details

Forgot password? Click here to reset