Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries

DOI10.1142/S0219691317500291zbMATH Open1369.41038OpenAlexW2603734932MaRDI QIDQ5348776FDOQ5348776

Authors: Chunfang Shao, Pei-Xin Ye 

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

Recommendations

• Efficiency of orthogonal super greedy algorithm under the restricted isometry property
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• Super greedy type algorithms
• Weak greedy algorithms
• The rate of convergence of weak greedy approximations over orthogonal dictionaries

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Stable signal recovery from incomplete and inaccurate measurements
• Title not available (Why is that?)
• Compressed sensing and best \(k\)-term approximation
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• Weak greedy algorithms
• Title not available (Why is that?)
• Greedy approximation with regard to non-greedy bases
• Sparse approximation and recovery by greedy algorithms in Banach spaces
• Efficiency of weak greedy algorithms for \(m\)-term approximations
• Analysis of orthogonal multi-matching pursuit under restricted isometry property
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
• On performance of greedy algorithms
• Reconstruction of images from Gabor graphs with applications in facial image processing
• Generalized Orthogonal Matching Pursuit
• Improved bounds on restricted isometry constant for orthogonal multi matching pursuit
• Orthogonal matching pursuit under the restricted isometry property
• Sparse Approximation and Recovery by Greedy Algorithms
• Super greedy type algorithms
• Sparse representation in Szegő kernels through reproducing kernel Hilbert space theory with applications
• Efficient image fusion with approximate sparse representation

Cited In (9)

• Compact dictionary pair learning and refining based on principal components analysis
• Randomized approximation numbers on Besov classes with mixed smoothness
• Efficiency of the weak Rescaled Pure Greedy Algorithm
• Unified error estimate for weak biorthogonal greedy algorithms
• Optimality of the rescaled pure greedy learning algorithms
• Super greedy type algorithms
• The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• Efficiency of orthogonal super greedy algorithm under the restricted isometry property

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348776)