Fast and Efficient Compressive Sensing using Structurally Random Matrices
arXiv:1106.5037 · doi:10.1109/TSP.2011.2170977
Abstract
This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework, we pre-randomize a sensing signal by scrambling its samples or flipping its sample signs and then fast-transform the randomized samples and finally, subsample the transform coefficients as the final sensing measurements. SRM is highly relevant for large-scale, real-time compressive sensing applications as it has fast computation and supports block-based processing. In addition, we can show that SRM has theoretical sensing performance comparable with that of completely random sensing matrices. Numerical simulation results verify the validity of the theory as well as illustrate the promising potentials of the proposed sensing framework.
References in corpus (1)
Cited by in corpus (29)
- Total Variation Regularized Tensor RPCA for Background Subtraction from Compressive Measurements
- Accelerated High-Resolution Photoacoustic Tomography via Compressed Sensing
- Bi-level Protected Compressive Sampling
- Compressed Sensing and Affine Rank Minimization under Restricted Isometry
- Sparse Signal Recovery via Generalized Entropy Functions Minimization
- Convolutional Compressed Sensing Using Deterministic Sequences
- Compressive Deconvolution in Medical Ultrasound Imaging
- Universal and efficient compressed sensing by spread spectrum and application to realistic Fourier imaging techniques
- Toward real-time quantum imaging with a single pixel camera
- Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means
- State of the Art and Prospects of Structured Sensing Matrices in Compressed Sensing
- Signal Recovery under Cumulative Coherence
- Single Pixel Polarimetric Imaging through Scattering Media
- Robust Coding of Encrypted Images via Structural Matrix
- Hyperspectral Image Recovery via Hybrid Regularization
- Modulated Unit-Norm Tight Frames for Compressed Sensing
- Image Compression Based on Compressive Sensing: End-to-End Comparison with JPEG
- High-quality Image Restoration from Partial Mixed Adaptive-Random Measurements
- Generalized Approximate Message Passing for Cosparse Analysis Compressive Sensing
- A Max-Product EM Algorithm for Reconstructing Markov-tree Sparse Signals from Compressive Samples
- Indistinguishability and Energy Sensitivity of Asymptotically Gaussian Compressed Encryption
- Efficient Dictionary Learning via Very Sparse Random Projections
- Embedding Cryptographic Features in Compressive Sensing
- Single-Pixel Compressive Imaging in Shift-Invariant Spaces via Exact Wavelet Frames
- Diffusion Adaptation Framework for Compressive Sensing Reconstruction
- Sparsification of Matrices and Compressed Sensing
- Restricted Structural Random Matrix for Compressive Sensing
- Multi-Scale Deep Compressive Imaging
- One-Pass Sparsified Gaussian Mixtures