arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.5513math.NAcs.ITcs.NAmath.IT
收藏

素数余集和:一种系统方法用于设计多维小波滤波器组的快速算法

Prime Coset Sum: A Systematic Method for Designing Multi-D Wavelet Filter Banks with Fast Algorithms

Johns Hopkins University(约翰斯·霍普金斯大学);Yonsei University(延世大学)

Youngmi Hur, Fang Zheng

AI总结:

本文提出素数余集和方法,系统地利用一维低通滤波器设计多维非分离小波滤波器组,且具有快速算法特性。

摘要:

由于构建多维小波仍是一个具有挑战性的问题,我们提出了一种名为素数余集和的新方法来构建多维小波。我们的方法提供了一种系统方法,从两个一维低通滤波器构造多维非分离小波滤波器组,其中一个为插值滤波器。我们的方法具有许多重要特征,包括:1)适用于任何空间维度和任何素数标量扩张;2)多维小波滤波器组的消失矩由初始一维低通滤波器的某些性质保证;3)所得到的多维小波滤波器组与比现有快速张量积算法更快的快速算法相关。

英文摘要:

As constructing multi-D wavelets remains a challenging problem, we propose a new method called prime coset sum to construct multi-D wavelets. Our method provides a systematic way to construct multi-D non-separable wavelet filter banks from two 1-D lowpass filters, with one of whom being interpolatory. Our method has many important features including the following: 1) it works for any spatial dimension, and any prime scalar dilation, 2) the vanishing moments of the multi-D wavelet filter banks are guaranteed by certain properties of the initial 1-D lowpass filters, and furthermore, 3) the resulting multi-D wavelet filter banks are associated with fast algorithms that are faster than the existing fast tensor product algorithms.

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

↑