arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.07093math.CA
收藏

À Trous算法在迭代下的稳定性

Stability of the À Trous Algorithm Under Iteration

Brody Johnson, Simon McCreary-Ellis

AI总结:

本文研究了à trous算法在任意迭代下的稳定性,给出了无限迭代平移不变滤波器组稳定的充分条件,并证明了其与有限迭代稳定性及多维可分离乘积稳定性之间的蕴含关系。

摘要:

本文在更一般的平移不变滤波器组研究背景下,考察了à trous算法在任意迭代下的稳定性。主要结果描述了相关滤波器的充分条件,在此条件下无限迭代的平移不变滤波器组是稳定的。此外,证明了无限迭代平移不变滤波器组的稳定性可保证任何相关有限迭代平移不变滤波器组的稳定性,且具有一致界限。反向蕴含关系在低通滤波器的额外假设下成立。最后,还证明了稳定的一维平移不变滤波器组的可分离乘积可生成稳定的二维平移不变滤波器组。

英文摘要:

This paper examines the stability of the à trous algorithm under arbitrary iteration in the context of a more general study of shift-invariant filter banks. The main results describe sufficient conditions on the associated filters under which an infinitely iterated shift-invariant filter bank is stable. Moreover, it is shown that the stability of an infinitely iterated shift-invariant filter bank guarantees that of any associated finitely iterated shift-invariant filter bank, with uniform bounds. The reverse implication is shown to hold under an additional assumption on the low-pass filter. Finally, it is also shown that the separable product of stable one-dimensional shift-invariant filter banks produces a stable two-dimensional shift-invariant filter bank.

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

↑