arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.1773math.NAcs.NA
收藏

快速有限剪切波变换

Fast Finite Shearlet Transform

Technische Universität Kaiserslautern(凯泽斯劳滕工业大学)

S. Häuser, G. Steidl

AI总结:

本文提出一种仅基于FFT的快速有限剪切波变换算法,通过带限剪切波构造Parseval框架,实现简单直接的反变换。

摘要:

近年来,剪切波已被证明具有提取方向信息的潜力,因此在许多应用中变得有趣。此外,连续剪切波变换具有源自平方可积群表示的突出性质。然而,为了在合理的应用中使用剪切波和剪切波变换,需要快速算法来计算离散剪切波变换。在本教程中,我们介绍了实现快速有限剪切波变换的步骤,该变换仅基于FFT。使用带限剪切波,我们构造了一个Parseval框架,提供了简单直接的反剪切波变换。我们提供了所有证明,并讨论了实现的几个方面。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