Faster window Fourier transform filters for fringe pattern analysis

Le Tran Hoai Nam, K. Qian
{"title":"Faster window Fourier transform filters for fringe pattern analysis","authors":"Le Tran Hoai Nam, K. Qian","doi":"10.1117/12.814529","DOIUrl":null,"url":null,"abstract":"Windowed Fourier Transform (WFT) filters, including Windowed Fourier Filtering (WFF) and Windowed Fourier Ridges (WFR), have recently been proven to be effective in analyzing fringes affected from speckle as well as various kinds of noise. These filters deliver high quality results since they process in the windowed Fourier domain which is more robust to noise than the spatial domain. However WFT is relatively slow because of convolution or Fourier transform needs to be executed for many times. In this paper, a revised version of WFT filters are proposed that reduces execution time yet offers almost the same result. Experiments are carried out to backup the theory.","PeriodicalId":191475,"journal":{"name":"International Symposium on Laser Metrology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Laser Metrology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.814529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Windowed Fourier Transform (WFT) filters, including Windowed Fourier Filtering (WFF) and Windowed Fourier Ridges (WFR), have recently been proven to be effective in analyzing fringes affected from speckle as well as various kinds of noise. These filters deliver high quality results since they process in the windowed Fourier domain which is more robust to noise than the spatial domain. However WFT is relatively slow because of convolution or Fourier transform needs to be executed for many times. In this paper, a revised version of WFT filters are proposed that reduces execution time yet offers almost the same result. Experiments are carried out to backup the theory.
更快的窗口傅里叶变换滤波器条纹图案分析
加窗傅立叶变换(WFT)滤波器,包括加窗傅立叶滤波(WFF)和加窗傅立叶脊(WFR),近年来已被证明可以有效地分析受散斑影响的条纹以及各种噪声。这些滤波器提供高质量的结果,因为它们在窗口傅里叶域处理,比空间域对噪声更鲁棒。然而,由于需要执行多次卷积或傅里叶变换,WFT相对较慢。在本文中,提出了一个修改版本的WFT过滤器,减少了执行时间,但提供了几乎相同的结果。进行了实验来支持这一理论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信