Iterative hard thresholding for compressed sensing

DOI10.1016/j.acha.2009.04.002zbMath1174.94008arXiv0805.0510MaRDI QIDQ734323

Thomas Blumensath, Michael E. Davies

Publication date: 20 October 2009

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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

zbMATH Keywords

sampling theory; signal reconstruction; iterative hard thresholding; sampling algorithms; sparse inverse problem

Mathematics Subject Classification ID

94A13: Detection theory in information and communication theory

94A20: Sampling theory in information and communication theory

Related Items

An adaptive inverse scale space method for compressed sensing, $\ell _0$ Minimization for wavelet frame based image restoration, The essential ability of sparse reconstruction of different compressive sensing strategies, Sparse microwave imaging: principles and applications, Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain, Restricted isometries for partial random circulant matrices, Sparse Legendre expansions via \(\ell_1\)-minimization, Compressive sensing of analog signals using discrete prolate spheroidal sequences, Convergence of fixed-point continuation algorithms for matrix rank minimization, Gradient iteration with \(\ell _{p}\)-norm constraints, A non-adapted sparse approximation of PDEs with stochastic inputs, Compressed sensing with coherent and redundant dictionaries, Phase transitions for greedy sparse approximation algorithms, Projected gradient iteration for nonlinear operator equation, Democracy in action: quantization, saturation, and compressive sensing, A note on the complexity of \(L _{p }\) minimization, On support sizes of restricted isometry constants, Iterative hard thresholding for compressed sensing, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Sparse signal recovery via ECME thresholding pursuits, Improved sparse Fourier approximation results: Faster implementations and stronger guarantees, Greedy-like algorithms for the cosparse analysis model, Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices, Wavelet optimal estimations for a density with some additive noises, Optimized projections for compressed sensing via rank-constrained nearest correlation matrix, Nonlinear regularization techniques for seismic tomography, Average Performance of the Sparsest Approximation Using a General Dictionary

Uses Software

• DT-CWT
• CoSaMP

Cites Work

• Unnamed Item
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Uniform uncertainty principle for Bernoulli and subgaussian ensembles
• Reconstruction and subgaussian operators in asymptotic geometric analysis
• Quantitative robust uncertainty principles and optimally sparse decompositions
• On sparse reconstruction from Fourier and Gaussian measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Sampling signals with finite rate of innovation
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing