Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Self-calibration phase-shifting algorithm with interferograms containing very few fringes based on Fourier domain estimation

Open Access Open Access

Abstract

Based on Fourier domain estimation, a novel self-calibration phase-shifting algorithm, named Mid-Band Spatial Spectrum Matching (MSSM), is proposed to achieve phase retrieval from a small amount of phase-shifting interferograms containing very few fringes (defined as ultra-sparse fringe pattern(USFP)), which is still a difficult problem for optical interferometry. Both simulation and experimental results demonstrate that the proposed MSSM algorithm can accurately and rapidly achieve the phase distribution encoded in USFP while other current self-calibration algorithms fail, and this will supply a powerful tool to extend the application of phase-shifting interferometry.

© 2017 Optical Society of America

1. Introduction

Optical interferometry is a powerful non-contact tool to quantitatively and accurately exhibit the property of micro or macro object [1]. Generally speaking, for different measuring requirements, there are two most important solutions: the off-axis configuration [2–4] for dynamic analysis and vibrational robustness, the on-axis configuration [5, 6] for full spatial bandwidth utilization and high accuracy measurement. And they choose different phase encoding methods: the temporal coding is utilized in on-axis configuration while the spatial coding is employed in off-axis configuration. The accuracy advantage of temporal coding method compared with spatial coding method comes from the fact that the temporal phase stability of interferograms is far better than the spatial phase stability of interferograms, because the former can be guaranteed by the experimental equipment but the latter is usually broken due to the large phase gradient of tested object. From another perspective, the advantages of temporal coding method also can be explained as the sufficient utilization of CCD bandwidth. Among on-axis phase retrieval methods [5, 7, 8], although the phase-shifting interferometry (PSI) has significant advantage in convenience due to its linear mathematical property, an obvious error named as the miscalibration error usually appears.

The miscalibration error, which is induced by the incorrect estimation of phase shifts [9], usually leads to a serious rippling oscillation distortion into the retrieved phase. As we know, the initial PSI algorithms are based on a simple model, in which the phase shifts are known [10] or linearly distributed in the integral period of 2π [11]. However, in the practical application, the above assumption cannot be easily satisfied, especially in the case that only a small amount of phase-shifting interferograms are captured. To address this, the self-calibration algorithm, which can help us accurately estimate the unknown phase shifts, is proposed. Unfortunately, in the current self-calibration algorithms, though the phase retrieval can be achieved without the prior knowledge of phase shifts, their accuracy is closely related with the fringe number in interferograms [12–22], and this will greatly limit their applications. Actually, the ultra-sparse fringe patterns (USFP), in which the fringe number in interferograms is less than one, usually appear in some modern interference techniques. For example, in white light phase-shifting interferometry [23, 24], the fringe number in interference patterns is limited by the coherence length of white light; and in the quadratic phase eliminated phase-shifting microscopic system [25], the fringe number is reduced by the objective matching to achieve sufficient utilization of spatial bandwidth of CCD, thus the more detail of tested object can be reserved. In our previous work [26], though the solution for the fringe pattern with non-uniform distribution is proposed, but it still cannot work well for USFPs.

In this study, we propose a novel solution to perform retrieval phase of USFPs through using mid-band spatial spectrum matching (MSSM) algorithm, in which only three-frame phase-shifting interferograms with unknown phase shifts are enough. Specially, although the proposed MSSM algorithm is conceived as a solution for USFP, it also reveals high accuracy for the fringe patterns with many fringes. What’s more, the proposed algorithm has rapid speed because the iterative procedure is not needed. Following, we will introduce the proposed MSSM algorithm in detail.

2. Principle

In PSI, the intensity of the nth-frame phase-shifting interferograms can be described as

In(x,y)=A(x,y)+B(x,y)cos[ϕ(x,y)+δn]+on(x,y)n=1......N.
where x and y denote the transverse and longitude coordinates, respectively; A(x, y) and B(x, y) represent the background intensity and modulation amplitude, respectively; ϕ(x,y)is the encoded phase distribution ; δnrepresents the phase shifts, in which δ1=0, and n = 1,2,3……N are the index number of a sequence of phase-shifting interferograms; on(x,y)represents the noise.

