检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长沙理工大学电气与信息工程学院,长沙410004 [2]中国科学院电子学研究所微波成像技术国家重点实验室,北京100190
出 处:《宇航学报》2012年第2期190-199,共10页Journal of Astronautics
基 金:973计划(2009CB724003);863计划(2007AA120302)
摘 要:为快速稳定地展开干涉相位,提出基于密集残差点划分的快速相位展开算法。算法首先快速获取残差点,进而利用本文给定的准则进行正负残差点配对设置枝切线;根据枝切线及相干系数将残差点密集区域分离出来;相位展开时首先展开高质量区域,进而展开噪声区中非枝切线上的相位,最后展开枝切线上及没有成功展开的相位。仿真数据和实测数据的处理结果表明,本文算法较传统路径跟踪算法在提高了展开精度的同时还大大提高了处理速度。A new phase unwrapping algorithm based on partitioning the regions of dense residuals is proposed to unwrap the interferometric phase fast and robustly.In the algorithm,the residuals are obtained at first.Then,an improved residual-pairing method for positive and negative residuals is utilized for setting the branch according to the given rules.Furthermore,the dense residuals regions are divided according to the branches and coherent coefficients.While unwrapping the phase,the regions with high quality are unwrapped at the beginning,then the points in the high noisy regions but not in the branch are unwrapped,finally the points in the branch and unwrapped unsuccessfully are unwrapped.The processing results of simulated data and real data indicate,this algorithm can acquire more accurate and much faster unwrapped phase than the several traditional path following algorithms.
关 键 词:干涉合成孔径雷达(InSAR) 相位展开 枝切法 干涉图 残差区域
分 类 号:TN959.3[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15