Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries

DOI10.1142/S0219691317500291zbMath1369.41038OpenAlexW2603734932MaRDI QIDQ5348776

Pei Xin Ye, Chun Fang Shao

Publication date: 21 August 2017

Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219691317500291

zbMATH Keywords

best \(n\)-term approximationalmost optimalityincoherent propertiesweak orthogonal super greedy algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Information theory (general) (94A15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (5)

Optimality of the rescaled pure greedy learning algorithms ⋮ Unified error estimate for weak biorthogonal Greedy algorithms ⋮ Randomized approximation numbers on Besov classes with mixed smoothness ⋮ Compact dictionary pair learning and refining based on principal components analysis ⋮ Efficiency of the weak Rescaled Pure Greedy Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficiency of weak greedy algorithms for \(m\)-term approximations
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• Analysis of orthogonal multi-matching pursuit under restricted isometry property
• Orthogonal matching pursuit under the restricted isometry property
• On performance of greedy algorithms
• Super greedy type algorithms
• Weak greedy algorithms
• Greedy approximation with regard to non-greedy bases
• Efficient image fusion with approximate sparse representation
• SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
• Sparse Approximation and Recovery by Greedy Algorithms
• Compressed sensing and best 𝑘-term approximation
• Generalized Orthogonal Matching Pursuit
• Improved bounds on restricted isometry constant for orthogonal multi matching pursuit
• The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries