The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing

DOI10.1109/TIT.2011.2177632MaRDI QIDQ5271993zbMATH OpenOpenAlexFDO

Authors Entao Liu, V. N. Temlyakov

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2011.2177632

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Sampling theory in information and communication theory (94A20)

Recommendations

• Efficiency of orthogonal super greedy algorithm under the restricted isometry property
• On the efficiency of the orthogonal matching pursuit in compressed sensing
• The efficiency of using orthogonal matching pursuit in compressed sensing
• Orthogonal Matching Pursuit With Thresholding and its Application in Compressive Sensing
• A reducing iteration orthogonal matching pursuit algorithm for compressive sensing
• Orthonormal Expansion $\ell_{1}$-Minimization Algorithms for Compressed Sensing
• Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
• Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
• Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
• Performance comparisons of greedy algorithms in compressed sensing.

Cited in

(25)

• Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
• Sparse signal reconstruction based on multiparameter approximation function with smoothed _0 norm
• A remark on joint sparse recovery with OMP algorithm under restricted isometry property
• A sharp RIP condition for orthogonal matching pursuit
• Efficiency of orthogonal super greedy algorithm under the restricted isometry property
• Sparse signals recovery from noisy measurements by orthogonal matching pursuit
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• When does OMP achieve exact recovery with continuous dictionaries?
• Stability and robustness of weak orthogonal matching pursuits
• Sparse approximation is provably hard under coherent dictionaries
• Robustness of orthogonal matching pursuit under restricted isometry property
• Analysis of orthogonal multi-matching pursuit under restricted isometry property
• Binary sparse signal recovery with binary matching pursuit
• scientific article; zbMATH DE number 7572477 (Why is no real title available?)
• Orthogonal rank-one matrix pursuit for low rank matrix completion
• Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
• \(\mathrm{L_1RIP}\)-based robust compressed sensing
• Sparse approximation using new greedy-like bases in superreflexive spaces
• Some results on OMP algorithm for MMV problem
• Explicit constructions of RIP matrices and related problems
• Group projected subspace pursuit for block sparse signal reconstruction: convergence analysis and applications
• -Rescaled Pure Super Greedy Algorithm with respect to Riesz dictionary
• From linear system of equations to artificial intelligence -- the evolution journey of computer tomographic image reconstruction algorithms
• Recovery conditions for generalized orthogonal matching pursuit based coherence
• Randomized orthogonal matching pursuit algorithm with adaptive partial selection for sparse signal recovery

This page was built for publication: The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing

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