Analysis vs. synthesis sparsity for $\alpha$-shearlets
Abstract
There are two notions of sparsity associated to a frame : Analysis sparsity of means that the analysis coefficients are sparse, while synthesis sparsity means that with sparse coefficients . Here, sparsity of means for a given . We show that both notions of sparsity coincide if is a discrete (cone-adapted) shearlet frame with 'nice' generators and fine enough sampling density . The required 'niceness' is explicitly quantified in terms of Fourier-decay and vanishing moment conditions. Precisely, we show that suitable shearlet systems simultaneously provide Banach frames and atomic decompositions for the shearlet smoothness spaces introduced by Labate et al. Hence, membership in is simultaneously equivalent to analysis sparsity and to synthesis sparsity w.r.t. the shearlet frame. As an application, we prove that shearlets yield (almost) optimal approximation rates for cartoon-like functions : If , then , where is a linear combination of N shearlets. This might appear to be well-known, but the existing proofs only establish this approximation rate w.r.t. the dual of , not w.r.t. itself. This is not completely satisfying, since the properties of (decay, smoothness, etc.) are largely unknown. We also consider -shearlet systems. For these, the shearlet smoothness spaces have to be replaced by -shearlet smoothness spaces. We completely characterize the embeddings between these spaces, allowing us to decide whether sparsity w.r.t. -shearlets implies sparsity w.r.t. -shearlets.
Keywords
Cite
@article{arxiv.1702.03559,
title = {Analysis vs. synthesis sparsity for $\alpha$-shearlets},
author = {Felix Voigtlaender and Anne Pein},
journal= {arXiv preprint arXiv:1702.03559},
year = {2017}
}