基于取整最小二乘的全局相位展开新方法

A New Global Phase Unwrapping Algorithms Based on Least Squares

摘要:

基于取整操作和全局最小二乘,提出了一种快速简单的相位展开算法；不同与传统的相位展开方法,该算法通过一种非迭代的和健壮的方法来处理相位跳变部分的梯度；因此,降低了残差点的传播和平滑的影响；并用提出的算法与四种经典的相位展开算法:切枝法、最小费用流法(MCF)、质量图导向(QG)和快速傅里叶变换(FFT)进行对比；通过计算机模拟和实验结果表明:该算法仅仅需要与FFT方法相接近的较低的运算时间,就能达到比MCF方法更高的精度；而且,该算法运算速度快,非常简单,可以在干涉测量技术中得到实时的应用。

Abstract:

Based on rounding operations and global least squares, we propose a fast and simple algorithm for phase unwrapping. Unlike the conventional phase unwrapping methods, the algorithm deals with part of the gradient of phase transitions by a non-iterative and robust method. Thus, reduce the spreading of residue and influence of smooth. The proposed algorithm is compared with branch cut, minimum cost network flow(MCF), quality-guided(QG) and fast Fourier transform (FFT).Computer simulation and experimental examples make it clear that the algorithm requires only the low computation time to close the FFT method, it can achieve higher accuracy than the MCF method. Moreover, the algorithm is fast speed, very simple, it can get real time applications in interference measure techniques.