基于枝切线和可靠度的区域增长相位解包裹算法

Region-growing phase unwrapping algorithm based on branch-cuts and reliability

为了提高相位解包裹精度,提出了一种基于枝切线阻止误差传播和可靠度指引路径的解包裹算法。该算法首先计算像素点是否为残差点,根据残差点生成枝切线;然后计算像素点的可靠度,以两相邻像素可靠度之和作为边的可靠度,并按可靠度大小对边排序;接着从可靠度最大的边开始判断,若边对应的任一点未解包且未解包点不在枝切线上,则对边进行解包操作,若边对应的两点都已解包且不属于同一解包区域,则对解包区域进行归并操作;最后对枝切线解包。仿真和实验结果表明:该算法能有效减少误差传播,提高相位解包裹精度。

In order to improve the accuracy of phase unwrapping,an unwrapping algorithm based on branch-cuts and reliability was proposed,which stops error propagation by branch-cut and guides the unurapping path by reliability.Firstly,whether the pixel is the residue was calculated,and branch-cuts were generated according to the residue.Then,the reliability of pixels was calculated.The sum of reliabilities of two adjacent pixels was deemed as the reliability of the edges,and the edges were sorted according to the reliability.Next,the judgement started from the edge with the largest reliability.If any point corresponding to the edge is not wrapped,and the unwrapping point is not on the branch-cuts,unwrapping operation is conducted for the edge.If two points corresponding to the edge have been unwrapped and do not belong to the same unwrapping region,merger operation is conducted for the unwrapping region.Finally,the branch-cuts were unwrapped.Simulation and experiment show that the algorithm can effectively reduce error propagation and improve the accuracy of phase unwrapping.