Actually, the phase demodulation procedure from N-frame phase-shifting interferograms is to solve Eqs. (1). However, whenN3, the total variable number in Eqs. (1) will exceed the equations number, then the self-calibration algorithm is introduced to solve Eqs. (1). Apparently, a reasonable approximation is needed to increase the number of known parameters in Eqs. (1) . But in the USFP, the widely adopted assumption, corresponding to the statistical average property of phase distribution, will become invalid [13, 16, 18], and another important approximation, the spatial constant of A(x, y) and B(x, y) [12, 17], are not easy to be satisfied in practical application. Specially, in current self-calibration algorithms, though the advanced iterative algorithm (AIA) [17] reveals relative robust in adapting the nonconstant of A(x, y) and B(x, y), but its accuracy stability against the spatial variation of A(x, y) and B(x, y) still requires many fringes in interferograms. Besides that, the recently developed ellipse fitting algorithm is also treated as a promising solution [15, 19, 21], but it is in fact a non-iterative compromised AIA solution for saving time because it’s fitting strategy is similar with the second step of AIA, which will make the global fitting of constant-in-assumption. What’s more, the number increasing of parameters in these fitting algorithms, i.e., 6-parameter in ellipse fitting algorithm but only 2-parameter in AIA, will lead to the accuracy decreasing [27]. Further, for the USFP with nonconstant A(x, y) and B(x, y), the above algorithms cannot work well.

Clearly, to achieve the accurate phase in USFP, it is needed to search for a more reasonable approximation. As we know, before Zernike invented phase contrast microscope in 1935 [28], the microscopic phase information cannot be directly observed. Actually, the phase contrast is a phenomenon induced by the self-interference, reflecting that A(x, y) and B(x, y) in interference pattern might be non-constant, but the spatial intensity fluctuation in interference pattern is mainly induced by the interference term. Fourier spectrum analysis is an effective tool to study the degree of intensity fluctuation. When the interference signal is generated, more high frequency components will appear in interference pattern. By performing Fourier transform (FT) operation ζto both sides of Eqs. (1), and if N = 3, we have that

I1(fx)=A(fx)+ζ[B(x)cosϕ(x)]+o1(fx)=A(fx)+T1(fx)+o1(fx).
I2(fx)=A(fx)+ζ{B(x)cos[ϕ(x)+δ1]}+o2(fx)=A(fx)+cosδ1T1(fx)sinδ1T2(fx)+o2(fx).
I3(fx)=A(fx)+ζ{B(x)cos[ϕ(x)+δ2]}+o3(fx)=A(fx)+cosδ2T1(fx)sinδ2T2(fx)+o3(fx).
Here, for simplicity, we have neglected the y dependence, in which A(fx),T1(fx),T2(fx)and oi(fx)denote the spatial frequency spectra of A(x),B(x)cosϕ(x),B(x)sinϕ(x)andoi(x), respectively. As shown in Fig. 1, the whole spatial frequency spectra can be divided into three components: low-frequency, mid-frequency and high-frequency bands, which are mainly occupied by A(fx), T1(fx)and T2(fx), respectively. If we intercept only the mid-frequency component, the information of A(fx)and o(fx)can be suppressed, the variable number in Eqs. (1) will be reduced. And then we have that
I˜1(fx)T˜1(fx).
I˜2(fx)T˜1(fx)cosδ1T˜2(fx)sinδ1.
I˜3(fx)T˜1(fx)cosδ2T˜2(fx)sinδ2.
Here, fx(f2,f1),(f1+,f2+), where f2,f1and f1+,f2+denote the intercepted mid-band spatial spectral range in the positive and negative frequency domains, respectively. And T˜1(fx),T˜2(fx) represents the intercepted component of T1(fx)and T2(fx), respectively.

 figure: Fig. 1

Fig. 1 Schematic of the spectral division, in which the background spectrumA(fx), noise spectrum o(fx)and interference term T1(fx),T2(fx)are located in the low-frequency band, high-frequency band and mid-frequency band, respectively.

Download Full Size | PDF

Note that Eqs. (3) represent three different combination modes of T1(fx)and T2(fx). By using the least-square fitting algorithm, we can achieve C1 and C2 by

