Average Performance of the Sparsest Approximation Using a General Dictionary
DOI10.1080/01630563.2011.580876zbMath1243.68313arXiv0803.0524MaRDI QIDQ3173502
François Malgouyres, Mila Nikolova
Publication date: 10 October 2011
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.0524
estimation; approximation; measure theory; constrained minimization; sparse representation; nonsmooth functions; dictionary; nonconvex functions; best \(K\)-term approximation
90C26: Nonconvex programming, global optimization
68U10: Computing methodologies for image processing
90C27: Combinatorial optimization
41A25: Rate of convergence, degree of approximation
65D15: Algorithms for approximation of functions
49K30: Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Atomic Decomposition by Basis Pursuit
- Compressed sensing and best 𝑘-term approximation
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Matching pursuits with time-frequency dictionaries
- Entropy-based algorithms for best basis selection
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Adaptive greedy approximations
