Abstract
It is shown that the iterative hard thresholding and hard thresholding pursuit algorithms provide the same theoretical guarantees as \(\ell _1\)-minimization for the recovery from imperfect compressive measurements of signals that have almost sparse analysis expansions in a fixed dictionary. Unlike other signal space algorithms targeting the recovery of signals with sparse synthesis expansions, the ability to compute (near) best approximations by synthesis-sparse signals is not necessary. The results are first established for tight frame dictionaries, before being extended to arbitrary dictionaries modulo an adjustment of the measurement process.
Similar content being viewed by others
Notes
Meaning that a bound on \(\Vert \mathbf{D}^* \mathbf{f}- \mathbf{D}^* \mathbf{f}^\sharp \Vert _p\) was established—for \(p=2\) and for tight frames, it reduces to the bound (1) on \(\Vert \mathbf{f}- \mathbf{f}^\sharp \Vert _2\).
References
Blumensath, T.: Sampling and reconstructing signals from a union of linear subspaces. IEEE Trans. Inf. Theory 57(7), 4660–4671 (2011)
Candès, E.J., Eldar, Y.C., Needell, D., Randall, P.: Compressed sensing with coherent and redundant dictionaries. Appl. Comput. Harmonic Anal. 31(1), 59–73 (2011)
Davenport, M., Needell, D., Wakin, M.: Signal space CoSaMP for sparse recovery with redundant dictionaries. IEEE Trans. Inf. Theory 59(10), 6820–6829 (2013)
Foucart, S.: Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6), 2543–2563 (2011)
Foucart, S.: Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants. In: Approximation Theory XIII: San Antonio 2010, pp. 65–77. Springer, New York (2012)
Foucart, S.: Stability and robustness of \(\ell _1\)-minimizations with Weibull matrices and redundant dictionaries. Linear Algebra Appl. 441, 4–21 (2014)
Foucart, S., Lai, M.-J.: Sparse recovery with pre-Gaussian random matrices. Studia Mathematica 200(1), 91–102 (2010)
Giryes, R., Needell, D.: Greedy signal space methods for incoherence and beyond. Appl. Comput. Harmonic Anal. 39(1), 1–20 (2015)
Giryes, R., Nam, S., Elad, M., Gribonval, R., Davies, M.E.: Greedy-like algorithms for the cosparse analysis model. Linear Algebra Appl. 441, 22–60 (2014)
Krahmer, F., Ward, R.: New and improved Johnson–Lindenstrauss embeddings via the restricted isometry property. SIAM J. Math. Anal. 43(3), 1269–1281 (2011)
Nam, S., Davies, M.E., Elad, M., Gribonval, R.: The cosparse analysis model and algorithms. Appl. Comput. Harmonic Anal. 34(1), 30–56 (2013)
Acknowledgments
Simon Foucart is partially supported by NSF Grant number DMS-1120622.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Roman Vershynin.
Rights and permissions
About this article
Cite this article
Foucart, S. Dictionary-Sparse Recovery via Thresholding-Based Algorithms. J Fourier Anal Appl 22, 6–19 (2016). https://doi.org/10.1007/s00041-015-9411-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00041-015-9411-4
Keywords
- Compressive sensing
- Sparse recovery
- Iterative hard thresholding
- Hard thresholding pursuit
- Restricted isometry property adapted to a dictionary
- Tight frames