Combinatorial Algorithms for Compressed Sensing

DOI10.1007/11780823_22zbMath1222.94016OpenAlexW2973707709MaRDI QIDQ3613658

No author found.

Publication date: 12 March 2009

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4785

Mathematics Subject Classification ID

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

Related Items

Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Improved sparse Fourier approximation results: Faster implementations and stronger guarantees ⋮ Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Strengthening hash families and compressive sensing ⋮ Simple Codes and Sparse Recovery with Fast Decoding ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Inferring Sparse Preference Lists from Partial Information ⋮ Static Risk-Based Group Testing Schemes Under Imperfectly Observable Risk ⋮ Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time ⋮ Row products of random matrices ⋮ Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) ⋮ Combinatorial sublinear-time Fourier algorithms ⋮ Deterministic \(k\)-set structure ⋮ A note on compressed sensing and the complexity of matrix multiplication ⋮ Subquadratic non-adaptive threshold group testing ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ CoSaMP: Iterative signal recovery from incomplete and inaccurate samples ⋮ Sparse Recovery with Partial Support Knowledge ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions