RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT

DOI10.1109/TSP.2011.2174985MaRDI QIDQ4573563zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Raja Giryes, Michael Elad

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2011.2174985

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(9)

• Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
• Near oracle performance and block analysis of signal space greedy methods
• Greedy-like algorithms for the cosparse analysis model
• Sparsity based methods for overparameterized variational problems
• Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
• Sufficient condition results for stable recovery of inverse problems with noise
• Theoretical guarantees for graph sparse coding
• Deterministic construction of sparse binary matrices via incremental integer optimization
• Sampling in the analysis transform domain

This page was built for publication: RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT

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