An efficient algorithm for compression-based compressed sensing
From MaRDI portal
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Abstract: Modern image and video compression codes employ elaborate structures existing in such signals to encode them into few number of bits. Compressed sensing recovery algorithms on the other hand use such signals' structures to recover them from few linear observations. Despite the steady progress in the field of compressed sensing, structures that are often used for signal recovery are still much simpler than those employed by state-of-the-art compression codes. The main goal of this paper is to bridge this gap through answering the following question: Can one employ a given compression code to build an efficient (polynomial time) compressed sensing recovery algorithm? In response to this question, the compression-based gradient descent (C-GD) algorithm is proposed. C-GD, which is a low-complexity iterative algorithm, is able to employ a generic compression code for compressed sensing and therefore elevates the scope of structures used in compressed sensing to those used by compression codes. The convergence performance of C-GD and its required number of measurements in terms of the rate-distortion performance of the compression code are theoretically analyzed. It is also shown that C-GD is robust to additive white Gaussian noise. Finally, the presented simulation results show that combining C-GD with commercial image compression codes such as JPEG2000 yields state-of-the-art performance in imaging applications.
Recommendations
Cited in
(12)- Exploiting prior knowledge in compressed sensing to design robust systems for endoscopy image recovery
- Compressed-sensing-based gradient reconstruction for ghost imaging
- Non-iterative CS recovery algorithm for surveillance applications: subjective and real-time experience
- A provably convergent scheme for compressive sensing under random generative priors
- Approximation Algorithms for Model-Based Compressive Sensing
- A reconstruction algorithm for speech compressive sensing using structural features
- A robust and efficient algorithm for distributed compressed sensing
- Edge guided reconstruction for compressive imaging
- MB-DAMPNet: a novel multi-branch denoising-based approximate message passing algorithm via deep neural network for image reconstruction
- Image decoding optimization based on compressive sensing
- A fast recovery method of 2D geometric compressed sensing signal
- From compression to compressed sensing
This page was built for publication: An efficient algorithm for compression-based compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006496)