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

Fast and robust two-frame random phase-shifting interferometry without pre-filtering

Open Access Open Access

Abstract

To obtain higher phase accuracy with less computation time in phase-shifting interferometry, a random phase-shifting algorithm based on principal component analysis and least squares iteration (PCA&LSI) is proposed. The algorithm does not require pre-filtering, and only requires two-frame phase-shifted interferograms and less computation time to obtain a relatively accurate phase distribution. This method can still extract the phase with high precision when there are few fringes in the interferogram. Moreover, it eliminates the limitation that the PCA algorithm needs more than three frames of interferograms with uniform phase shift distribution to accurately extract the phase. Numerical simulations and experiments confirm that the method is suitable for complex situations with different fluctuations in background intensity and modulation amplitude. And it can still achieve accurate phase extraction compared with other methods under different noise conditions.

© 2022 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

1. Introduction

Phase-shifting interferometry (PSI) is a powerful tool for precision testing with its high precision and non-contact characteristics [1]. The high performance of PSI is guaranteed by the precision and efficiency of the phase-shifting algorithm (PSA), and an excellent PSA should have two advantages which are high accuracy and timesaving feature [2]. Generally speaking, the PSA requires at least three interferograms as input, and the amount of phase shift between frames needs to be known accurately. However, due to the inevitable air turbulence, mechanical vibration, electromagnetic disturbance and even the nonlinear factors of the phase shifter, it is difficult to obtain an accurate phase shift amount, resulting in inaccurate final phase extraction [35].

Over the past few decades, to expand the application range of PSI, many PSAs have been proposed to deal with random phase shifts [614]. In 2004, Wang et al. proposed an advanced iterative algorithm (AIA) based on the least squares iterative process, which solved the limitations of the iterative algorithm by separating the frame-by-frame iteration from the pixel-by-pixel iteration , which provides a robust phase output [6]. In 2011, Vargas et al. applied the idea of dimensionality reduction in multivariate statistical theory to PSI, and proposed a principal component analysis (PCA) algorithm, which took the phase-shifted interferogram sequence as the initial variables. By solving the principal components of the initial variables, the phase information to be measured is then obtained. [7]. In 2020, Escobar et al. proposed a random PSA based on the principle of matrix decomposition, which takes the phase-shifted interferogram sequence as the original variable and quickly extracts its phase information through matrix decomposition [8]. However, all the above algorithms require at least three frames of interferograms.

Using a smaller number of interferograms can greatly reduce the hardware and environmental requirements, so many scholars try to solve this problem with a single-frame algorithm [1520]. However, phase reconstruction using only a single interferogram is difficult, especially for those containing closed fringes, and the over-underdetermined equation makes many single-frame methods extremely computationally inefficient [21]. In addition, symbol ambiguity during single-frame demodulation has also become one of the bottlenecks hindering the development of single-frame interference technology [22]. Considering that the two-frame algorithm has higher measurement accuracy than the single-frame algorithm, and it is more important that two-frame are the minimum number of interferograms to reconstruct the phase without local sign ambiguity. Therefore, the two-frame algorithm is considered a good compromise between single-frame and multi-frame algorithms [23].

Since the two-frame PSA was proposed, it has received lasting attention from scholars [2430]. Especially in the past ten years, the research on two-frame algorithms has continued to heat up [3140]. From 2011 to 2012, Vargas et al. successively proposed three two-frame random PSAs: the self-tuning method (ST), the regularized optical flow method (OF) and the Gram-Schmidt orthogonalization method (GS). Especially the GS method, because of its speed and accuracy, has become one of the most popular phase reconstruction methods in two-frame interferometry [3133]. In 2012, Deng et al. proposed a method to calculate the unknown phase shift using extreme value of interference (EVI), and then obtain the phase distribution through the arctangent operation [34]. In 2017, Tian et al. proposed a local mask-based method to estimate the amount of phase shift to achieve phase demodulation [35]. Around 2019, Cheng et al. proposed a method to directly estimate the amount of inter-frame phase shift by solving a fourth-order polynomial equation, and subsequently developed a coefficient of variation minimization (CVM) method based on minimizing the modulation term of the interferogram [37,38]. From 2020 to 2022, successively proposed the statistical averaging method (SA) of the two-frame random PSA and the simplified method of calculating the phase by first-order norm normalization [39,40]. However, many of the two-frame PSAs mentioned above require pre-filtering before phase extraction [4143]. The pre-filtering process not only cost more time, but also the complex pre-filtering parameter settings will inevitably affect the accuracy [44,45]. Methods without pre-filtering may require more than three frames of interferograms, and more acquired images means more time. Generally, without considering the complexity of the PSI system, the PSA with more interferograms has higher accuracy and slower speed, while the PSA with fewer interferograms has faster speed and lower accuracy. To balance computational accuracy and computational efficiency, it becomes necessary to explore two-frame random PSAs with fewer interferograms and without pre-filtering.

In this paper, a random two-frame PSA based on principal component analysis and least squares iterative technique (PCA&LSI) is proposed. An approximate phase-shifted interferograms sequence is first constructed to estimate the initial phase, and then a more accurate phase distribution is extracted by least squares iteration. The algorithm does not require pre-filtering, and only requires two-frame phase-shifted interferograms with less processing time to obtain an accurate phase distributions. Numerical simulations and/or comparative experiments demonstrate the stability and accuracy of the proposed PCA&LSI method under different conditions. In the following, the proposed method is introduced in detail.

2. Principle of PCA&LSI

2.1 Two-frame PCA to estimate the initial phase

The intensity expressions of two-frame phase-shifted interferograms are:

