Recursive Recovery of Sparse Signal Sequences from Compressive Measurements: A Review
arXiv:1602.04518 · doi:10.1109/TSP.2016.2539138
Abstract
In this article, we review the literature on design and analysis of recursive algorithms for reconstructing a time sequence of sparse signals from compressive measurements. The signals are assumed to be sparse in some transform domain or in some dictionary. Their sparsity patterns can change with time, although, in many practical applications, the changes are gradual. An important class of applications where this problem occurs is dynamic projection imaging, e.g., dynamic magnetic resonance imaging (MRI) for real-time medical applications such as interventional radiology, or dynamic computed tomography.
To appear in IEEE Trans. Signal Processing
References in corpus (5)
Cited by in corpus (16)
- Prediction-Correction Algorithms for Time-Varying Constrained Optimization
- Time-Varying Convex Optimization via Time-Varying Averaged Operators
- Graph-based sequential beamforming
- Extrapolation-based Prediction-Correction Methods for Time-varying Convex Optimization
- Widely Distributed Radar Imaging: Unmediated ADMM Based Approach
- Massive Access in Cell-Free Massive MIMO-Based Internet of Things: Cloud Computing and Edge Computing Paradigms
- Convolutional Sparse Support Estimator Network (CSEN) From energy efficient support estimation to learning-aided Compressive Sensing
- Incorporating Prior Information in Compressive Online Robust Principal Component Analysis
- Multiple Support Recovery Using Very Few Measurements Per Sample
- Real-Time Reconstruction of Counting Process through Queues
- A Unified Algorithmic Framework for Dynamic Compressive Sensing
- Prediction-Correction for Nonsmooth Time-Varying Optimization via Forward-Backward Envelopes
- Non-Convex Structured Phase Retrieval
- Time-Varying Optimization: Algorithms and Engineering Applications
- Autonomous Tracking and State Estimation with Generalised Group Lasso
- Dynamic Sample Complexity for Exact Sparse Recovery using Sequential Iterative Hard Thresholding