A new recovery analysis of block orthogonal greedy algorithm

DOI10.3103/S106836232470033XMaRDI QIDQ7002682zbMATH OpenFDO

Authors Khole Timothy Poumai, Sunder Deep, Shiv K. Kaushik

Publication date 3 April 2025

Published in Journal of Contemporary Mathematical Analysis. Armenian Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S106836232470033X

zbMATH Keywords

\(g\)-framesblock RIPblock sparse signalscompressed sensing

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)

Cites work

• \(g\)-frames and \(g\)-Riesz bases
• A generalized uncertainty principle and sparse representation in pairs of bases
• A new bound on the block restricted isometry constant in compressed sensing
• A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
• Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
• Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
• Block sparse recovery via mixed l₂/l₁ minimization
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Compressed sensing
• Empirical Bayes Estimation of a Sparse Vector of Gene Expression Changes
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Greed is Good: Algorithmic Results for Sparse Approximation
• Matching pursuits with time-frequency dictionaries
• The restricted isometry property and its implications for compressed sensing
• Uncertainty principles and ideal atomic decomposition
• Uncertainty Relations for Shift-Invariant Analog Signals

Cited in

(1)

• On greedy types frame systems

This page was built for publication: A new recovery analysis of block orthogonal greedy algorithm

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