Log In Sign Up

The benefits of acting locally: Reconstruction algorithms for sparse in levels signals with stable and robust recovery guarantees

by   Ben Adcock, et al.

The sparsity in levels model recently inspired a new generation of effective acquisition and reconstruction modalities for compressive imaging. Moreover, it naturally arises in various areas of signal processing such as parallel acquisition, radar, and the sparse corruptions problem. Reconstruction strategies for sparse in levels signals usually rely on a suitable convex optimization program. Notably, although iterative and greedy algorithms can outperform convex optimization and have been studied extensively in the case of standard sparsity, little is known about their generalizations to the sparse in levels setting. In this paper, we bridge this gap by showing new stable and robust uniform recovery guarantees for sparse in level variants of the iterative hard thresholding and the CoSaMP algorithms. Our theoretical analysis generalizes recovery guarantees currently available in the case of standard sparsity and favorably compare to sparse in levels guarantees for weighted ℓ^1 minimization. In addition, we also propose and numerically test an extension of the orthogonal matching pursuit algorithm for sparse in levels signals.


page 14

page 15


Comparison of threshold-based algorithms for sparse signal recovery

Intensively growing approach in signal processing and acquisition, the C...

Efficient Least Residual Greedy Algorithms for Sparse Recovery

We present a novel stagewise strategy for improving greedy algorithms fo...

Mask Iterative Hard Thresholding Algorithms for Sparse Image Reconstruction of Objects with Known Contour

We develop mask iterative hard thresholding algorithms (mask IHT and mas...

A Weighted ℓ_1-Minimization Approach For Wavelet Reconstruction of Signals and Images

In this effort, we propose a convex optimization approach based on weigh...

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

Motivated by the question of optimal functional approximation via compre...

Local Identification of Overcomplete Dictionaries

This paper presents the first theoretical results showing that stable id...

Convex Sparse Blind Deconvolution

In the blind deconvolution problem, we observe the convolution of an unk...