Iterative and greedy algorithms for the sparsity in levels model in compressed sensing

Ben Adcock; Simone Brugiapaglia; Matthew King-Roskamp

doi:10.1117/12.2526373

Translator Disclaimer

9 September 2019 Iterative and greedy algorithms for the sparsity in levels model in compressed sensing

Ben Adcock, Simone Brugiapaglia, Matthew King-Roskamp

Author Affiliations +

Proceedings Volume 11138, Wavelets and Sparsity XVIII; 1113809 (2019) https://doi.org/10.1117/12.2526373
Event: SPIE Optical Engineering + Applications, 2019, San Diego, California, United States

Abstract

Motivated by the question of optimal functional approximation via compressed sensing, we propose generalizations of the Iterative Hard Thresholding and the Compressive Sampling Matching Pursuit algorithms able to promote sparse in levels signals. We show, by means of numerical experiments, that the proposed algorithms are successfully able to outperform their unstructured variants when the signal exhibits the sparsity structure of interest. Moreover, in the context of piecewise smooth function approximation, we numerically demonstrate that the structure promoting decoders outperform their unstructured variants and the basis pursuit program when the encoder is structure agnostic.

Citation Download Citation

Ben Adcock, Simone Brugiapaglia, and Matthew King-Roskamp "Iterative and greedy algorithms for the sparsity in levels model in compressed sensing", Proc. SPIE 11138, Wavelets and Sparsity XVIII, 1113809 (9 September 2019); https://doi.org/10.1117/12.2526373

ACCESS THE FULL ARTICLE