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

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

作　　者：王华英[1] 刘佐强[2] 廖薇[2] 于梦杰[2] 高亚飞[2] 

机构地区：[1]河北工程大学理学院,河北邯郸056038 [2]河北工程大学信息与电气工程学院,河北邯郸056038

出　　处：《中国激光》2014年第2期122-127,共6页Chinese Journal of Lasers

基　　金：国家自然科学基金(61077001;61144005);河北省自然科学基金(F2010001038;F2012402028;F2012402051);河北省科技支撑计划项目(09277101D;13210201D);河北省教育厅科学研究重大项目(ZH2011241)

摘　　要：为了快速准确地对含有噪声及欠采样区域的包裹相位图进行展开,采用理论分析与计算机模拟及实验验证相结合的方法,对基于快速傅里叶变换(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.

关 键 词：全息 相位解包裹 最小范数法 噪声 欠采样 

分 类 号：TB877[一般工业技术—摄影技术]