arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.03909astro-ph.IMphysics.comp-ph
收藏

连续小波变换快速算法的比较及其在宇宙学中的应用:一维情形

Comparisons between fast algorithms for the continuous wavelet transform and applications in cosmology: the 1D case

Yun Wang, Ping He

AI总结:

本文回顾并比较了一维信号的四种快速连续小波变换(CWT)算法,评估了它们的精度与速度,并通过对一维密度场的小波分析展示了其应用价值。

摘要:

连续小波变换(CWT)对于处理天体物理学和宇宙学中具有复杂且不规则结构的信号非常有用。提出精确且快速的CWT算法至关重要。在本工作中,我们回顾并比较了四种用于一维信号的不同快速CWT算法,包括FFTCWT、V97CWT、M02CWT和A19CWT。FFTCWT算法使用快速傅里叶变换(FFT)实现CWT,每个尺度的计算复杂度为$\mathcal{O}(N\log_2N)$。其余算法通过将CWT简化为一些较小的卷积,实现了每个尺度$\mathcal{O}(N)$的复杂度。我们明确说明了如何为它们设置参数以及边界条件。为了检验这些算法的实际性能,我们使用它们对不同小波的信号执行CWT。从精度方面来看,我们发现FFTCWT是最精确的算法,尽管在处理具有零边界的非周期信号时其精度会大幅下降。$\mathcal{O}(N)$算法的精度对具有不同边界的信号具有鲁棒性,并且M02CWT比V97CWT和A19CWT更精确。从速度方面来看,在采样数为$N\lesssim10^6$时,$\mathcal{O}(N)$算法并未表现出相对于FFTCWT的总体速度优势,这是由于其较大的前导常数所致。只有使用实小波的V97CWT的速度与FFTCWT相当。然而,由于零填充,FFTCWT和V97CWT在处理非周期信号时的效率都大幅降低。最后,我们对一维密度场进行了小波分析,展示了基于CWT技术的便利性和强大功能。我们公开发布了我们的CWT代码作为社区的可用资源。

英文摘要:

The continuous wavelet transform (CWT) is very useful for processing signals with intricate and irregular structures in astrophysics and cosmology. It is crucial to propose precise and fast algorithms for the CWT. In this work, we review and compare four different fast CWT algorithms for the 1D signals, including the FFTCWT, the V97CWT, the M02CWT, and the A19CWT. The FFTCWT algorithm implements the CWT using the Fast Fourier Transform (FFT) with a computational complexity of $\mathcal{O}(N\log_2N)$ per scale. The rest algorithms achieve the complexity of $\mathcal{O}(N)$ per scale by simplifying the CWT into some smaller convolutions. We illustrate explicitly how to set the parameters as well as the boundary conditions for them. To examine the actual performance of these algorithms, we use them to perform the CWT of signals with different wavelets. From the aspect of accuracy, we find that the FFTCWT is the most accurate algorithm, though its accuracy degrades a lot when processing the non-periodic signal with zero boundaries. The accuracy of $\mathcal{O}(N)$ algorithms is robust to signals with different boundaries, and the M02CWT is more accurate than the V97CWT and A19CWT. From the aspect of speed, the $\mathcal{O}(N)$ algorithms do not show an overall speed superiority over the FFTCWT at sampling numbers of $N\lesssim10^6$, which is due to their large leading constants. Only the speed of the V97CWT with real wavelets is comparable to that of the FFTCWT. However, both the FFTCWT and V97CWT are substantially less efficient in processing the non-periodic signal because of zero padding. Finally, we conduct wavelet analysis of the 1D density fields, which demonstrate the convenience and power of techniques based on the CWT. We publicly release our CWT codes as resources for the community.

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

↑