When does OMP achieve exact recovery with continuous dictionaries?
From MaRDI portal
Publication:2659744
DOI10.1016/j.acha.2020.12.002OpenAlexW2939914314MaRDI QIDQ2659744
Rémi Gribonval, Cédric Herzet, Clément Elvira, Charles Soussen
Publication date: 26 March 2021
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.06311
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- Exact reconstruction using Beurling minimal extrapolation
- Support recovery for sparse super-resolution of positive measures
- Exact support recovery for sparse spikes deconvolution
- A multivariate generalization of Prony's method
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- Projection pursuit
- Least angle regression. (With discussion)
- Some remarks on greedy algorithms
- The convex geometry of linear inverse problems
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Beyond coherence: Recovering structured time-frequency representations
- Spike detection from inaccurate samplings
- Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit
- Joint <formula formulatype="inline"><tex Notation="TeX">$k$</tex> </formula>-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares
- Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP
- Descartes' Rule of Signs, Alternations of Data Sets, and Balanced Differences
- On Sparse Representations in Arbitrary Redundant Bases
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Greedy approximation
- Orthogonal least squares methods and their application to non-linear system identification
- Atomic Decomposition by Basis Pursuit
- Completely monotonic functions
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- Super-resolution of point sources via convex programming
- FRESH—FRI-Based Single-Image Super-Resolution Algorithm
- MultiDimensional Sparse Super-Resolution
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Inverse problems in spaces of measures
- The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy
- Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Compressed Sensing Off the Grid
- Most Tensor Problems Are NP-Hard
- Towards a Mathematical Theory of Super‐resolution
- Scattered Data Approximation
- Kernel matching pursuit
