Fast Finite Shearlet Transform

Publication date: 8 February 2012

Abstract: In recent years it has turned out that shearlets have the potential to retrieve directional information so that they became interesting for many applications. Moreover the continuous shearlet transform has the outstanding property to stem from a square integrable group representation. However, to use shearlets and the shearlet transform for reasonable applications one needs fast algorithms to compute a discrete shearlet transform. In this tutorial we present the steps towards an implementation of a fast and finite shearlet transform that is only based on the FFT. Using band-limited shearlets we construct a Parseval frame that provides a simple and straightforward inverse shearlet transform. We provide all proofs and discuss several aspects of our implementation.

Has companion code repository: https://github.com/eliaszea/acha_sparsityanalysis

This page was built for publication: Fast Finite Shearlet Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6230887)