Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing

DOI10.1109/TSP.2015.2412912MaRDI QIDQ4580601zbMATH OpenOpenAlexFDO

Authors Adam C. Polak, Marco F. Duarte, Dennis Goeckel

Publication date 22 August 2018

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

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Compressive sensing (CS) allows for acquisition of sparse signals at sampling rates significantly lower than the Nyquist rate required for bandlimited signals. Recovery guarantees for CS are generally derived based on the assumption that measurement projections are selected independently at random. However, for many practical signal acquisition applications, including medical imaging and remote sensing, this assumption is violated as the projections must be taken in groups. In this paper, we consider such applications and derive requirements on the number of measurements needed for successful recovery of signals when groups of dependent projections are taken at random. We find a penalty factor on the number of required measurements with respect to the standard CS scheme that employs conventional independent measurement selection and evaluate the accuracy of the predicted penalty through simulations.

Recommendations

• Tight Performance Bounds for Compressed Sensing With Conventional and Group Sparsity
• Error bounds for compressed sensing algorithms with group sparsity: A unified approach
• Compressed Sensing Performance Bounds Under Poisson Noise
• Two new approaches to compressed sensing exhibiting both robust sparse recovery and the grouping effect
• Sparsity and incoherence in compressive sampling
• On Asymptotic Incoherence and Its Implications for Compressed Sensing of Inverse Problems
• Performance Bounds for Expander-Based Compressed Sensing in Poisson Noise
• Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
• On the Achievability of Cramér–Rao Bound in Noisy Compressed Sensing
• Boolean Compressed Sensing and Noisy Group Testing

Cited in

(1)

• Compressed sensing with structured sparsity and structured acquisition

This page was built for publication: Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing

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