This method changes the phase unwrapping problem into a kind of searching the minimum cost of a network which has mature and efficient methods in network theory.
该算法对干涉相位图建立网络模型，将相位解缠的最小化问题转化为求网络最小费用问题，利用网络规划理论中成熟高效的算法求解。
This method changes the phase unwrapping problem into a kind of searching the minimum cost of a network which has mature and efficient methods in network theory.
该算法对干涉相位图建立网络模型，将相位解缠的最小化问题转化为求网络最小费用问题，利用网络规划理论中成熟高效的算法求解。
应用推荐