$${I_n}(x,y) = {A_n}(x,y) + {B_n}(x,y)\cos [\varphi (x,y) + {\delta _n}],\quad n = 1,2,$$
where $x$ and $y$ are spatial coordinates, and ${I_n}(x,y)$ is the $n$th phase-shifted interferogram. ${A_n}(x,y)$ and ${B_n}(x,y)$ respectively represent the background intensity and modulation amplitude, $\varphi (x,y)$ and $\delta _{n}$ are the measured phase and the phase shift. In the following, the spatial coordinates $(x,y)$ has been omitted for convenience. Equation (1) can be rewritten as:
$$\begin{aligned} {I_n} & = {B_n}\cos {\delta _n}\cos {\varphi } - {B_n}\sin {\delta _n}\sin {\varphi } + {A_n}\\ & = {\alpha _n}{I_c} + {\beta _n}{I_s} + {\kappa _n}, \end{aligned}$$
where ${\alpha _n} = {B_n}\cos {\delta _n}$, ${\beta _n} = - {B_n}\sin {\delta _n}$, ${I_c} = \cos \varphi$, ${I_s} = \sin \varphi$ and ${\kappa _n} = {A_n}$.

From Eq. (2), we can see that the intensity of the phase-shifted interferogram can be expressed as a linear combination of two signals, and the background intensity which can be understood as an offset constant that does not affect the principal component information. Considering that PCA requires at least three frames of interferograms to realize the phase demodulation process, we need to reconstruct the interferograms based on the two frames of existing interferogram. We noticed that the fluctuations of the background intensity and modulation amplitude usually do not vary much between two frames of phase-shifted interferogram, so it can be assumed that ${A_1} = {A_2} = A$, ${B_1} = {B_2} = B$, and through the difference between the two frames of interferogram, we can get:

$$\begin{aligned} {I_1} - {I_2} & = 2B\sin (\varphi + \frac{\delta }{2})\sin \frac{\delta }{2}\\ & = B(1 - \cos {\delta _n})\cos \varphi + B\sin {\delta _n}\sin \varphi\\ & = {\alpha _{n}^{'}}{I_c} + {\beta _{n}^{'}}{I_s}, \end{aligned}$$
where $\alpha _{n}^{'} = {B}(1 - \cos {\delta _n})$, $\beta _{n}^{'} = {B}\sin {\delta _n}$, and we set ${\delta _1} = 0$ and ${\delta _2} = \delta$ generally. Equation (3) can still be expressed as a linear combination of the two signals, even though the principal components ${I_c}$ and ${I_s}$ do not change. Therefore, in a “rough” case, Eq. (3) can be taken as another frame of interferogram $I_3$. Then a three-frame interferogram sequence can be expressed in a matrix form as:
$$X = {[{I_1},{I_2},{I_3}]^{T}}.$$
In Eq. (4), $T$ denotes the transposing operation. The first step in PCA is to subtract the mean of each variable in the dataset, which we can estimate as:
$${X_m} = ({I_1} + {I_2} + {I_3})/3.$$
The second step of the PCA algorithm is to obtain the covariance matrix $C$ from Eq. (4) and Eq. (5):
$$C = [X - {X_m}]{[X - {X_m}]^T}.$$
The covariance matrix $C$ is a square and symmetric matrix with size of $3 \times 3$. According to the matrix theory, the orthonormal basis of an image set can be calculated by finding the eigenvalues and eigenvectors from a symmetric matrix $C$. And the diagonalization of matrix $C$ can be expressed as:
$$D = {Q^{T}}CQ,$$
where $D$ is the diagonal covariance matrix, and $Q$ is the orthogonal transformation matrix. From a practical point of view, this diagonalization process is achieved by the singular value decomposition (SVD) algorithm. Once the covariance matrix is diagonalized and the orthogonal matrix $Q$ is obtained, the principal components can be calculated by principal component transformation:
$$Y = {Q^{T}}(X - {X_m}),$$
where $Y$ are the principal component of the $X - {X_m}$, and $Y = {[{y_1},{y_2},{y_3}]^T}$. The first two principal components ${y_1}$ and ${y_2}$ with the two biggest eigenvalues correspond to the two uncorrelated quadrature signals. Thus, the initial phase to be measured can be extracted using the following expression:
$$\tilde \varphi = {\tan ^{ - 1}} ({y_1}/{y_2}),$$
where $\tilde \varphi$ represents the estimated initial phase. From the analysis procedure in Section 2.1, although the uncontrollable pre-processing problem is solved, the phase estimated by Eq. (9) is obviously inaccurate. To solve this problem, this paper introduces a least squares strategy to suppress the phase error.

2.2 Least squares suppression of initial phase error

For a set of data, if the functional model is known, the values of each parameter in the functional model can be solved by means of data fitting. By extension to each frame of the interferogram, the phase shift can be determined from a known phase distribution using a least squares algorithm (LSA), which can be easily incorporated into an iterative process. The initial phase estimated by the PCA algorithm constructed in Section 2.1 can be combined with LSA to suppress the initial phase error. Here we redefine the phase-shifted interferogram:

$${I_{nk}} = {A_{nk}} + {B_{nk}}\cos [{\varphi _k} + {\delta _n}],$$
where the subscript $(n = 1,2)$ denotes the number of the phase-shifted interferogram, $(k = 1,2,\ldots,K)$ denotes the individual pixel in each interferogram, ${\varphi _k}$ is the phase of the $k$th pixel, and ${\delta _n}$ are the phase shift of the $n$th interferogram.

After the initial phase ${\varphi _k}$ is estimated, the phase shift ${\delta _n}$ can be easily determined by using the least squares strategy. Ideally, the background intensity and modulation amplitude in a frame of interferogram are constant variables. In practical conditions, compared with the cosine change of the phase distribution, the background intensity and modulation amplitude are still relatively slow variables. Therefore, it is assumed here that there is no intra-frame variation in background intensity and modulation amplitude, that is, no inter-pixel variation, ${A_{n1}} = {A_{n2}} = \cdots = {A_{nK}}$ and ${B_{n1}} = {B_{n2}} = \cdots = {B_{nK}}$, and they are just the functions of frames. For the $n$th interferogram, there exists: $a_n = {A_n}$, $b_n = {B_n}\cos {\delta _n}$ and $c_n = - {B_n}\sin {\delta _n}$, so Eq. (10) can be simplified to:

