检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]湖南大学电气与信息工程学院
出 处:《湖南大学学报(自然科学版)》2007年第4期33-36,共4页Journal of Hunan University:Natural Sciences
基 金:国家自然科学基金资助项目(60375001);湖南省自然科学基金资助项目(04JJ40042)
摘 要:经典的分枝切割相位解缠方法在残差点分布密集、分布范围较广的情况下形成分枝切割线所需时间较长.针对这个问题,本文提出了一种旨在加快形成分枝切割线速度的方法.将残差点数据集分成正残差点数据集和负残差点数据集,采用正、负残差点数据集之间一一映射的方式,满足分枝切割线的极性平衡条件;直接在正、负残差点数据集之间寻找分枝切割线,大大节约了形成分枝切割线时间.截取两幅不同的干涉纹图进行相位解缠实验,使用MATLAB软件仿真.实验结果表明:从分枝切割线形成所消耗的时间看,采用基于映射方式比经典方式分别节约时间23 s和36 s,解缠的结果基本相同.The demerit of the classical branch-cut phase unwrapping method was in the condition of the branch-cut of residues distributing denseness. An improved method of branch-cut phase unwrapping based on mapping was proposed in order to spend less time in calculating the branch-cut line than the classical branch-cut phase unwrapping method. The residues data set was divided into positive residues data set and negative residues data set, and the branch-cut line was calculated from the positive residues data set and negative residues data set by mapping the two data sets. Experiments were done with MATLAB software for two different interferometric phase figures, and the results showed the time spending by the new method was less 23 s and 36 s than by the method of classical branch-cut phase unwrapping.
分 类 号:TP751[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229