检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王会峰[1,2] 何柱材 李云梦 李晋赓 王鹏雁 郝婷 黄鹤 Wang Huifeng;He Zhucai;Li Yunmeng;Li Jingeng;Wang Pengyan;Hao Ting;Huang He(School of Electronic and Control Engineering,Chang′an University,Xi′an 710064,China;Road Traffic Intelligent Detection and Equipment Technology Research Center of Shaanxi,Xi′an 710064,China)
机构地区:[1]长安大学电子与控制工程学院,西安710064 [2]陕西省道路交通智能检测与装备工程技术研究中心,西安710064
出 处:《电子测量与仪器学报》2022年第3期166-174,共9页Journal of Electronic Measurement and Instrumentation
基 金:国家自然科学基金(52172324);“十三五”国家重点研发计划项目(SQ2018YFB16003105);“十三五”装备预研基金项目(61403120105)资助
摘 要:针对加窗傅里叶滤波(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.
关 键 词:电子散斑干涉测量法 加窗傅里叶滤波 二维Kaiser-Hamming窗口 条纹去噪 相位解包裹 滤波速度
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28