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

DOI10.1109/TSP.2011.2174985zbMath1393.94243OpenAlexW2039851473WikidataQ60487163 ScholiaQ60487163MaRDI QIDQ4573563

Michael Elad, Raja Giryes

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)

Related Items (8)

Sparsity Based Methods for Overparameterized Variational Problems ⋮ Generalizing CoSaMP to signals from a union of low dimensional linear subspaces ⋮ Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms ⋮ Sampling in the analysis transform domain ⋮ Greedy-like algorithms for the cosparse analysis model ⋮ Theoretical guarantees for graph sparse coding ⋮ Deterministic construction of sparse binary matrices via incremental integer optimization ⋮ Near oracle performance and block analysis of signal space greedy methods

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