General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution
Advanced iterative algorithm (AIA) is a flexible and effective phase-shifting algorithm (PSA) which can extract phase from fringe patterns with random unknown phase-shifts, making it attractive in the scenarios where phase-shifts are unknown or not accurate. However, accuracy of AIA degrades when in...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/162472 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-162472 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1624722022-10-25T00:48:11Z General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution Chen, Yuchi Qian, Kemao School of Computer Science and Engineering Engineering::Computer science and engineering Interferometry Laser Optics Advanced iterative algorithm (AIA) is a flexible and effective phase-shifting algorithm (PSA) which can extract phase from fringe patterns with random unknown phase-shifts, making it attractive in the scenarios where phase-shifts are unknown or not accurate. However, accuracy of AIA degrades when intensity harmonics and/or phase-shift non-uniformity are presented. To solve this problem, multiple PSAs have been proposed, but they restrict their fringe model in one way or another, and thus sacrifice the immunity to certain error source(s). In this paper, a general iterative algorithm (GIA) which adopts a most general fringe model is proposed. In GIA, the many unknowns in the fringe pattern model are divided into three groups including: (i) the fringe amplitudes, (ii) the phase and (iii) the phase-shifts related parameters, and alternatively optimized through univariate search technique group by group to improve accuracy and convergence. The Levenberg-Marquart method is used for the optimization of each group of unknowns due to its excellent accuracy and robustness. GIA is shown to have better accuracies than all of its relevant competitors through both a large number of simulations as well as real experiments with a Fizeau interferometer. Published version 2022-10-25T00:48:11Z 2022-10-25T00:48:11Z 2021 Journal Article Chen, Y. & Qian, K. (2021). General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution. Optics Express, 29(19), 30905-30926. https://dx.doi.org/10.1364/OE.436186 1094-4087 https://hdl.handle.net/10356/162472 10.1364/OE.436186 34614807 2-s2.0-85114790871 19 29 30905 30926 en Optics Express © 2021 Optical Society of America under the terms of the OSA Open Access Publishing Agreement. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Computer science and engineering Interferometry Laser Optics |
spellingShingle |
Engineering::Computer science and engineering Interferometry Laser Optics Chen, Yuchi Qian, Kemao General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution |
description |
Advanced iterative algorithm (AIA) is a flexible and effective phase-shifting algorithm (PSA) which can extract phase from fringe patterns with random unknown phase-shifts, making it attractive in the scenarios where phase-shifts are unknown or not accurate. However, accuracy of AIA degrades when intensity harmonics and/or phase-shift non-uniformity are presented. To solve this problem, multiple PSAs have been proposed, but they restrict their fringe model in one way or another, and thus sacrifice the immunity to certain error source(s). In this paper, a general iterative algorithm (GIA) which adopts a most general fringe model is proposed. In GIA, the many unknowns in the fringe pattern model are divided into three groups including: (i) the fringe amplitudes, (ii) the phase and (iii) the phase-shifts related parameters, and alternatively optimized through univariate search technique group by group to improve accuracy and convergence. The Levenberg-Marquart method is used for the optimization of each group of unknowns due to its excellent accuracy and robustness. GIA is shown to have better accuracies than all of its relevant competitors through both a large number of simulations as well as real experiments with a Fizeau interferometer. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Chen, Yuchi Qian, Kemao |
format |
Article |
author |
Chen, Yuchi Qian, Kemao |
author_sort |
Chen, Yuchi |
title |
General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution |
title_short |
General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution |
title_full |
General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution |
title_fullStr |
General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution |
title_full_unstemmed |
General iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution |
title_sort |
general iterative algorithm for phase-extraction from fringe patterns with random phase-shifts, intensity harmonics and non-uniform phase-shift distribution |
publishDate |
2022 |
url |
https://hdl.handle.net/10356/162472 |
_version_ |
1749179154325045248 |