基于k值取整的二向剪切相位解包裹算法的研究

针对已有的解包裹算法依旧不能对存在严重欠采样 和较强噪声的包裹相位进行精确解包裹,为了处理受 到噪声污染、严重欠采样的包裹相位图,本文提出了一种基于k值取整二向 剪切的新型相位解包裹算法。 将横向剪切干涉技术和迭代算法进行了改进,得到的新算法,一方面提高了对严重欠采样 包裹相位的处 理能力；另一方面加快了迭代的收敛速度,其所需时间和离散余弦变换(DC T)法接近。在新算法中,引入k值取 整,可以更加精确求解出真实相位,从而提高了新算法的抗噪性能。通过与改进的最小二乘 (LBS)算法进行对比, 新算法的性能优于其它算法。实验结果表明,本文提出的新算法,不仅可以处理严重欠采样 的包裹相位图,还具有很强的抗噪性。

The study of two direction shearing phase unwrapping algorithm based on k round

For all the present phase unwrapping algorithms,it is still a tough question to obtain an accurate unwrapping phase from interference fringes which suffer from enormous under-sampling and c an be affected by the background noise. To solve this problem,a new phase unwrapping algorithm based on k round is proposed for recovering wrapped phase with enormous undersampling and background noise.The new phase unwrapping algorithm is improved by shearing interferometry and advanced iterati on algorithm.On the one hand, the ability of processing the wrapped phase can be improved.On the other hand, it accelerates the running speed of the program.The running time of the new phase unwrapping algorithm is approxima tely equal to that of discrete cosine transform (DCT).The phase wrapped coefficient k round method is also introduced into the new phase unwrapping algorithm,which can unwrap the phase more accurately and increase noise immunit y.Comparing with other least-square methods,the proposed algorithm demonstrates better performance.The results show that the method not only can recover undersampling wrapped phase,but also has strong noise immunity.