C1I˜2(fx)+C2I˜3(fx)=I˜1(fx).
After C1,C2are determined, from Eqs. (3), we have that
C1cosδ1+C2cosδ2=1.
C1sinδ1=C2sinδ2.
Thus, δ1and δ2can be achieved from Eqs. (5). Subsequently, ϕ(x)also can be determined by the temporal least square fitting algorithm as
(A(x,y)B(x,y)cosϕ(x,y)B(x,y)sinϕ(x,y))=(1cosδ1sinδ11cosδ2sinδ21cosδ3sinδ3)1(I1I2I3).
ϕ(x,y)=arctan[B(x,y)sinϕ(x,y)B(x,y)cosϕ(x,y)].
Note that the high-pass component of the filtering function plays an important role in the proposed MSSM algorithm. If the backgroundA(fx,fy) cannot be eliminated, then a residual term A˜(fx,fy)will appear and the accuracy is decreased. For this reason, we define two parameters to describe the error level as
l1=fx,fyabs[A˜(fx,fy)]fx,fyabs[T˜1(fx,fy)].
l2=fx,fyabs[A˜(fx,fy)]fx,fyabs[T˜2(fx,fy)].
Here, l1 and l2 represent the spectrum energy ratio between the background residual term A˜(fx,fy) and the filtering signal term T˜1(fx,fy),T˜2(fx,fy), respectively. If l1 and l2 is small enough, an accurate result can be achieved.

It is also benifitial to notice that the empirical mode decomposition method [29–31] has been recently applied to interferograms analysis to achieve accurate background removal, in which the fringe-pattern is adaptively decomposed into several components, i.e., IMFs (instrinsic mode functions), corresponding to the background and noise terms, respectively. And it is found that this empirical mode decomposition reveals high accuracy relative to Gaussian filtering based background removal method in many practical situations. As consequence, the proposed MSSM algorithm will present further accuracy improvement through combining with the empirical mode decomposition method.

3. Simulation

Following, we perform the quantitative calculation to verify the effectiveness of the proposed MSSM algorithm. Three-frame simulated fringe-patterns with the phase shifts of 0rad, 1.2rad, and 2.6rad are generated, and the corresponding size are 500 × 500 with pixel interval of 0.01mm. The background and modulation amplitude are set as A(x, y) = 80exp[-0.05(x2 + y2)] + 80 and B(x, y) = 80exp[-0.05(x2 + y2)], respectively; ϕ1=0.03π(x2+y2) andϕ2=π(x2+y2), corresponding to the encoded phase in the USFP and fringe-pattern with many fringes. The fitting band is intercepted by a band-pass spatial filter of h(fx,fy)=h1(fx,fy)h2(fx,fy), in which h1(fx,fy)=exp(fx2+fy22σ12),h2(fx,fy)=1exp(fx2+fy22σ22) (σ1=30,σ2=3). Random noise with signal noise ratio (SNR) of 50db is added into the fringe patterns. For comparison, the result achieved with PCA and AIA algorithms are also presented. As shown in Fig. 2, from 3-frame fringe-patterns, it is found that the AIA or PCA algorithms can work only when A(x, y) and B(x, y) are quasi-constant and many fringes exist in fringe-patterns. In contrast, using the proposed MSSM algorithm, whether for the USFP or fringe-patterns with many fringes, the accurate phase can be achieved.

 figure: Fig. 2

Fig. 2 (a1)(a2)Two-frame simulated interference patterns encoded with phase ϕ1and ϕ2, respectively; (b1)(b2) the theoretical phase distributions of ϕ1and ϕ2, respectively; (c1) (e1) (g1) the retrieved phases ϕ1 with MSSM, PCA and AIA algorithms, respectively; (d1) (f1) (h1) the differences between (b1) and (c1), (e1), (g1), respectively; (c2) (e2) (g2) the retrieved phase ϕ2with MSSM, PCA and AIA algorithms, respectively; (d2) (f2) (h2) the differences between (b2) and (c2), (e2), (g2), respectively.

Download Full Size | PDF

