Approximation-tolerant model-based compressive sensing

DOI10.1137/1.9781611973402.113MaRDI QIDQ5384075zbMATH OpenOpenAlexFDO

Authors Chinmay Hegde, Ludwig Schmidt, Piotr Indyk

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.113

zbMATH Keywords

sparse recoverymodel-based compressive sensing

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation algorithms (68W25) Sampling theory in information and communication theory (94A20)

Recommendations

• Nearly linear-time model-based compressive sensing
• Combinatorial Algorithms for Compressed Sensing
• Compressed sensing and best \(k\)-term approximation
• K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
• Compressed sensing

Cited in

(8)

• Model-based sketching and recovery with expanders
• Discrete optimization methods for group model selection in compressed sensing
• Nearly linear-time model-based compressive sensing
• Approximation Algorithms for Model-Based Compressive Sensing
• A smooth approximation to probability constrained optimization model in compressed sensing
• Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
• Sampling in the analysis transform domain
• Greedy signal space methods for incoherence and beyond

This page was built for publication: Approximation-tolerant model-based compressive sensing

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