$${I_{nk}} = a_n + b_n\cos {\varphi _k} + c_n\sin {\varphi _k}.$$
The sum of the squares of the differences between the measured intensity and the theoretical intensity of the interferogram can be expressed as:
$${S_n} = \sum\nolimits_{k = 1}^K {{{( {{I_{nk}} - I_{nk}^t} )}^2}} = \sum\nolimits_{k = 1}^K {{{( {{a_{n}} + {b_{n}}\cos {\varphi _k} + {c_n}\sin {\varphi _k} - I_{nk}^t} )}^2}} .$$
To obtain the sequence of interferograms, namely the parameters $a_{n}$, $b_{n}$ and $c_{n}$ in Eq. (11), according to the least squares theory [6], it is necessary to minimize ${S_n}$. And the following conditions should be satisfied in turn:
$$\partial {S_n}/\partial a_n = 0, \partial {S_n}/\partial b_n = 0, \partial {S_n}/\partial c_n = 0$$
so:
$$\left[ {\begin{array}{c} {a_n}\\ {b_n}\\ {c_n} \end{array}} \right] = {\left[ {\begin{array}{cc} {\begin{array}{ccc} N & {\sum\nolimits_{k = 1}^K {\cos {\varphi _k}} } & {\sum\nolimits_{k = 1}^K {\sin {\varphi _k}} } \end{array}}\\ {\begin{array}{ccc} {\sum\nolimits_{k = 1}^K {\cos {\varphi _k}} } & {\sum\nolimits_{k = 1}^K {{{\cos }^2}{\varphi _k}} } & {\sum\nolimits_{k = 1}^K {\sin {\varphi _k}\cos {\varphi _k}} } \end{array}}\\ {\begin{array}{ccc} {\sum\nolimits_{k = 1}^K {\sin {\varphi _k}} } & {\sum\nolimits_{k = 1}^K {\sin {\varphi _k}\cos {\varphi _k}} } & {\sum\nolimits_{k = 1}^K {{{\sin }^2}{\varphi _k}} } \end{array}} \end{array}} \right]^{ - 1}}\left[ {\begin{array}{c} {\sum\nolimits_{k = 1}^K {{I_{nk}}} }\\ {\sum\nolimits_{k = 1}^K {{I_{nk}}\cos {\varphi _k}} }\\ {\sum\nolimits_{k = 1}^K {{I_{nk}}\sin {\varphi _k}} } \end{array}} \right].$$
The three sets of unknowns $a_n$, $b_n$ and $c_n$ can be obtained according to Eq. (14). Then the background intensity, the modulation amplitude and the phase shift of the $n$th interferogram can be determined by:
$$\begin{aligned} {A_n} &= {a_n},\\ {B_n} &= \sqrt {b_n^2 + c_n^2}, \end{aligned}$$
$${\delta _n} = {\tan ^{ - 1}}( - {c_n}/{b_n}).$$
For the phase-shifted interferograms model shown in Eq. (10), the phase shifts ${\delta _1}$ and ${\delta _2}$ of the two-frame interferograms can be calculated by Eq. (16), respectively. And the relative phase shift between the two frames of interferogram can be obtained as:
$$\delta = {\delta _2} - {\delta _1}.$$
Then, by substituting Eq. (15) and Eq. (17) into the system of equations shown in Eq. (11), the following equations can be obtained:
$$\begin{aligned} \cos {\varphi_ k} &= ({I_1} - {A_1})/{B_1},\\ \sin {\varphi_ k} &= \left( {({I_1}{B_2}\cos \delta - {I_2}{B_1}) - ({A_1}{B_2}\cos \delta - {A_2}{B_1})} \right)/({B_1}{B_2}\sin \delta). \end{aligned}$$
According to Eq. (18), the updated phase distribution can be obtained using an arctangent operation:
$${\varphi_ k} = {\tan ^{ - 1}}\left( {\frac{{({I_1}{B_2}\cos \delta - {I_2}{B_1}) - ({A_1}{B_2}\cos \delta - {A_2}{B_1})}}{{({I_1} - {A_1}){B_2}\sin \delta }}} \right).$$
The phase calculated using Eq. (19) generally has higher measurement accuracy than Eq. (9), and the phase measurement accuracy can be further improved by introducing an iterative strategy.

2.3 Iterative strategy improves phase measurement accuracy

Based on the method principles of Section 2.1 and Section 2.2, to further improve the accuracy of the phase calculation, this paper finally proposes the PCA&LSI method by introducing an iterative strategy. The PCA method has the advantage of fast measurement and eliminates the uncontrollable pre-filtering process. The LSA method has the advantage of easily introducing an iterative strategy, thereby achieving high-precision measurement requirements. This section effectively combines these two advantages, and briefly summarizes the process of the proposed PCA&LSI method as follows:

1) Construct the interferogram sequence, apply the PCA strategy to estimate the principal component components, and obtain the initial phase distribution from the Eq. (9);

2) For the initial phase distribution obtained in step 1), use the LSA strategy to calculate the inter-frame phase shift $\delta$, the background intensity ${A_n}$ and the modulation amplitude ${B_n}$. The phase distribution is recalculated by Eq. (19);

3) Repeat step 2) with the updated phase distribution until the termination condition shown below is satisfied:

$$\rm {RMS}({\varphi_ {k} ^{i}} - {\varphi_ {k} ^{i - 1}}) < \xi,$$
where $\xi$ is the predefined iterative convergence threshold, $10^{-5}$ is selected in this paper, and the superscript $i$ represents the number of iterations. The corresponding phase distribution under the termination condition is the phase distribution $\varphi _ k$ to be measured.

