Fast Finite Shearlet Transform

Details Fast Finite Shearlet Transform Fast Finite Shearlet Transform

2012-02-08

arxiv.org/abs/1202.1773v1

Mathematics

Numerical Analysis

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast Finite Shearlet Transform does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Finite Shearlet Transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Finite Shearlet Transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65167