Instance optimal decoding by thresholding in compressed sensing

MaRDI QIDQ3560538zbMATH OpenFDO

Authors Albert Cohen, Wolfgang Dahmen, Ronald DeVore

Publication date 14 May 2010

zbMATH Keywords

\texttt{COSAMP}\texttt{SThresh}compressed sensinginstance optimal decodersthresholding

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Probabilistic methods, stochastic differential equations (65C99) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Sparse recovery by non-convex optimization - instance optimality
• Dictionary-sparse recovery via thresholding-based algorithms
• Instance-optimality in probability with an \(\ell _1\)-minimization decoder
• Hard thresholding pursuit: an algorithm for compressive sensing
• Stability and instance optimality for Gaussian measurements in compressed sensing

Cited in

(4)

• Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
• Phase transitions for greedy sparse approximation algorithms
• Introduction: Wolfgang Dahmen's mathematical work (as of 2009)
• Instance-optimality in probability with an \(\ell _1\)-minimization decoder

This page was built for publication: Instance optimal decoding by thresholding in compressed sensing

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