Flynn最小不连续相位展开算法能成功展开多种类型的包裹相位数据, 但该算法在整个包裹相位图像中循环搜寻相位不连续区域, 使整个图像的相位不连续最小, 计算量大, 效率较低。为了克服该缺点, 将禁忌搜索的思想应用于最小不连续相位展开算法中, 利用包裹相位图的质量图, 按照质量从劣到优把所有节点划分到不同的等级, 将高质量区域的节点暂时禁忌。这种禁忌搜索策略, 优先在低质量区域搜索相位不连续, 确保搜索区域从不连续概率最高的区域开始, 因此最大可能地减少了无用的搜索过程, 加快了算法的收敛速度, 提高了相位展开算法的运行效率。

Flynn′s minimum discontinuity algorithm can be used to successfully solve many different kinds of phase unwrapping problems, but its main drawback is that it requires a large amount of computations and has low efficiency in searching for the phase′s discontinuity areas because it takes the whole phase image as the cycling search area. To overcome this drawback, a new minimum discontinuity algorithm based on tabu search is proposed. In the new algorithm, the quality map of wrapped phase is used to classify the total nodes into several ranks from low to high according to the value of quality. The nodes within high quality areas are temporarily taboo, and those within low-qualified areas are searched for phase discontinuity in priority. This tabu search strategy ensures the search process storts from the areas whose probability of discontinuity are highest, and thus can avoid the useless search as much as possible, speed up the convergence rate of the algorithm, and improve the operational efficiency of the phase unwrapping algorithm significantly.