You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
9 September 2019Iterative and greedy algorithms for the sparsity in levels model in compressed sensing
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.
The alert did not successfully save. Please try again later.
Ben Adcock, Simone Brugiapaglia, 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