State of the Art and Prospects of Structured Sensing Matrices in Compressed Sensing
arXiv:1408.1391 · doi:10.1007/s11704-015-3326-8
Abstract
Compressed sensing (CS) enables people to acquire the compressed measurements directly and recover sparse or compressible signals faithfully even when the sampling rate is much lower than the Nyquist rate. However, the pure random sensing matrices usually require huge memory for storage and high computational cost for signal reconstruction. Many structured sensing matrices have been proposed recently to simplify the sensing scheme and the hardware implementation in practice. Based on the restricted isometry property and coherence, couples of existing structured sensing matrices are reviewed in this paper, which have special structures, high recovery performance, and many advantages such as the simple construction, fast calculation and easy hardware implementation. The number of measurements and the universality of different structure matrices are compared.
References in corpus (12)
- Sparsity and Incoherence in Compressive Sampling
- From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
- Structured Compressed Sensing: From Theory to Applications
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Fast and Efficient Compressive Sensing using Structurally Random Matrices
- Near-ideal model selection by minimization
- Construction of a Large Class of Deterministic Sensing Matrices that Satisfy a Statistical Isometry Property
- Statistical physics-based reconstruction in compressed sensing
- Projection Design For Statistical Compressive Sensing: A Tight Frame Based Approach
- Convolutional Compressed Sensing Using Deterministic Sequences
- Deterministic Designs with Deterministic Guarantees: Toeplitz Compressed Sensing Matrices, Sequence Designs and System Identification
- A Sublinear Algorithm for Sparse Reconstruction with l2/l2 Recovery Guarantees