To further present the advantage of the proposed MSSM algorithm, Fig. 3(a)-3(c) show the variation curves of root mean square errors (RMSEs) of phase retrieval with the parameters of t,kand SNR, in which Matlab function kpeaks(500)is utilized as the phase model, A(x, y) = B(x, y) = 80exp[-0.01t(x2 + y2)], δ1=l1,δ2=l2andSNR=p. Here, t is utilized to describe the uniformity of A(x, y) and B(x, y), k represents the fringe density, respectively. In the first curve, t is changed from 1 to 40 and k = 0.2, l1 = 1.2 rad, l2 = 2.6rad, p = 50db ; in the second curve, k is changed from 0.2 to 2.2 and t = 10, l1 = 1.2 rad, l2 = 2.6rad, p = 50db ; in the third curve, p is changed from 25db to 64db, and k = 0.2, t = 10, l1 = 1.2 rad, l2 = 2.6rad . For clarity, we mark a individual point of each curve and present the corresponding fringe pattern, as shown in Figs. 3(a)-3(c); and Figs. 3(d)-3(f) also give the corresponding 2-dimentional distribution variation of RMSEs with δ1andδ2achieved with different algorithms, in which k = 0.6, t = 10 and p = 40db. Here, the phase shifts are chosen as 1.3rad>δ1>0.3rad,2.8rad>δ2>1.8rad to make sure that the error induced by the incorrect phase shifts estimation is not overwhelmed by the error induced by random noise. Obviously, we can find that the proposed MSSM algorithm exhibits several promising properties: First, the non-constant of A(x, y) and B(x, y) are allowed, as shown in Fig. 3(a), and the variation of RMSE of phase retrieval with MSSM algorithm is very small when A(x, y) and B(x, y) are greatly changed from 80exp[-0.01(x2 + y2)] to 80exp[-0.4(x2 + y2)]; second, the result is non-sensitive to the variation of fringe number in interference pattern, as shown in Fig. 3(b). When the phase model is changed from 0.2peaks(500) to2.2peaks(500), respectively corresponding to the USFP and dense fringe pattern, it is observed that the using the AIA and PCA algorithms, the RMSEs reveal large fluctuation while almost unchanged with MSSM algorithm. These results demonstrate that by using the proposed MSSM algorithm, the error induced by the unknown phase shifts, acting as a ripple phase component, has been effectively eliminated for both the USFPs and dense fringe pattern.

 figure: Fig. 3

Fig. 3 Variation curves of RMSE with different parameters (a) t ; (b) k; (c) SNR; the 2-dimentional distribution variation of RMSEs with δ1,δ2 achieved by different algorithms (d) MSSM; (e) PCA; (f) AIA.

Download Full Size | PDF

Of course, in the proposed MSSM algorithm, the filtering window parameter of high-pass filter is related with the accuracy, but the key issue is that the accuracy cannot be too sensitive to this blind parameter. To prove the accuracy of phase retrieval with the proposed MSSM algorithm is not sensitive to the filtering window parameter (especially for USFP), a group of simulation result is shown, in which A(x, y) = 80exp[-0.05(x2 + y2)] + 80 and B(x, y) = 80exp[-0.05(x2 + y2)], ϕ=0.2peaks(500)and the filtering function h(fx,fy)=h1(fx,fy)h2(fx,fy), h1(fx,fy)=exp(fx2+fy22302),h2(fx,fy)=1exp(fx2+fy22σ2).The SNR of fringe-patterns is 50db and the phase shifts are 0rad, 1.2rad and 2.6rad, respectively. Figure 4 shows the variation curves of RMSEs and l1, l 2 with the filtering window σ.

 figure: Fig. 4

Fig. 4 Variation curves of (a) RMSE and (b) the error level (l1 and l2) with the filtering window σ.

Download Full Size | PDF

We can see though the fringe-patterns have very few fringes and nonuniform background, by using a wide-range of filtering window, the residual background occupies only 10%-20% of total energy, and the RMSE of phase retrieval is very stable and small(0.01 to 0.015rad). These results demonstrate that the proposed MSSM method can work well even when the fringe-patterns have very few fringes and nonuniform background. In addition, Figs. 4(a) and 4(b) are strong correlative, further indicating that l1 and l 2 are suitable for describing the accuracy of proposed MSSM algorithm.

According to the spatial spectral analysis, a more obvious aspect of the advantage of the proposed method compared with AIA is presented. For the second step of AIA, when the ϕ(x,y)is known, it is assumed that A(x, y) and B(x, y) are constants, and the phase shifts δi, A0, B0, can be achieved by the spatial fitting, which is essentially equivalent to the spectral fitting, and the proposed MSSM algorithm also can perform the inverse transform and achieve parameters fitting in spatial domain. Actually, the background removal procedure is also existed in AIA during phase shifts determination, which is equivalent to a high-pass filter of h(fx,fy)=1exp(fx2+fy22σ2) with σ0, suppressing only zero-frequency component, so the more residual values of A(x, y) will remain and l1 and l2 becomes larger than those of the proposed MSSM algorithm. In the case that A(x, y) is nonuniform, the accuracy of MSSM algorithm will sharply increase when the σbecomes larger from σ=0. This result presents that the traditional constant assumption of A(x, y), which is adopted by many algorithms, including the AIA or Lissajous figure algorithm, should be amended. That is to say, to achieve the smaller l1 and l2, it should be reasonable to allow a slight extension of the above assumption in spatial spectrum. As a result, AIA or Lissajous figure algorithms might achieve an essential improvement in accuracy by this consideration.

4. Experiment

