检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:雷何兵 刘昊鹏[1] 姚勇[1] 田一婷 杨彦甫[1]
机构地区:[1]哈尔滨工业大学深圳研究生院电子与信息工程学院,广东深圳518055
出 处:《光电子.激光》2017年第8期877-884,共8页Journal of Optoelectronics·Laser
基 金:国家自然科学基金(61575051);深圳市科技计划项目(JSGG20150529153336124)和(JCYJ20150529114045265)资助项目
摘 要:针对已有的解包裹算法依旧不能对存在严重欠采样和较强噪声的包裹相位进行精确解包裹,为了处理受到噪声污染、严重欠采样的包裹相位图,本文提出了一种基于k值取整二向剪切的新型相位解包裹算法。将横向剪切干涉技术和迭代算法进行了改进,得到的新算法,一方面提高了对严重欠采样包裹相位的处理能力;另一方面加快了迭代的收敛速度,其所需时间和离散余弦变换(DCT)法接近。在新算法中,引入k值取整,可以更加精确求解出真实相位,从而提高了新算法的抗噪性能。通过与改进的最小二乘(LBS)算法进行对比,新算法的性能优于其它算法。实验结果表明,本文提出的新算法,不仅可以处理严重欠采样的包裹相位图,还具有很强的抗噪性。For all the present phase unwrapping algorithms,it is still a tough question to obtain an accu- rate unwrapping phase from interference fringes which suffer from enormous under-sampling and can be affected by the background noise. To solve this problem,a new phase unwrapping algorithm based on k round is proposed for recovering wrapped phase with enormous undersampling and background noise. The new phase unwrapping algorithm is improved by shearing interferometry and advanced iteration al- gorithm. On the one hand, the ability of processing the wrapped phase can be improved. On the other hand,it accelerates the running speed of the program. The running time of the new phase unwrapping al- gorithm is approximately equal to that of discrete cosine transform (DCT). The phase wrapped coeffi- cient k round method is also introduced into the new phase unwrapping algorithm, which can unwrap the phase more accurately and increase noise immunity. Comparing with other least-square methods, the pro- posed algorithm demonstrates better performance. The results show that the method not only can recover undersampling wrapped phase, but also has strong noise immunity.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.76