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)- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- A Lagrange-Newton algorithm for sparse nonlinear programming
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Compressive Sensing
- Newton-type optimal thresholding algorithms for sparse optimization problems
- $\ell _0$ Minimization for wavelet frame based image restoration
- Iterative hard thresholding for compressed sensing
- A characterization of proximity operators
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Fusion frames and distributed sparsity
- Block Bregman majorization minimization with extrapolation
- A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties
- Greedy approximation in convex optimization
- Spectral Compressed Sensing via Projected Gradient Descent
- A note on the complexity of proximal iterative hard thresholding algorithm
- Sparse Legendre expansions via _1-minimization
- Sparse recovery of sound fields using measurements from moving microphones
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Stability of 1-bit compressed sensing in sparse data reconstruction
- Robust high dimensional expectation maximization algorithm via trimmed hard thresholding
- An unbiased approach to compressed sensing
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method
- Gradient projection Newton pursuit for sparsity constrained optimization
- An efficient radiation analysis approach through compressive model for laser driven inertial confinement fusion
- Binary generalized orthogonal matching pursuit
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction
- Fast sparse reconstruction: Greedy inverse scale space flows
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- Efficient projected gradient methods for cardinality constrained optimization
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Sparsity based methods for overparameterized variational problems
- Robust nonconvex sparse optimization for impact force identification
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Learning semidefinite regularizers
- Sparsity optimization in design of multidimensional filter networks
- Guarantees of Riemannian optimization for low rank matrix recovery
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- A note on the complexity of \(L _{p }\) minimization
- Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- 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
- On the convergence of the SINDy algorithm
- Nonlinear Iterative Hard Thresholding for Inverse Scattering
- Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals
- Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- A combined dictionary learning and TV model for image restoration with convergence analysis
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- Phase transitions for greedy sparse approximation algorithms
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Discrete optimization methods for group model selection in compressed sensing
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization for nonlinear ill-posed problems
- Cardinality minimization, constraints, and regularization: a survey
- A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm
- Fast Phase Retrieval from Local Correlation Measurements
- MOEA/D with chain-based random local search for sparse optimization
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Broken adaptive ridge regression and its asymptotic properties
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
- A non-smooth and non-convex regularization method for limited-angle CT image reconstruction
- Iterative hard thresholding for low CP-rank tensor models
- scientific article; zbMATH DE number 7306893 (Why is no real title available?)
- Low complexity regularization of linear inverse problems
- Optimized projections for compressed sensing via rank-constrained nearest correlation matrix
- A generalized class of hard thresholding algorithms for sparse signal recovery
- Quantization and compressive sensing
- Spectral compressive sensing
- The sparse MLE for ultrahigh-dimensional feature screening
- Minimum n-rank approximation via iterative hard thresholding
- A tight bound of hard thresholding
- Fast and RIP-optimal transforms
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- Near oracle performance and block analysis of signal space greedy methods
- HARFE: hard-ridge random feature expansion
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Estimation of block sparsity in compressive sensing
- Compressive Gaussian mixture estimation
- Recent development of dual-dictionary learning approach in medical image analysis and reconstruction
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Greedy-like algorithms for the cosparse analysis model
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Observable dictionary learning for high-dimensional statistical inference
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)