Experiments are also carried to exhibit the expansibility of the proposed MSSM algorithm in both USFPs and fringe-patterns with many fringes. First, 300-frame phase-shifting interferograms with circular phase distribution are captured and the reference phase is achieved by using temporal Fourier transform method, in which a large amount of interferograms can guarantee the accuracy of phase retrieval. A He-Ne stabilized frequency laser is utilized as light source, a CCD with size of 768 × 576 pixels and pixel size of 0.01mm is employed to capture interferograms. Second, a local area of interferogram with size of 350 × 350 pixels is intercepted to achieve phase retrieval, in which several fringes exist in interferogram while A(x, y) and B(x, y) are not constant. As shown in Fig. 5, we can see that using the MSSM algorithm, the rippling oscillation error can be more effectively eliminated relative to the PCA and AIA algorithms, no obvious miscalibration error appears in Fig. 5(d). And Table 1 gives the quantitative calculation result of phase retrieval.

 figure: Fig. 5

Fig. 5 Experimental result of fringe-pattern with many fringes (a) one-frame fringe-pattern; (b) the intercepted calculation area from (a); (c) the reference phase distribution of (b); the retrieved phases and the corresponding differences between the reference phase and the achieved phases with different algorithms (d) (g) MSSM; (e) (h) PCA; (f) (i)AIA, respectively.

Download Full Size | PDF

Tables Icon

Table 1. RMSE, PVE and calculation time of phase retrieval with different algorithms in Fig. 5

Subsequently, we decrease the size of interferogram to achieve the USFP (80 × 80 pixels), as shown in Fig. 6 and Table 2. For the USFP, it is found that the proposed MSSM algorithm can achieve accurate circular phase distribution while the PCA and AIA algorithms cannot work well in this case. Note that the average B(x, y) in Fig. 6(b) is larger than that in Fig. 5(b), which will make the SNR of the former is better than the latter due to the dark noise of CCD. Correspondingly, using the MSSM algorithm, the RMSE of phase retrieval from Fig. 6 (0.024rad) is lower than that of Fig. 5 (0.037rad). Unfortunately, both PCA and AIA algorithms cannot benefit from this advantage due to the serious miscalibration error.

 figure: Fig. 6

Fig. 6 Experimental results of USFP (a) One-frame interferogram; (b) the intercepted USFP from (a); (c) the reference phase map of (b); the retrieved phases and the corresponding differences between the reference phase and the achieved phases with different algorithms (d) (g) MSSM; (e) (h) PCA; (f) (i)AIA, respectively.

Download Full Size | PDF

Tables Icon

Table 2. RMSE, PVE and calculation time of phase retrieval with different algorithms in Fig. 6

The above results present that AIA and PCA algorithms can work well only for the interferograms containing many fringes while the MSSM algorithm is more robust. Further, the proposed MSSM algorithm is utilized to on-axis phase-shifting digital holographic microscopy system, as shown in Fig. 7, in which the phase aberration is eliminated by the objective matching technique, and two same objectives MO1, MO2 with magnification of 40 × are placed in the reference arm and object arm, respectively. A T-lymphocyte cell is chosen as the tested sample. Figure 8 and Table 3 give the corresponding results of phase retrieval with MSSM, AIA and PCA algorithms, respectively.

 figure: Fig. 7

Fig. 7 Experimental setup of on-axis phase-shifting digital holographic microscopy system. MO1,MO2: microscope objective; PZT: piezoelectric ceramic transducer; M1, M2: mirror; BS1, BS2: beam splitter.

Download Full Size | PDF

 figure: Fig. 8

Fig. 8 Experimental results of a T-lymphocyte cell (a) three-frame interferograms; (b) the reference phase of (a) achieved by temporal Fourier transform algorithm; the unwrapped phase distributions and the corresponding differences between the reference phase and the wrapped phases achieved with different algorithms (c)(f) PCA; (d)(g) MSSM; (e)(h) AIA; (i) the cross-section curves of the 170th row in (f), (g) and (h), respectively.

Download Full Size | PDF

Tables Icon

Table 3. RMSE, PVE and calculation time of phase retrieval with different algorithms in Fig. 8

In Fig. 8, due to the fringes number in interferogram is too little to satisfy the condition requirement, we can see that the PCA algorithm cannot work well; moreover, the absolute constant assumption of A(x, y) and B(x, y) is also not satisfied, so the accuracy of AIA is very low. In contrast, using the proposed MSSM algorithm, the phase retrieval reveals high accuracy. From these results, we can conclude that the proposed MSSM algorithm is robust in both the fringe number and the non-constant of A(x, y) and B(x, y).

