Efficient and Robust Compressed Sensing Using Optimized Expander Graphs

DOI10.1109/TIT.2009.2025528MaRDI QIDQ4973998zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Sina Jafarpour, Weiyu Xu, Robert Calderbank, B. Hassibi

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2009.2025528

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Connectivity (05C40) Sampling theory in information and communication theory (94A20)

Cited in

(11)

• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
• Discrete optimization methods for group model selection in compressed sensing
• Peeling decoding of LDPC codes with applications in compressed sensing
• Expander \(\ell_0\)-decoding
• Deterministic construction of sparse binary matrices via incremental integer optimization
• Sampling in the analysis transform domain
• Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
• Simple Codes and Sparse Recovery with Fast Decoding
• A hierarchical framework for recovery in compressive sensing
• Strengthening hash families and compressive sensing
• A novel compressed sensing scheme for photoacoustic tomography

This page was built for publication: Efficient and Robust Compressed Sensing Using Optimized Expander Graphs

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