The PCA&LSI algorithm is illustrated in Fig. 1, and the dashed line part represents the iterative process.

 figure: Fig. 1.

Fig. 1. Flow chart of the PCA&LSI algorithm.

Download Full Size | PDF

3. Simulation of PCA&LSI

To verify the effectiveness of the proposed PCA&LSI method, we conduct a series of numerical simulations and compare the proposed method with two other excellent two-frame random PSAs without pre-filtering: LEF and PCA&LEF. In the following, all computations in this paper are performed with a 2.90 GHz Intel Core i7-10700 CPU and we use the Matlab software for coding. According to Eq. (1), two-frame interferograms with a size of 512 $\times$ 512 pixels are generated. For more generality, the background intensity and the modulation amplitude of two-frame interferograms are set as non-uniform terms, ${A_n} = N_A\exp [ - 0.02({x^2} + {y^2})]$, ${B_n} = N_B\exp [ - 0.02({x^2} + {y^2})]$, where the $N_A$ of $1$st and $2$nd interferograms are set as 1.22 and 1.18, and the $N_B$ of $1$st and $2$nd interferograms are set as 1.08 and 1.12, respectively. The reference phase and the random phase shift are preset with $\varphi (x,y) = 4\pi ({x^2} + {y^2})$ and $\delta$ = 1.256 rad. In addition, the random noise with the signal-to-noise ratio (SNR) of 35dB is added to the two-frame interferogram. In Fig. 2, the two frames of the generated interferogram and the reference phase are shown, respectively.

 figure: Fig. 2.

Fig. 2. Simulated two-frame phase-shifted interferograms and the reference phase. (a) The first interferogram, (b) the second interferogram, and (c) the reference phase.

Download Full Size | PDF

In the first simulation, we use the proposed PCA&LSI method to extract the phase from the simulated interferograms, and compare with the extracted phase of the LEF, PCA&LEF method. The extracted phases of the three methods are shown in Figs. 3(a)-(c), respectively. As is shown in Figs. 3(a)-(c), it can be noticed that there is obvious “jitter” in the phase plane extracted by the LEF method, and there is some “jitter” in the phase extracted by the PCA&LEF method. The phase extraction results of the PCA&LSI method is much smoother and the result is closer to the reference phase. Figures 3(d)-(f) shows the difference between the three methods and the reference phase, respectively. As is shown in Figs. 3(d)-(f), the difference between the three methods and the reference phase gradually becomes smaller, which further indicates that the proposed method has higher phase extraction accuracy.

 figure: Fig. 3.

Fig. 3. The phase distributions calculated by (a) LEF, (b) PCA&LEF, and (c) PCA&LSI; and phase error distributions calculated by (d) LEF, (e) PCA&LEF, and (f) PCA&LSI.

Download Full Size | PDF

To quantitatively compare the performance of each algorithm, we calculated the root mean square (RMS) errors between the extracted phase and the reference phase of the three methods, and counted the calculation time of the three methods, which is shown in Table 1. From Table 1, it can see that the RMS errors of the phase distribution obtained by LEF, PCA&LEF and PCA&LSI methods are 0.3600 rad, 0.1631 rad and 0.0253 rad, respectively. The corresponding processing time are 0.4369 s, 0.5210 s, and 0.2695 s, respectively. Comparing the phase RMS errors of the three methods, the measurement accuracy of the PCA&LSI method is more than 10 times higher than that of the LEF method, and more than 5 times higher than that of the PCA&LEF method. In terms of processing time, the processing time of the PCA&LSI method is reduced by 40% compared with the LEF method, and by 50% compared with the PCA&LEF method. To further explore the efficiency of the PCA&LSI algorithm, we analyze the iterative cycle of the LSI algorithm. We noticed that the LSI algorithm converged almost after two or three iterations in all simulations. It shows that the proposed PCA&LSI is a high-precision and time-saving two-frame random PSA.

Tables Icon

Table 1. Phase RMS errors and processing time of different methods.

In the second simulation, we examine the robustness of the three methods under varying background intensities and modulation amplitude fluctuations. In the simulation, we set the background intensity and modulation amplitude as: ${A_n} = N_A\exp [ - R_{f}({x^2} + {y^2})]$, ${B_n} = N_B\exp [ - R_{f}({x^2} + {y^2})]$, where $R_{f}$ = (0.01, 0.05, 0.1, 0.2) represent different fluctuation sizes, and other conditions are the same as in the first simulation. We obtained the error distributions of the extracted phases for different methods in four cases, as shown in Fig. 4. The error distributions of different methods for extracting phase in four cases are shown in Fig. 4. The first column Figs. 4(a1)-(a4) is the error distribution map of the LEF method under different $R_f$, the second column Figs. 4(b1)-(b4) is the error distribution map of the PCA&LEF method under different $R_f$, and the third column Figs. 4(c1)-(c4) are the error distribution diagrams of the PCA&LSI method under different $R_f$. Comparing each column, we can notice that the error of the three methods increases gradually as the volatility increases. Through the horizontal comparison of the three methods, the proposed PCA&LSI method always has the highest accuracy, followed by the PCA&LEF method, and the LEF method has the worst accuracy. It shows that the proposed PCA&LSI method has stronger robustness than the other two methods.

 figure: Fig. 4.

Fig. 4. Comparison of the phase errors of different methods under different background fluctuations and modulation amplitudes. (a1)-(c1) $R_f$ = 0.01: LEF, PCA&LEF, PCA&LSI phase errors; (a2)-(c2) $R_f$ = 0.05: LEF, PCA&LEF, PCA&LSI phase errors; (a3)-(c3) $R_f$ = 0.1: LEF, PCA&LEF, PCA&LSI phase errors; (a4)-(c4) $R_f$ = 0.2: LEF, PCA&LEF, PCA&LSI phase errors.

