Sparse Recovery With Orthogonal Matching Pursuit Under RIP
From MaRDI portal
Abstract: This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level , then OMP can recover a -sparse signal in 2-norm. For compressed sensing applications, this result implies that in order to uniformly recover a -sparse signal in , only random projections are needed. This analysis improves earlier results on OMP that depend on stronger conditions such as mutual incoherence that can only be satisfied with random projections.
Cited in
(68)- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- Sparsity and incoherence in orthogonal matching pursuit
- Restricted strong convexity implies weak submodularity
- Support recovery of greedy block coordinate descent using the near orthogonality property
- An algebraic perspective on integer sparse recovery
- Stochastic greedy algorithms for multiple measurement vectors
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- A data-driven line search rule for support recovery in high-dimensional data analysis
- A new sufficient condition for sparse recovery with multiple orthogonal least squares
- Generalized greedy alternatives
- Iterative hard thresholding for compressed data separation
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- Greedy approximation in convex optimization
- Greedy signal space methods for incoherence and beyond
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Greedy strategies for convex optimization
- Greedy-like algorithms for the cosparse analysis model
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
- Orthogonal one step greedy procedure for heteroscedastic linear models
- A novel sub-Nyquist FRI sampling and reconstruction method in linear canonical transform domain
- Noise-shaping quantization methods for frame-based and compressive sampling systems
- Stability and robustness of weak orthogonal matching pursuits
- Sparse approximation and recovery by greedy algorithms in Banach spaces
- Suprema of chaos processes and the restricted isometry property
- A generalized class of hard thresholding algorithms for sparse signal recovery
- An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit
- Improved bounds for the RIP of subsampled circulant matrices
- Nearly optimal minimax estimator for high-dimensional sparse linear regression
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- A tight bound of hard thresholding
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Sparse approximation by greedy algorithms
- Flavors of compressive sensing
- Fusion frames and distributed sparsity
- Sparse convex optimization via adaptively regularized hard thresholding
- Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- A compressive spectral collocation method for the diffusion equation under the restricted isometry property
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- Orthogonal matching pursuit under the restricted isometry property
- Dictionary descent in optimization
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- A survey on compressive sensing: classical results and recent advancements
- A new result on recovery sparse signals using orthogonal matching pursuit
- Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares
- Multi-view metro station clustering based on passenger flows: a functional data-edged network community detection approach
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery
- An effective approach for uncertain aerodynamic analysis of airfoils via the polynomial chaos expansion
- Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
- An Interactive Greedy Approach to Group Sparsity in High Dimensions
- Constrained mix sparse optimization via hard thresholding pursuit
- Tensor recovery from quantized measurements based on modewise operators
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- Randomized orthogonal matching pursuit algorithm with adaptive partial selection for sparse signal recovery
- Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions
- Geometry-dependent matching pursuit: a transition phase for convergence on linear regression and Lasso
- Robust instance optimal phase-only compressed sensing
- Sparse sampling recovery by greedy algorithms
- Some theoretical and practical results on noisy signals recovery
- Hard thresholding pursuit algorithms: number of iterations
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Sampling in the analysis transform domain
This page was built for publication: Sparse Recovery With Orthogonal Matching Pursuit Under RIP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272397)
