基于最小范数的四种相位解包裹算法比较

Comparison of Four Phases Unwrapping Algorithm Based on Method of Minimum Norm

为了快速准确地对含有噪声及欠采样区域的包裹相位图进行展开,采用理论分析与计算机模拟及实验验证相结合的方法,对基于快速傅里叶变换(FFT)的最小二乘法(FFT-LS)、基于离散余弦变换(DCT)的最小二乘法(DCT-LS)、基于横向剪切干涉的最小二乘法(LS-LS)和预条件共轭梯度法(PCG)的四种相位解包裹算法作了对比研究。结果表明:DCT-LS算法运行速度最快,LS-LS算法次之,PCG算法速度最慢,PCG算法对于噪声的免疫力最强,LS-LS算法处理欠采样的效果最好。

In order to recover wrapped phase map with the noisy and under-sampled area rapidly and accurately, the algorithms of fast Fourier transform （FFT）-based method of least squares （FFT-LS）, discrete cosine transform （DCT）-based method of least squares （DCT-LS）, lateral shearing based method of least squares （LS-LS） and the algorithm of preconditioned conjugate gradient （PCG） method are compared through theoretical analysis, computer simulation and experimental verification. The results show that the algorithm of DCT-LS is the fastest, the algorithm of LS-LS is second to DCT-LS, and the algorithm of PCG is the slowest. For strong noise, the algorithm of PCG has the best effect, and the algorithm of LS-LS has the best effect for dealing with under-sampling.