Download Full Size | PDF

In the third simulation, the effect of different fringe numbers on the phase calculation accuracy of LEF, PCA&LEF and PCA&LSI methods is investigated. In this simulation, we set the reference phase as: $\varphi (x,y) = K_{f}\pi ({x^2} + {y^2})$ , where $K_f=1,2,\ldots,20$ represents the number of different fringes, and the other conditions are the same as in the first simulation. In Fig. 5, the abscissa represents different fringe numbers, the ordinate represents the phase root mean square error, and the three curves represent the root mean square error of the phase extracted by the three methods under different fringe numbers. Numerous studies have shown that in the case of a small number of fringes, the traditional two-frame algorithm generally encounters the problem of inability to demodulate because the approximation cannot be satisfied. There are also multiple approximation operations in the PCA algorithm, and the number of fringes in the interferogram will have a great impact on the PCA phase extraction accuracy, especially when the number of interferogram frames is small. According to the curve analysis in Fig. 5, as the number of fringes increases, the phase extraction accuracy of the three algorithms does not change much. Therefore, it can be concluded that both the PCA&LEF and PCA&LSI methods can effectively suppress the measurement error introduced by the approximation operation in the PCA algorithm. Comparing the PCA&LEF and PCA&LSI methods, it is obvious that the PCA&LSI method has better error correction ability and obtains higher phase extraction accuracy. The results of the third simulation show that the PCA&LSI method is not only insensitive to the fringe number of the interferogram, but also can more effectively suppress the phase error introduced by the approximation operation. The PCA&LSI method is a two-frame random PSA with higher measurement accuracy.

 figure: Fig. 5.

Fig. 5. Phase RMS errors of different methods under different fringe number $K_f=1,2,\ldots,20$.

Download Full Size | PDF

In the fourth simulation, the effect of random noise on the phase extraction accuracy of the PSAs was considered. The simulation uses the $awgn$ function in MATLAB to add random noise of different SNR to the two-frame interferograms, and the other conditions are the same as in the first simulation. We analyzed the effect of different SNR noises from 10 dB to 60 dB on the phase extraction of the three methods, and the results are shown in Fig. (6). Comparing the results of the three methods, the overall error of the LEF method is the largest, and the phase error hardly changes with the change of the SNR, which indicates that the main error of the LEF method in the simulation comes from the fluctuation of the background intensity and the modulation amplitude. Again, the LEF method is sensitive to fluctuations in background intensity and modulation amplitude. The phase errors of the PCA&LEF and PCA&LSI methods decrease with the increase of the SNR, but the PCA&LSI method can always obtain better results than the PCA&LEF method, indicating that the PCA&LSI method can better suppress noise. From Fig. 6, we can also notice that when the SNR exceeds 45dB, the phase extraction error of the proposed PCA&LSI method is almost negligible, indicating that the PCA&LSI method has stronger noise robustness.

 figure: Fig. 6.

Fig. 6. Phase RMS errors of different methods under different random noise.

Download Full Size | PDF

Four numerical simulations show that the proposed algorithm is robust in different situations. The PCA&LSI algorithm can extract the phase with high precision from the interferograms with an unknown phase shift. Based on the above different simulations, the advantages of the proposed PCA&LSI algorithm can be summarized as: 1) No time-consuming pre-filtering operation; 2) Less sensitive to fluctuating background intensity and modulation amplitude; 3) Effectively repair the approximation error introduced when the number of fringes is small; 4) Partially suppress the effect of measurement errors introduced by random noise. In short, the proposed method is a time-saving and robust two-frame random PSA.

4. Experiment of PCA&LSI

To further verify the performance of PCA&LSA, the three methods are compared and tested using experimental interferograms. Without loss of generality, two sets of interferogram sequences are selected in the experiment, one is the straight fringes interferogram and the other is the circular fringes interferogram. Two sets of experimental interferograms used in the experiments are shown in Figs. 7(a1),(a2) and Figs. 7(b1),(b2). To provide a reference phase for quantitative performance estimates, 19 frames of experimental phase-shifted interferograms were acquired for each of the two sets of interferogram sequences. For the two sets of interferogram sequences, use multi-frame AIA [6] to extract the phase from the 19 frames interferogram sequence, respectively. And then the obtained phases were unwrapped as the two sets of reference phases using a phase unwrapping algorithm [46], which are shown in Figs. 7(c) and 7(d), respectively.

 figure: Fig. 7.

Fig. 7. The experimental interferograms: (a1),(a2) two-frame interferograms with straight fringes, (b1),(b2) two-frame interferograms with circular fringes, (c),(d) two sets of reference phase.

Download Full Size | PDF

Figures 8 and 9 show the measurement results of the experimental straight fringes interferogram and the experimental circular fringes interferogram under three different methods, respectively. Figures 8(a)-(c) and Figs. 9(a)-(c) are the extracted phase distributions, Figs. 8(d)-(j) and Figs. 9(d)-(j) are the difference map of the extracted phase and the reference phase. Comparing the results in Fig. 8, the three methods have successfully achieved phase extraction. This is because the straight fringes interferogram in Figs. 7(a1),(a2) is relatively uniform, and then we will carry out a quantitative analysis to better compare the accuracy of the three methods. As for the results in Fig. 9, due to the obvious fluctuations in the background intensity and modulation amplitude in the circular fringes interferogram in Figs. 7(b1),(b2), the phase extraction of the LEF method almost fails, and the results of PCA&LSI are relatively better than those of PCA&LEF. From Fig. 8 and Fig. 9, it can be concluded that the proposed PCA&LSI method can obtain stable and higher phase extraction results in different situations.

 figure: Fig. 8.

