首页> 外文会议>International Conference on Electronic Measurement Instruments >Interferometric SAR Phase Unwrapping Algorithm Based on Minimum Spanning Tree
【24h】

Interferometric SAR Phase Unwrapping Algorithm Based on Minimum Spanning Tree

机译:基于最小生成树的干涉测量SAR相位展开算法

获取原文

摘要

Phase unwrapping is one of the most difficult processing steps in sar interferometry. In this paper a new phase unwrapping approach based on minimum spanning tree is proposed. To discharge the positive and negative residues, all residues are divided into groups in a systematic searching strategy, and the connecting of residues in each group is optimized based on minimum spanning tree, optimum branch trees are achieved. The technique is explained in detail, the experiments prove the new algorithm more efficient than Goldstein's branch cut algorithm.
机译:相位展开是SAR干涉测量中最困难的处理步骤之一。本文提出了一种基于最小生成树的新相展开方法。为了排出阳性和负残留物,将所有残基分为系统的搜索策略中的基团,并且基于最小的生成树,实现了最佳分支树的每个组中的残基。该技术详细解释,实验证明了新的算法比Goldstein的分支切割算法更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号