Windowed Fourier transform for fringe pattern analysis: theoretical analyses

A windowed Fourier ridges (WFR) algorithm and a windowed Fourier filtering (WFF) algorithm have been proposed for fringe pattern analysis and have been demonstrated to be versatile and effective. Theoretical analyses of their performances are of interest. Local frequency and phase extraction errors by the WFR and WFF algorithms are analyzed in this paper. Effectiveness of the WFR and WFF algorithms will thus be theoretically proven. Consider four phase-shifted fringe patterns with local quadric phase c(20)=c(02)=0.005 rad/(pixel)(2)], and assume that the noise in these fringe patterns have mean values of zero and standard deviations the same as the fringe amplitude. If the phase is directly obtained using the four-step phase-shifting algorithm, the phase error has a mean of zero and a standard deviation of 0.7 rad. However, when using the WFR algorithm with a window size of sigma(x)=sigma(y)=10 pixels, the local frequency extraction error has a mean of zero and a standard deviation of less than 0.01 rad/pixel and the phase extraction error in the WFR algorithm has a mean of zero and a standard deviation of about 0.02 rad. When using the WFF algorithm with the same window size, the phase extraction error has a mean of zero and a standard deviation of less than 0.04 rad and the local frequency extraction error also has a mean of zero and a standard deviation of less than 0.01 rad/pixel. Thus, an unbiased estimation with very low standard deviation is achievable for local frequencies and phase distributions through windowed Fourier transforms. Algorithms applied to different fringe patterns, different noise models, and different dimensions are discussed. The theoretical analyses are verified by numerical simulations.