Fig. 8. Experimental comparison of the straight fringes. The phase extracted by (a) LEF, (b) PCA&LEF, (c) PCA&LSI; and the differences between the reference and phase extracted by (d) LEF, (e) PCA&LEF, (f) PCA&LSI.

Download Full Size | PDF

 figure: Fig. 9.

Fig. 9. Experimental comparison of the circular fringes. The phase extracted by (a) LEF, (b) PCA&LEF, (c) PCA&LSI; and the differences between the reference and phase extracted by (d) LEF, (e) PCA&LEF, (f) PCA&LSI.

Download Full Size | PDF

The RMS errors of the phases obtained by the LEF, PCA&LEF and PCA&LSI methods are shown in Table 2, respectively. For straight fringes, the phase RMS error values of the three methods LEF, PCA&LEF and PCA&LSI are 0.3095 rad, 0.2636 rad and 0.2487 rad, respectively. For the circular fringes, the phase RMS error values of the three methods LEF, PCA&LEF and PCA&LSI are 0.5727 rad, 0.4342 rad and 0.3862 rad, respectively. In the experiment, both the straight fringes and the circular fringes obtained similar results to those in the simulation. The LEF method had the worst phase extraction accuracy, followed by the PCA&LEF method, and the PCA&LSI method had higher phase extraction accuracy.

Tables Icon

Table 2. Phase RMS errors and processing time of different methods.

The processing time of the three methods is also counted in Table 2. For straight fringes, the processing times of the three methods of LEF, PCA&LEF and PCA&LSI are 0.1360 s, 0.3026 s and 0.0737 s, respectively. For circular fringes, the processing times of the three methods LEF, PCA&LEF and PCA&LSI are 0.1907 s, 0.5594 s and 0.1240 s, respectively. The PCA&LSI method proposed in this paper still maintains higher computational efficiency. This shows that the proposed PCA&LSI method is a fast and robust two-frame random PSA under experimental conditions.

5. Conclusion

This paper presents a two-frame random PSA without pre-filtering based on principal component analysis and least squares technologies. First, an approximate interferometric sequence is constructed, and the initial phase is approximately estimated by the PCA method. The phase error is then suppressed by the least squares, introducing an iterative policy to obtain a more accurate phase distribution. The algorithm does not require pre-filtering, and only requires two-frame phase-shifted interferograms and less processing time to obtain an accurate phase distribution. Numerical simulation and experiments verify that the PCA&LSI method can accurately extract the phase in a variety of complex situations, such as fluctuations in background strength and modulation amplitude, under different background noise, and different stripes. The proposed PCA&LSI method has potential application value in fast and stable two-frame random PSI.

Funding

National Natural Science Foundation of China (61827825).

Disclosures

The authors declare no conflicts of interest.

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. D. Malacara, Optical Shop Testing (John Wiley & Sons, Inc., 2007).

2. H. Zhang, H. Zhao, Z. Zhao, Y. Zhuang, and C. Fan, “Two-frame fringe pattern phase demodulation using gram-schmidt orthonormalization with least squares method,” Opt. Express 27(8), 10495–10508 (2019). [CrossRef]  

3. R. Porras-Aguilar, K. Falaggis, J. C. Ramirez-San-Juan, and R. Ramos-Garcia, “Self-calibrating common-path interferometry,” Opt. Express 23(3), 3327–3340 (2015). [CrossRef]  

4. C. Zuo, S. Feng, L. Huang, T. Tao, W. Yin, and Q. Chen, “Phase shifting algorithms for fringe projection profilometry: A review,” Opt. Lasers Eng. 109, 23–59 (2018). [CrossRef]  

5. Z. Huang, P. Memmolo, P. Ferraro, and L. Cao, “Dual-plane coupled phase retrieval for non-prior holographic imaging,” PhotoniX 3(1), 3–16 (2022). [CrossRef]  

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

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

8. M. A. Escobar, J. C. Estrada, and J. Vargas, “Phase-shifting vu factorization for interferometry,” Opt. Lasers Eng. 124, 105797 (2020). [CrossRef]  

9. J. Xu, W. Jin, L. Chai, and Q. Xu, “Phase extraction from randomly phase-shifted interferograms by combining principal component analysis and least squares method,” Opt. Express 19(21), 20483–20492 (2011). [CrossRef]  

10. M. Servin, M. Padilla, I. Choque, and S. Ordones, “Phase-stepping algorithms for synchronous demodulation of nonlinear phase-shifted fringes,” Opt. Express 27(4), 5824–5834 (2019). [CrossRef]  

11. Z. Cheng and D. Liu, “Universal phase reconstruction approach of self-calibrating phase-shifting interferometry,” Opt. Lett. 44(15), 3857–3860 (2019). [CrossRef]  

12. J. Li and Q. Zhang, “Normalized and orthogonal phase retrieval algorithm based on lissajous ellipse fitting,” Opt. Lasers Eng. 151, 106917 (2022). [CrossRef]  

13. Y. Chen and Q. Kemao, “Phase-shifting algorithms with known and unknown phase shifts: comparison and hybrid,” Opt. Express 30(5), 8275–8302 (2022). [CrossRef]  

14. K. Yatabe, K. Ishikawa, and Y. Oikawa, “Hyper ellipse fitting in subspace method for phase-shifting interferometry: practical implementation with automatic pixel selection,” Opt. Express 25(23), 29401–29416 (2017). [CrossRef]  

15. M. Servin, J. Marroquin, and F. Cuevas, “Demodulation of a single interferogram by use of a two-dimensional regularized phase-tracking technique,” Appl. Opt. 36(19), 4540–4548 (1997). [CrossRef]  

16. M. Trusiak, K. Patorski, and K. Pokorski, “Hilbert-huang processing for single-exposure two-dimensional grating interferometry,” Opt. Express 21(23), 28359–28379 (2013). [CrossRef]  

