基于模拟退火的全局相位展开算法

Global phase unwrapping algorithm based on simulated annealing

与常用的最小二乘和最小费用流相位展开算法求满足待求相位梯度与包裹相位梯度最小范数解不同,提出一种以待求相位的二阶相位差在整个相位场上的总和为目标函数,并利用模拟退火算法实现其最小化的相位展开算法。计算表明:该算法可以对最小二乘和最小费用流算法不能展开的欠采样包裹相位和含有噪声的欠采样包裹相位,进行有效的相位展开。

A global phase unwrapping algorithm is developed. Unlike least - square and minimum cost flow algorithm are the minimum L^O - norm solutions of the difference between the wrapped phase gradient and the trur phase gradient, the algorithm uses a cost function based on second- cadet differences, which is solved by simulated annealing. Computer simulation shows that the algorithm is very effective for udersampled and noise undersampled wrapped phase that can＇t he unwrapped correctly by least - square and minimumm cost flow algorithm.