Sublinear time, measurement-optimal, sparse recovery for all

zbMATH Open1414.68148arXiv1012.1886MaRDI QIDQ5743471FDOQ5743471

Authors: Ely Porat, M. Strauss 

Publication date: 10 May 2019

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

Recommendations

• Approximate sparse recovery: optimizing time and measurements
• Approximate sparse recovery: optimizing time and measurements
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Analysis of algorithms (68W40) Approximation algorithms (68W25)

Cites Work

• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Title not available (Why is that?)
• Probability and Computing
• Concentration of Measure for the Analysis of Randomized Algorithms
• Title not available (Why is that?)
• Approximate sparse recovery: optimizing time and measurements
• Combinatorial Algorithms for Compressed Sensing
• Lower bounds for sparse recovery
• Title not available (Why is that?)
• LATIN 2004: Theoretical Informatics

Cited In (8)

• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
• Stronger \(\ell_2/\ell_2\) compressed sensing; without iterating
• Approximate sparse recovery: optimizing time and measurements
• Approximate sparse recovery: optimizing time and measurements
• Nearly linear-time model-based compressive sensing
• Adaptive sparse recovery with limited adaptivity
• A general theory for subspace-sparse recovery
• On fast decoding of high-dimensional signals from one-bit measurements

Uses Software

• CoSaMP

This page was built for publication: Sublinear time, measurement-optimal, sparse recovery for all

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