5. Conclusion

In conclusion, based on Fourier domain estimation technique and a small amount phase-shifting interferograms with USFPs, a novel self-calibration MSSM algorithm is proposed, in which the phase shifts is estimated through performing the spectral division of interferograms. The achieved results demonstrate that although the proposed MSSM algorithm is conceived as a solution for USFP, it also reveals high accuracy for fringe-patterns with many fringes. What’s more, the proposed method has rapid calculation speed because the iterative procedure is not needed. Specially, due to no requirement for the fringe number, the proposed MSSM algorithm should be a good candidate for the recently developed interferometry methods, including white light phase-shifting interferometry, the more sufficient utilizing of spatial-bandwidth of CCD through the fringe number reducing. And this will greatly extend the applications of proposed MSSM algorithm.

Funding

National Natural Science Foundation of China (61475048, 61727814 and 61575069).

References and links

1. T. C. Poon, Digital holography and three-dimensional display (Springer US, 2006).

2. P. Marquet, B. Rappaz, P. J. Magistretti, E. Cuche, Y. Emery, T. Colomb, and C. Depeursinge, “Digital holographic microscopy: a noninvasive contrast imaging technique allowing quantitative visualization of living cells with subwavelength axial accuracy,” Opt. Lett. 30(5), 468–470 (2005). [PubMed]  

3. M. Takeda, H. Ina, and S. Kobayashi, “Fourier-transform method of fringe-pattern analysis for computer-based topography and interferometry,” J. Opt. Soc. Am. A 72, 156–160 (1982).

4. Y. Wang, X. Qiu, J. Xiong, B. Li, L. Zhong, S. Liu, Y. Zhou, J. Tian, and X. Lu, “General spatial phase-shifting interferometry by optimizing the signal retrieving function,” Opt. Express 25(7), 7170–7180 (2017). [PubMed]  

5. I. Yamaguchi and T. Zhang, “Phase-shifting digital holography,” Opt. Lett. 22(16), 1268–1270 (1997). [PubMed]  

6. A. Safrani and I. Abdulhalim, “Real-time phase shift interference microscopy,” Opt. Lett. 39(17), 5220–5223 (2014). [PubMed]  

7. D. Paganin and K. A. Nugent, “Noninterferometric Phase Imaging with Partially Coherent Light,” Phys. Rev. Lett. 80, 2586–2589 (1998).

8. G. Pedrini, W. Osten, and Y. Zhang, “Wave-front reconstruction from a sequence of interferograms recorded at different planes,” Opt. Lett. 30(8), 833–835 (2005). [PubMed]  

9. M. Servín, J. A. Quiroga, and J. M. Padilla, Fringe Pattern Analysis for Optical Metrology: Theory, Algorithms, and Applications (Wiley-VCH, 2014).

10. C. J. Morgan, “Least-squares estimation in phase-measurement interferometry,” Opt. Lett. 7(8), 368–370 (1982). [PubMed]  

11. K. G. Larkin and B. F. Oreb, “Design and assessment of symmetrical phase-shifting algorithms,” J. Opt. Soc. Am. A 9, 1740–1748 (1992).

12. X. F. Xu, L. Z. Cai, Y. R. Wang, X. F. Meng, W. J. Sun, H. Zhang, X. C. Cheng, G. Y. Dong, and X. X. Shen, “Simple direct extraction of unknown phase shift and wavefront reconstruction in generalized phase-shifting interferometry: algorithm and experiments,” Opt. Lett. 33(8), 776–778 (2008). [PubMed]  

13. P. Gao, B. Yao, N. Lindlein, K. Mantel, I. Harder, and E. Geist, “Phase-shift extraction for generalized phase-shifting interferometry,” Opt. Lett. 34(22), 3553–3555 (2009). [PubMed]  

14. J. Deng, H. Wang, D. Zhang, L. Zhong, J. Fan, and X. Lu, “Phase shift extraction algorithm based on Euclidean matrix norm,” Opt. Lett. 38(9), 1506–1508 (2013). [PubMed]  

15. F. Liu, Y. Wu, and F. Wu, “Correction of phase extraction error in phase-shifting interferometry based on Lissajous figure and ellipse fitting technology,” Opt. Express 23(8), 10794–10807 (2015). [PubMed]  

16. J. Deng, K. Wang, D. Wu, X. Lv, C. Li, J. Hao, J. Qin, and W. Chen, “Advanced principal component analysis method for phase reconstruction,” Opt. Express 23(9), 12222–12231 (2015). [PubMed]  

