Fast and Efficient Compressive Sensing Using Structurally Random Matrices

DOI10.1109/TSP.2011.2170977MaRDI QIDQ4573433zbMATH OpenFDO

Authors

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.5037

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Large deviations (60F10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

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.

Cited in

(12)

• Signal recovery under cumulative coherence
• Channel estimation for finite scatterers massive multi-user MIMO system
• A block compressive sensing based scalable encryption framework for protecting significant image regions
• An orthogonal method for measurement matrix optimization
• Sampling, denoising and compression of matrices by coherent matrix organization
• The restricted isometry property for random block diagonal matrices
• Differential pulse code modulation and motion aligned optimal reconstruction for block-based compressive video sensing using conditional autoregressive-salp swarm algorithm
• A class of cross-layer optimization design for congestion and energy efficiency with compressed sensing in wireless sensing networks
• Compressing Rank-Structured Matrices via Randomized Sampling
• Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
• Near-optimal tensor recovery guarantees for transformed total variation minimization
• Deterministic construction of sparse binary matrices via incremental integer optimization

This page was built for publication: Fast and Efficient Compressive Sensing Using Structurally Random Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573433)