Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries

DOI10.1142/S0219691317500291MaRDI QIDQ5348776zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
• 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)