17. J. Mu noz-Maciel, V. M. Duran-Ramírez, M. Mora-Gonzalez, F. J. Casillas-Rodriguez, and F. G. Pe na-Lecona, “Demodulation of a single closed-fringe interferogram with symmetric wavefront and tilt,” Opt. Commun. 436, 168–173 (2019). [CrossRef]  

18. J. Xu, Q. Xu, and H. Peng, “Spatial carrier phase-shifting algorithm based on least-squares iteration,” Appl. Opt. 47(29), 5446–5453 (2008). [CrossRef]  

19. Y. Z. Du, G. Y. Feng, H. R. Li, J. Vargas, and S. H. Zhou, “Spatial carrier phase-shifting algorithm based on principal component analysis method,” Opt. Express 20(15), 16471–16479 (2012). [CrossRef]  

20. H. Zhang, H. Zhao, and Z. Zhao, “Fast and precise spatial-carrier phase-shifting algorithm with the matrix vu factorization,” Opt. Eng. 59(6), 1–9 (2020). [CrossRef]  

21. C. Tian, Y. Yang, T. Wei, T. Ling, and Y. Zhuo, “Demodulation of a single-image interferogram using a zernike-polynomial-based phase-fitting technique with a differential evolution algorithm,” Opt. Lett. 36(12), 2318–2320 (2011). [CrossRef]  

22. H. Zhang, L. Cao, H. Zhao, and F. Yang, “A single-frame spatial carrier phase-shifting method realized by minimizing the coefficient of variation,” J. Mod. Opt. 69(7), 359–367 (2022). [CrossRef]  

23. M. Trusiak, “Fringe analysis: single-shot or two-frames? quantitative phase imaging answers,” Opt. Express 29(12), 18192–18211 (2021). [CrossRef]  

24. T. M. Kreis and W. P. Jueptner, “Fourier transform evaluation of interference patterns: demodulation and sign ambiguity,” Proc. SPIE 1553, 263–273 (1992). [CrossRef]  

25. C. Farrell and M. Player, “Phase step measurement and variable step algorithms in phase-shifting interferometry,” Meas. Sci. Technol. 3(10), 953–958 (1992). [CrossRef]  

26. X. Xu, L. Cai, Y. Wang, X. Meng, H. Zhang, G. Dong, and X. Shen, “Blind phase shift extraction and wavefront retrieval by two-frame phase-shifting interferometry with an unknown phase shift,” Opt. Commun. 273(1), 54–59 (2007). [CrossRef]  

27. Y. Fu, Q. Wu, Y. Yao, Y. Gan, C. Liu, Y. Yang, J. Tian, and K. Xu, “Rapid and precise phase retrieval from two-frame tilt-shift based on lissajous ellipse fitting and ellipse standardization,” Opt. Express 28(3), 3952–3964 (2020). [CrossRef]  

28. V. H. Flores, A. Reyes-Figueroa, C. Carrillo-Delgado, and M. Rivera, “Two-step phase shifting algorithms: Where are we?” Opt. Laser Technol. 126, 106105 (2020). [CrossRef]  

29. L. Muravsky, O. Ostash, A. Kmet’, T. Voronyak, and I. Andreiko, “Two-frame phase-shifting interferometry for retrieval of smooth surface and its displacements,” Opt. Lasers Eng. 49(3), 305–312 (2011). [CrossRef]  

30. 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). [CrossRef]  

31. J. Vargas, J. A. Quiroga, T. Belenguer, M. Servín, and J. C. Estrada, “Two-step self-tuning phase-shifting interferometry,” Opt. Express 19(2), 638–648 (2011). [CrossRef]  

32. J. Vargas, J. A. Quiroga, C. Sorzano, J. Estrada, and J. Carazo, “Two-step interferometry by a regularized optical flow algorithm,” Opt. Lett. 36(17), 3485–3487 (2011). [CrossRef]  

33. J. Vargas, J. A. Quiroga, C. Sorzano, J. Estrada, and J. Carazo, “Two-step demodulation based on the gram–schmidt orthonormalization method,” Opt. Lett. 37(3), 443–445 (2012). [CrossRef]  

34. J. Deng, H. Wang, F. Zhang, D. Zhang, L. Zhong, and X. Lu, “Two-step phase demodulation algorithm based on the extreme value of interference,” Opt. Lett. 37(22), 4669–4671 (2012). [CrossRef]  

35. C. Tian and S. Liu, “Demodulation of two-shot fringe patterns with random phase shifts by use of orthogonal polynomials and global optimization,” Opt. Express 24(4), 3202–3215 (2016). [CrossRef]  

36. M. Wielgus, Z. Sunderland, and K. Patorski, “Two-frame tilt-shift error estimation and phase demodulation algorithm,” Opt. Lett. 40(15), 3460–3463 (2015). [CrossRef]  

37. Z. Cheng and D. Liu, “Fast and accurate wavefront reconstruction in two-frame phase-shifting interferometry with unknown phase step,” Opt. Lett. 43(13), 3033–3036 (2018). [CrossRef]  

38. Z. Cheng, D. Liu, and L. Zhang, “Random two-frame phase-shifting interferometry via minimization of coefficient of variation,” Appl. Phys. Lett. 115(12), 121107 (2019). [CrossRef]  

39. H. Zhang, H. Zhao, Z. Zhao, and C. Fan, “Fast and accurate two-frame phase demodulation algorithm with statistical averaging,” Meas. Sci. Technol. 31(6), 065015 (2020). [CrossRef]  

40. H. Zhang, F. Yang, and L. Cao, “Phase recovery technology of a dual-frame phase-shifting interferogram based on first-order norm vector normalization,” Appl. Opt. 61(5), B200–B205 (2022). [CrossRef]  

41. J. A. Quiroga and M. Servin, “Isotropic n-dimensional fringe pattern normalization,” Opt. Commun. 224(4-6), 221–227 (2003). [CrossRef]  

