摘要 该文提出了一种新的相位展开算法--最近相邻点连接(Nearest Point Linking,NPL)算法,该算法是在Goldstein算法相位展开的基础上,通过事先连接距离最近的、极性相反的残余点,降低残余点的密度,再使用Goldstein的残余点连接方法连接剩余的残余点,从而达到了很好的残余点连接效果。实验结果验证了在高密度残余点情况下此算法的有效性。
Abstract：A new unwrapping algorithm-Nearest Point Linking (NPL) algorithm is presented based on the Goldstein algorithm. It decreases the residue number by smoothing the couple residues in nearest distance. Then, the Goldstein algorithm is applied to link the other residues. As a result, a good solution is achieved. The experiment shows the validation of the algorithm in high-density residue condition.
2005, Vol. 27 
