Iterative hard thresholding for compressed sensing
From MaRDI portal
Abstract: Compressed sensing is a technique to sample compressible signals below the Nyquist rate, whilst still allowing near optimal reconstruction of the signal. In this paper we present a theoretical analysis of the iterative hard thresholding algorithm when applied to the compressed sensing recovery problem. We show that the algorithm has the following properties (made more precise in the main text of the paper) - It gives near-optimal error guarantees. - It is robust to observation noise. - It succeeds with a minimum number of observations. - It can be used with any sampling operator for which the operator and its adjoint can be computed. - The memory requirement is linear in the problem size. - Its computational complexity per iteration is of the same order as the application of the measurement operator or its adjoint. - It requires a fixed number of iterations depending only on the logarithm of a form of signal to noise ratio of the signal. - Its performance guarantees are uniform in that they only depend on properties of the sampling operator and signal sparsity.
Recommendations
- Hard thresholding pursuit: an algorithm for compressive sensing
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Dictionary-sparse recovery via thresholding-based algorithms
- Phase transitions for greedy sparse approximation algorithms
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
Cites work
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- On sparse reconstruction from Fourier and Gaussian measurements
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Reconstruction and subgaussian operators in asymptotic geometric analysis
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling signals with finite rate of innovation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
Cited in
(only showing first 100 items - show all)- Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion
- Sparse signal recovery via ECME thresholding pursuits
- DANTE: deep alternations for training neural networks
- Optimized projections for compressed sensing via rank-constrained nearest correlation matrix
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
- Newton-type optimal thresholding algorithms for sparse optimization problems
- \(h\)-\(p\) adaptive model based approximation of moment free sensitivity indices
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
- Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
- Modified iterations for data-sparse solution of linear systems
- Sparse approximate reconstruction decomposed by two optimization problems
- Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction
- Maximum correntropy adaptation approach for robust compressive sensing reconstruction
- Quantization and compressive sensing
- Optimization problems involving group sparsity terms
- Quantized compressed sensing for random circulant matrices
- Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method
- Gradient projection Newton pursuit for sparsity constrained optimization
- scientific article; zbMATH DE number 7306893 (Why is no real title available?)
- The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy
- Iterative algorithm for discrete structure recovery
- Galaxy image restoration with shape constraint
- Geological facies recovery based on weighted \(\ell_1\)-regularization
- Stochastic greedy algorithms for multiple measurement vectors
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Convergence analysis of compressive sensing based on SCAD iterative thresholding algorithm
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- scientific article; zbMATH DE number 7370529 (Why is no real title available?)
- scientific article; zbMATH DE number 7370639 (Why is no real title available?)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- An inexact projected gradient method for sparsity-constrained quadratic measurements regression
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- An unbiased approach to compressed sensing
- Structured sparsity: discrete and convex approaches
- Adaptive multi-penalty regularization based on a generalized Lasso path
- Iterative hard thresholding for compressed data separation
- Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning
- Sparsity optimization in design of multidimensional filter networks
- An efficient radiation analysis approach through compressive model for laser driven inertial confinement fusion
- Structured iterative hard thresholding with on- and off-grid applications
- Sparse recovery of sound fields using measurements from moving microphones
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Adaptive wavelet estimations for the derivative of a density in GARCH-type model
- scientific article; zbMATH DE number 7415078 (Why is no real title available?)
- A polynomial algorithm for best-subset selection problem
- Quantization of compressive samples with stable and robust recovery
- Debiasing convex regularized estimators and interval estimation in linear models
- The springback penalty for robust signal recovery
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Compressive Sensing
- Sparse high-dimensional linear regression. Estimating squared error and a phase transition
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Robust sparse principal component analysis
- Fast and RIP-optimal transforms
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- On the convergence of the SINDy algorithm
- Sparse signal reconstruction via iterative support detection
- Tensor Regression Using Low-Rank and Sparse Tucker Decompositions
- An adaptive inverse scale space method for compressed sensing
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Suprema of chaos processes and the restricted isometry property
- Tensor completion in hierarchical tensor representations
- Greedy-like algorithms for the cosparse analysis model
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Robust sparse phase retrieval made easy
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- Best subset selection via a modern optimization lens
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Restricted isometries for partial random circulant matrices
- Hard thresholding pursuit: an algorithm for compressive sensing
- Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain
- The essential ability of sparse reconstruction of different compressive sensing strategies
- Sparse microwave imaging: principles and applications
- Compressed sensing with coherent and redundant dictionaries
- Spectral compressive sensing
- Matrix completion via minimizing an approximate rank
- Gradient iteration with \(\ell _{p}\)-norm constraints
- Matrix recipes for hard thresholding methods
- Low rank tensor recovery via iterative hard thresholding
- Sparse estimation of Cox proportional hazards models via approximated information criteria
- Democracy in action: quantization, saturation, and compressive sensing
- Near oracle performance and block analysis of signal space greedy methods
- Improved bounds for the RIP of subsampled circulant matrices
- Recent development of dual-dictionary learning approach in medical image analysis and reconstruction
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
This page was built for publication: Iterative hard thresholding for compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734323)
