State of the Art and Prospects of Structured Sensing Matrices in Compressed Sensing

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 (8)

• Sparsity and Incoherence in Compressive Sampling
• Structured Compressed Sensing: From Theory to Applications
• Near-ideal model selection by ${\ell }_1$ minimization
• 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

Cited by in corpus (3)

• A Compressive Sensing Approach for Connected Vehicle Data Capture and Recovery and its Impact on Travel Time Estimation
• Efficient Collection of Connected Vehicle Data based on Compressive Sensing
• Capture and Recovery of Connected Vehicle Data: A Compressive Sensing Approach