17. Z. Wang and B. Han, “Advanced iterative algorithm for phase extraction of randomly phase-shifted interferograms,” Opt. Lett. 29(14), 1671–1673 (2004). [PubMed]  

18. J. Vargas, J. A. Quiroga, and T. Belenguer, “Phase-shifting interferometry based on principal component analysis,” Opt. Lett. 36(8), 1326–1328 (2011). [PubMed]  

19. C. Meneses-Fabian and F. A. Lara-Cortes, “Phase retrieval by Euclidean distance in self-calibrating generalized phase-shifting interferometry of three steps,” Opt. Express 23(10), 13589–13604 (2015). [PubMed]  

20. I.-B. Kong and S.-W. Kim, “General algorithm of phase-shifting interferometry by iterative least-squares fitting,” Opt. Eng. 34, 183–188 (1995).

21. C. T. Farrell and M. A. Player, “Phase step measurement and variable step algorithms in phase-shifting interferometry,” Meas. Sci. Technol. 3, 953 (1992).

22. L. Fengwei, W. Jing, W. Yongqian, W. Fan, T. Maciej, P. Krzysztof, W. Yongjian, C. Qiang, and H. Xi, “Simultaneous extraction of phase and phase shift from two interferograms using Lissajous figure and ellipse fitting technology with Hilbert–Huang prefiltering,” J. Opt. 18, 105604 (2016).

23. Z. Wang, L. Millet, M. Mir, H. Ding, S. Unarunotai, J. Rogers, M. U. Gillette, and G. Popescu, “Spatial light interference microscopy (SLIM),” Opt. Express 19(2), 1016–1026 (2011). [PubMed]  

24. M. Roy, J. Schmit, and P. Hariharan, “White-light interference microscopy: minimization of spurious diffraction effects by geometric phase-shifting,” Opt. Express 17(6), 4495–4499 (2009). [PubMed]  

25. Q. Weijuan, Y. Yingjie, C. O. Choo, and A. Asundi, “Digital holographic microscopy with physical phase compensation,” Opt. Lett. 34(8), 1276–1278 (2009). [PubMed]  

26. Y. Wang, B. Li, L. Zhong, J. Tian, and X. Lu, “Spatial dual-orthogonal (SDO) phase-shifting algorithm by pre-recomposing the interference fringe,” Opt. Express 25(15), 17446–17456 (2017). [PubMed]  

27. K. Yatabe, K. Ishikawa, and Y. Oikawa, “Simple, flexible, and accurate phase retrieval method for generalized phase-shifting interferometry,” J. Opt. Soc. Am. A 34(1), 87–96 (2017). [PubMed]  

28. F. Zernike, “Phase contrast, a new method for the microscopic observation of transparent objects,” Physica 9, 686–698 (1942).

29. M. Trusiak, Ł. Służewski, and K. Patorski, “Single shot fringe pattern phase demodulation using Hilbert-Huang transform aided by the principal component analysis,” Opt. Express 24(4), 4221–4238 (2016). [PubMed]  

30. M. Trusiak and K. Patorski, “Two-shot fringe pattern phase-amplitude demodulation using Gram-Schmidt orthonormalization with Hilbert-Huang pre-filtering,” Opt. Express 23(4), 4672–4690 (2015). [PubMed]  

31. D. Saide, M. Trusiak, and K. Patorski, “Evaluation of adaptively enhanced two-shot fringe pattern phase and amplitude demodulation methods,” Appl. Opt. 56(19), 5489–5500 (2017). [PubMed]  

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (8)

