A comparative study of five different PIV interrogation algorithms

Five different particle image velocimetry (PIV) interrogation algorithms are tested with numerically generated particle images and two real data sets measured in turbulent flows with relatively small particle images of size 1.0–2.5 pixels. The size distribution of the particle images is analyzed for both the synthetic and the real data in order to evaluate the tendency for peak-locking occurrence. First, the accuracy of the algorithms in terms of mean bias and rms error is compared to simulated data. Then, the algorithms’ ability to handle the peak-locking effect in an accelerating flow through a 2:1 contraction is compared, and their ability to estimate the rms and Reynolds shear stress profiles in a near-wall region of a turbulent boundary layer (TBL) at Re _τ =510 is analyzed. The results of the latter case are compared to direct numerical simulation (DNS) data of a TBL. The algorithms are: standard fast Fourier transform cross-correlation (FFT-CC), direct normalized cross-correlation (DNCC), iterative FFT-CC with discrete window shift (DWS), iterative FFT-CC with continuous window shift (CWS), and iterative FFT-CC CWS with image deformation (CWD). Gaussian three-point peak fitting for sub-pixel estimation is used in all the algorithms. According to the tests with the non-deformation algorithms, DNCC seems to give the best rms estimation by the wall, and the CWS methods give slightly smaller peak-locking observations than the other methods. With the CWS methods, a bias error compensation method for the bilinear image interpolation, based on the particle image size analysis, is developed and tested, giving the same performance as the image interpolation based on the cardinal function. With the CWD algorithms, the effect of the spatial filter size between the iteration loops is analyzed, and it is found to have a strong effect on the results. In the near-wall region, the turbulence intensity varies by up to 4%, depending on the chosen interrogation algorithm. In addition, the algorithms’ computational performance is tested.