检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《光子学报》2009年第5期1235-1239,共5页Acta Photonica Sinica
基 金:国家自然科学基金(60527001)资助
摘 要:提出了一种相对距离导向的相位展开算法,根据相邻像素相位数据的特点,在复数平面上定义一个像素间的相对距离,构成相对距离树,用来标识相位展开路径的可靠性,由距离树导向进行相位展开.给出了距离树的物理意义和算法设计,以相位测量轮廓术为例给出了新算法的应用实例.实验结果表明,算法是合理的和有效的.相位展开的路径总是沿着具有最小距离值的路径到较高距离值的路径方向进行,所以在最坏的情况下误差也被限制在局部最小区域.A new phase unwrapping algorithm based on relative distance guidance was presented. According to the features between two neighboring pixels,the relative distance of two neighboring pixels was defined on complex plane, which composed the relative distance tree to identify the dependability of the phase unwrapping path, and phase unwrapping process was guided by the distance tree. The result of the experiment shows that the algorithm is feasible and effective, and the path of phase unwrapping is always directed from the minimum distance value to the greater distance value. So in the worst case this algorithm can restrict the errors in the minimum local region.
分 类 号:TN247[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249