Sparse Recovery With Orthogonal Matching Pursuit Under RIP

DOI10.1109/TIT.2011.2162263zbMath1365.94091arXiv1005.2249MaRDI QIDQ5272397

No author found.

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Non-Markovian processes: estimation (62M09) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (56)

A new result on recovery sparse signals using orthogonal matching pursuit ⋮ Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares ⋮ Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension ⋮ Greedy strategies for convex optimization ⋮ Lebesgue-type inequalities in greedy approximation ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ 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 ⋮ Suprema of Chaos Processes and the Restricted Isometry Property ⋮ Generalized greedy alternatives ⋮ Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression ⋮ Nearly optimal minimax estimator for high-dimensional sparse linear regression ⋮ The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials ⋮ Improved bounds for the RIP of Subsampled Circulant matrices ⋮ A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems ⋮ A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery ⋮ A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem ⋮ Multi-view metro station clustering based on passenger flows: a functional data-edged network community detection approach ⋮ Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries ⋮ Iterative hard thresholding for compressed data separation ⋮ Unnamed Item ⋮ A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry ⋮ Sampling in the analysis transform domain ⋮ Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery ⋮ Sparse Approximation by Greedy Algorithms ⋮ Flavors of Compressive Sensing ⋮ Greedy-like algorithms for the cosparse analysis model ⋮ Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices ⋮ A novel sub-Nyquist FRI sampling and reconstruction method in linear canonical transform domain ⋮ Sparsity and incoherence in orthogonal matching pursuit ⋮ Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery ⋮ A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al. ⋮ A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property ⋮ Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R ⋮ Restricted strong convexity implies weak submodularity ⋮ Orthogonal matching pursuit under the restricted isometry property ⋮ Support recovery of greedy block coordinate descent using the near orthogonality property ⋮ Dictionary descent in optimization ⋮ A Tight Bound of Hard Thresholding ⋮ An algebraic perspective on integer sparse recovery ⋮ Unnamed Item ⋮ Fusion frames and distributed sparsity ⋮ Stochastic greedy algorithms for multiple measurement vectors ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs ⋮ Hard thresholding pursuit algorithms: number of iterations ⋮ Stability and Robustness of Weak Orthogonal Matching Pursuits ⋮ Preserving injectivity under subgaussian mappings and its application to compressed sensing ⋮ Unnamed Item ⋮ 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 ⋮ Orthogonal one step greedy procedure for heteroscedastic linear models ⋮ SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

This page was built for publication: Sparse Recovery With Orthogonal Matching Pursuit Under RIP