散斑干涉条纹Kaiser-Hamming窗口傅里叶快速滤波方法

Faster Fourier filtering based on Kaiser-Hamming window forfringe of electronic speckle pattern interferometry

针对加窗傅里叶滤波(WFF)对电子散斑干涉条纹滤波时间长的局限性,提出了一种基于二维Kaiser-Hamming窗口的傅里叶快速滤波法(KH-WFF)。首先,将Kaiser窗和Hamming窗组合,设计了二维Kaiser-Hamming窗口,然后将WFF中的Gaussian窗口替换为二维Kaiser-Hamming窗,去掉多余的非正交基函数从而减少时间复杂度。把KH-WFF和WFF应用到模拟条纹和真实条纹,结果表明滤波后的条纹光滑度,细节保护程度和保真度相差不大,都成功得到了连续性好的解包裹相位,而KH-WFF对实际应用环境下采集到的一副条纹的滤波速度是WFF的12倍。最后分析不同图像尺寸、窗口大小和频带宽下KH-WFF和WFF的执行速度,证明KH-WFF的时间复杂度更低。实验证明提出的方法在减少执行时间的同时也提供了几乎相同的滤波效果。

Aiming at the long runtime of windowed Fourier filtering(WFF)in the filtering of fringes of electronic speckle pattern interferometry,a faster Fourier filtering method based on a two-dimensional Kaiser-Hamming window(KH-WFF)is proposed.First,the Kaiser window and Hamming window are combined to design a two-dimensional Kaiser-Hamming window,and then the Gaussian window in WFF is replaced with the two-dimensional Kaiser-Hamming window.The time complexity is reduced due to the removal of redundant non-orthogonal basis functions.KH-WFF and WFF are applied to the simulated fringe and the experimental fringe,and the results show that the smoothness,detail protection,and fidelity of the filtered fringe are not much different.Moreover,both methods have obtained the unwrapping phase with good continuity,while the filtering speed of KH-WFF for a fringe in practical application is 12 times that of WFF.Finally,the time complexity analysis of KH-WFF and WFF under different image sizes,window sizes,and bandwidths proves that KH-WFF is faster.Experiments prove that the proposed method provides almost the same result while reducing the execution time.