Compressive sensing in signal processing: algorithms and transform domain formulations
Summary: Compressive sensing has emerged as an area that opens new perspectives in signal acquisition and processing. It appears as an alternative to the traditional sampling theory, endeavoring to reduce the required number of samples for successful signal reconstruction. In practice, compressive sensing aims to provide saving in sensing resources, transmission, and storage capacities and to facilitate signal processing in the circumstances when certain data are unavailable. To that end, compressive sensing relies on the mathematical algorithms solving the problem of data reconstruction from a greatly reduced number of measurements by exploring the properties of sparsity and incoherence. Therefore, this concept includes the optimization procedures aiming to provide the sparsest solution in a suitable representation domain. This work, therefore, offers a survey of the compressive sensing idea and prerequisites, together with the commonly used reconstruction methods. Moreover, the compressive sensing problem formulation is considered in signal processing applications assuming some of the commonly used transformation domains, namely, the Fourier transform domain, the polynomial Fourier transform domain, Hermite transform domain, and combined time-frequency domain.
- A mathematical introduction to compressive sensing
- Compressed sensing
- Compressive sensing approach in the Hermite transform domain
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Efficient Compression of QRS Complexes Using Hermite Expansion
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Matching pursuits with time-frequency dictionaries
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling theory. Beyond bandlimited systems
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparsity and incoherence in compressive sampling
- Structured Compressed Sensing: From Theory to Applications
- Compressive sensing approach in the Hermite transform domain
- Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application
- Compressed sensing in the spherical near-field to far-field transformation
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- Compressed Signal Processing on Nyquist-Sampled Signals
- Memory-efficient structured convex optimization via extreme point sampling
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
- JPEG lifting algorithm based on adaptive block compressed sensing
This page was built for publication: Compressive sensing in signal processing: algorithms and transform domain formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793545)
