位置:成果数据库 > 期刊 > 期刊详情页
含噪声包裹相位图的加权最小二乘相位展开算法研究
  • ISSN号:0308-1087
  • 期刊名称:Linear & Multilinear Algebra
  • 时间:0
  • 页码:685-691
  • 语言:英文
  • 分类:TP391[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]中国科学院电工研究所,北京100080, [2]北京理工大学,北京100081, [3]中国科学院研究生院,北京100039
  • 相关基金:长江学者特聘教授奖励计划(PCSIRT)和国家自然科学基金资助项目(10674134)
  • 相关项目:高数值孔径(NA>1)浸没光刻成像中偏振效应研究
中文摘要:

二维相位展开广泛应用在精密光学测量、自适应光学、合成孔径雷达、图像处理等领域中。为处理含噪声包裹相位图,以预条件共轭斜量法求解权重最小二乘相位展开方程。引入非加权二维离散余弦变换求解泊松方程得到的最小二乘相位解作为共轭斜量法的初始解,从而加快了收敛速度,同时提出一种新质量图确定算法求解过程中的权重项。计算机模拟和试验表明算法计算速度快,能有效地消除传统路径积分法在处理信噪比低包裹相位图时的“拉线”现象,是一种有效的相位展开方法。

英文摘要:

Two-dimensional phase unwrapping is widely applied in a variety of fields including optical interferometry, adaptive optics, synthetic-aperture radar and image processing. Although path-following phase unwrapping method is successful in some application, the algorithm has its own drawbacks in processing wrapped-phase images with bugs. In order to process the wrapped phase with noise, preconditioner conjugate gradient method (PCG) is applied to solve the weighted least-squares phase unwrapping problem. The preconditioner is obtained by solving an unweighted least-square phase unwrapping problem. The discrete Poisson equation is solved by means of discrete cosine transform (DCF). This algorithm converges much faster than the Picard algorithm. The maximum phase gradient is adopted to determine the weights. Computer simulation and experimental examples make it clear that the preconditioner conjugate method works successfully when noise exist in wrapped phase images.

同期刊论文项目
同项目期刊论文