42. M. Trusiak, M. Wielgus, and K. Patorski, “Advanced processing of optical fringe patterns by automated selective reconstruction and enhanced fast empirical mode decomposition,” Opt. Lasers Eng. 52, 230–240 (2014). [CrossRef]  

43. Y. Wang, S. Cao, B. Li, L. Zhong, and X. Lu, “Simultaneous 2-step phase-shifting interferometry with a full-band interferometric signal being recovered,” Opt. Lett. 43(19), 4807–4810 (2018). [CrossRef]  

44. Y. Zhang, X. Tian, and R. Liang, “Random two-step phase shifting interferometry based on lissajous ellipse fitting and least squares technologies,” Opt. Express 26(12), 15059–15071 (2018). [CrossRef]  

45. Y. Zhang, X. Tian, and R. Liang, “Accurate and fast two-step phase shifting algorithm based on principle component analysis and lissajous ellipse fitting with random phase shift and no pre-filtering,” Opt. Express 27(14), 20047–20063 (2019). [CrossRef]  

46. Z. Zhao, H. Zhang, Z. Xiao, H. Du, Y. Zhuang, C. Fan, and H. Zhao, “Robust 2d phase unwrapping algorithm based on the transport of intensity equation,” Meas. Sci. Technol. 30(1), 015201 (2019). [CrossRef]  

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

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 (9)

Fig. 1.
Fig. 1. Flow chart of the PCA&LSI algorithm.
Fig. 2.
Fig. 2. Simulated two-frame phase-shifted interferograms and the reference phase. (a) The first interferogram, (b) the second interferogram, and (c) the reference phase.
Fig. 3.
Fig. 3. The phase distributions calculated by (a) LEF, (b) PCA&LEF, and (c) PCA&LSI; and phase error distributions calculated by (d) LEF, (e) PCA&LEF, and (f) PCA&LSI.
Fig. 4.
Fig. 4. Comparison of the phase errors of different methods under different background fluctuations and modulation amplitudes. (a1)-(c1) $R_f$ = 0.01: LEF, PCA&LEF, PCA&LSI phase errors; (a2)-(c2) $R_f$ = 0.05: LEF, PCA&LEF, PCA&LSI phase errors; (a3)-(c3) $R_f$ = 0.1: LEF, PCA&LEF, PCA&LSI phase errors; (a4)-(c4) $R_f$ = 0.2: LEF, PCA&LEF, PCA&LSI phase errors.
Fig. 5.
Fig. 5. Phase RMS errors of different methods under different fringe number $K_f=1,2,\ldots,20$.
Fig. 6.
Fig. 6. Phase RMS errors of different methods under different random noise.
Fig. 7.
Fig. 7. The experimental interferograms: (a1),(a2) two-frame interferograms with straight fringes, (b1),(b2) two-frame interferograms with circular fringes, (c),(d) two sets of reference phase.
Fig. 8.
Fig. 8. Experimental comparison of the straight fringes. The phase extracted by (a) LEF, (b) PCA&LEF, (c) PCA&LSI; and the differences between the reference and phase extracted by (d) LEF, (e) PCA&LEF, (f) PCA&LSI.
Fig. 9.
Fig. 9. Experimental comparison of the circular fringes. The phase extracted by (a) LEF, (b) PCA&LEF, (c) PCA&LSI; and the differences between the reference and phase extracted by (d) LEF, (e) PCA&LEF, (f) PCA&LSI.

Tables (2)

Tables Icon

Table 1. Phase RMS errors and processing time of different methods.

Tables Icon

Table 2. Phase RMS errors and processing time of different methods.

Equations (20)

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

I n ( x , y ) = A n ( x , y ) + B n ( x , y ) cos [ φ ( x , y ) + δ n ] , n = 1 , 2 ,
I n = B n cos δ n cos φ B n sin δ n sin φ + A n = α n I c + β n I s + κ n ,
I 1 I 2 = 2 B sin ( φ + δ 2 ) sin δ 2 = B ( 1 cos δ n ) cos φ + B sin δ n sin φ = α n I c + β n I s ,
X = [ I 1 , I 2 , I 3 ] T .
X m = ( I 1 + I 2 + I 3 ) / 3.
C = [ X X m ] [ X X m ] T .
D = Q T C Q ,
Y = Q T ( X X m ) ,
φ ~ = tan 1 ( y 1 / y 2 ) ,
I n k = A n k + B n k cos [ φ k + δ n ] ,
I n k = a n + b n cos φ k + c n sin φ k .
S n = k = 1 K ( I n k I n k t ) 2 = k = 1 K ( a n + b n cos φ k + c n sin φ k I n k t ) 2 .
S n / a n = 0 , S n / b n = 0 , S n / c n = 0
[ a n b n c n ] = [ N k = 1 K cos φ k k = 1 K sin φ k k = 1 K cos φ k k = 1 K cos 2 φ k k = 1 K sin φ k cos φ k k = 1 K sin φ k k = 1 K sin φ k cos φ k k = 1 K sin 2 φ k ] 1 [ k = 1 K I n k k = 1 K I n k cos φ k k = 1 K I n k sin φ k ] .
A n = a n , B n = b n 2 + c n 2 ,
δ n = tan 1 ( c n / b n ) .
δ = δ 2 δ 1 .
cos φ k = ( I 1 A 1 ) / B 1 , sin φ k = ( ( I 1 B 2 cos δ I 2 B 1 ) ( A 1 B 2 cos δ A 2 B 1 ) ) / ( B 1 B 2 sin δ ) .
φ k = tan 1 ( ( I 1 B 2 cos δ I 2 B 1 ) ( A 1 B 2 cos δ A 2 B 1 ) ( I 1 A 1 ) B 2 sin δ ) .
R M S ( φ k i φ k i 1 ) < ξ ,
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.