Fig. 1
Fig. 1 Schematic of the spectral division, in which the background spectrum A( f x ), noise spectrum o( f x )and interference term T 1 ( f x ), T 2 ( f x )are located in the low-frequency band, high-frequency band and mid-frequency band, respectively.
Fig. 2
Fig. 2 (a1)(a2)Two-frame simulated interference patterns encoded with phase ϕ 1 and ϕ 2 , respectively; (b1)(b2) the theoretical phase distributions of ϕ 1 and ϕ 2 , respectively; (c1) (e1) (g1) the retrieved phases ϕ 1 with MSSM, PCA and AIA algorithms, respectively; (d1) (f1) (h1) the differences between (b1) and (c1), (e1), (g1), respectively; (c2) (e2) (g2) the retrieved phase ϕ 2 with MSSM, PCA and AIA algorithms, respectively; (d2) (f2) (h2) the differences between (b2) and (c2), (e2), (g2), respectively.
Fig. 3
Fig. 3 Variation curves of RMSE with different parameters (a) t ; (b) k; (c) SNR; the 2-dimentional distribution variation of RMSEs with δ 1 , δ 2 achieved by different algorithms (d) MSSM; (e) PCA; (f) AIA.
Fig. 4
Fig. 4 Variation curves of (a) RMSE and (b) the error level (l1 and l2) with the filtering window σ.
Fig. 5
Fig. 5 Experimental result of fringe-pattern with many fringes (a) one-frame fringe-pattern; (b) the intercepted calculation area from (a); (c) the reference phase distribution of (b); the retrieved phases and the corresponding differences between the reference phase and the achieved phases with different algorithms (d) (g) MSSM; (e) (h) PCA; (f) (i)AIA, respectively.
Fig. 6
Fig. 6 Experimental results of USFP (a) One-frame interferogram; (b) the intercepted USFP from (a); (c) the reference phase map of (b); the retrieved phases and the corresponding differences between the reference phase and the achieved phases with different algorithms (d) (g) MSSM; (e) (h) PCA; (f) (i)AIA, respectively.
Fig. 7
Fig. 7 Experimental setup of on-axis phase-shifting digital holographic microscopy system. MO1,MO2: microscope objective; PZT: piezoelectric ceramic transducer; M1, M2: mirror; BS1, BS2: beam splitter.
Fig. 8
Fig. 8 Experimental results of a T-lymphocyte cell (a) three-frame interferograms; (b) the reference phase of (a) achieved by temporal Fourier transform algorithm; the unwrapped phase distributions and the corresponding differences between the reference phase and the wrapped phases achieved with different algorithms (c)(f) PCA; (d)(g) MSSM; (e)(h) AIA; (i) the cross-section curves of the 170th row in (f), (g) and (h), respectively.

Tables (3)

Tables Icon

Table 1 RMSE, PVE and calculation time of phase retrieval with different algorithms in Fig. 5

Tables Icon

Table 2 RMSE, PVE and calculation time of phase retrieval with different algorithms in Fig. 6

Tables Icon

Table 3 RMSE, PVE and calculation time of phase retrieval with different algorithms in Fig. 8

Equations (14)

Equations on this page are rendered with MathJax. Learn more.

I n (x,y)=A(x,y)+B(x,y)cos[ϕ(x,y)+ δ n ]+ o n (x,y)n=1......N.
I 1 ( f x )=A( f x )+ζ[B(x)cosϕ(x)]+ o 1 ( f x ) =A( f x )+ T 1 ( f x )+ o 1 ( f x ) .
I 2 ( f x )=A( f x )+ζ{B(x)cos[ϕ(x)+ δ 1 ]}+ o 2 ( f x ) =A( f x )+cos δ 1 T 1 ( f x )sin δ 1 T 2 ( f x )+ o 2 ( f x ) .
I 3 ( f x )=A( f x )+ζ{B(x)cos[ϕ(x)+ δ 2 ]}+ o 3 ( f x ) =A( f x )+cos δ 2 T 1 ( f x )sin δ 2 T 2 ( f x )+ o 3 ( f x ) .
I ˜ 1 ( f x ) T ˜ 1 ( f x ).
I ˜ 2 ( f x ) T ˜ 1 ( f x )cos δ 1 T ˜ 2 ( f x )sin δ 1 .
I ˜ 3 ( f x ) T ˜ 1 ( f x )cos δ 2 T ˜ 2 ( f x )sin δ 2 .
C 1 I ˜ 2 ( f x )+ C 2 I ˜ 3 ( f x )= I ˜ 1 ( f x ).
C 1 cos δ 1 + C 2 cos δ 2 =1.
C 1 sin δ 1 = C 2 sin δ 2 .
( A(x,y) B(x,y)cosϕ(x,y) B(x,y)sinϕ(x,y) )= ( 1 cos δ 1 sin δ 1 1 cos δ 2 sin δ 2 1 cos δ 3 sin δ 3 ) 1 ( I 1 I 2 I 3 ).
ϕ(x,y)=arctan[ B(x,y)sinϕ(x,y) B(x,y)cosϕ(x,y) ].
l 1 = f x , f y abs[ A ˜ ( f x , f y )] f x , f y abs[ T ˜ 1 ( f x , f y )] .
l 2 = f x , f y abs[ A ˜ ( f x , f y )] f x , f y abs[ T ˜ 2 ( f x , f y )] .
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.