arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.03392physics.optics
收藏

裁剪二维快速迭代滤波算法用于低对比度光学条纹图预处理

Tailoring 2D Fast Iterative Filtering algorithm for low-contrast optical fringe pattern preprocessing

Mikolaj Rogalski, Mateusz Pielach, Antonio Cicone, Piotr Zdankowski, Luiza Stanaszek, Katarzyna Drela, Krzysztof Patorski, Barbara Lukomska, Maciej Trusiak

摘要:

从光学条纹图中检索物体相位是定量相位成像中的关键任务,并且通常需要适当的图像预处理(背景和噪声最小化),特别是当从单次拍摄的条纹图图像中检索相位时。在这篇文章中,第一次,我们提出了适应的二维快速迭代滤波(FIF)的条纹图分解方法,并开发了一种新版本的FIF称为二维条纹图快速迭代滤波(fpFIF2),这是专门为条纹图预处理。我们展示了fpFIF2对条纹图滤波的积极影响,与以前的2D FIF实现相比,处理速度,质量和使用舒适性。我们还比较了fpFIF2与其他国家的最先进的条纹图滤波方法在帮助希尔伯特螺旋变换方法在相位恢复。采用数值模拟和实验条纹分析,我们证明了fpFIF2优于参考方法,特别是在低条纹对比度相位重建质量和分解时间方面。

英文摘要:

Retrieving object phase from the optical fringe pattern is a critical task in quantitative phase imaging and often requires appropriate image preprocessing (background and noise minimization), especially when retrieving phase from the single-shot fringe pattern image. In this article, for the first time, we propose to adapt the 2D Fast Iterative Filtering (FIF) method for fringe pattern decomposition and develop a novel version of FIF called the 2D fringe pattern Fast Iterative Filtering (fpFIF2), that is tailored for fringe pattern preprocessing. We show the positive influence of fpFIF2 onto fringe pattern filtering comparing to the previous 2D FIF implementation regarding processing speed, quality, and usage comfortability. We also compare the fpFIF2 with other state-of-the-art fringe pattern filtering methods in terms of aiding the Hilbert spiral transform method in phase retrieval. Employing numerical simulations and experimental fringe analysis, we prove that fpFIF2 outperforms reference methods, especially in terms of low-fringe-contrast phase reconstruction quality and decomposition time.

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

↑