首页> 外文会议>IEEE International Geoscience and Remote Sensing Symposium >AN INNOVATIVE REGION GROWING ALGORITHM BASED ON MINIMUM COST FLOW APPROACH FOR PHASE UNWRAPPING OF FULL-RESOLUTION DIFFERENTIAL INTERFEROGRAMS
【24h】

AN INNOVATIVE REGION GROWING ALGORITHM BASED ON MINIMUM COST FLOW APPROACH FOR PHASE UNWRAPPING OF FULL-RESOLUTION DIFFERENTIAL INTERFEROGRAMS

机译:一种基于最小成本流法的全分辨率差分干涉图的最小成本流法的创新区域生长算法

获取原文

摘要

We propose an innovative Phase Unwrapping (PhU) approach to unwrap a sequence of full-resolution multi-temporal differential interferograms through a Region Growing (RG) strategy. The algorithm is designed to handle noisy interferograms to carry out effective phase unwrapping process concurrently of large single-look differential interferograms. The key idea of our algorithm is to exploit a set of well unwrapped pixels (seed points) by applying existing multi-temporal differential technique and propagate the solution to successfully unwrap the neighbouring wrapped pixels (candidate points). To this aim, phase unwrapping of the candidate point network is effectively performed exploiting the Extended Minimum Cost Flow (EMCF) algorithm applied to a Constrained Delaunay Triangulation. The proposed algorithm has been applied to a set of 116 ERS-1/2 and ENVSAT SAR images acquired over the city of Rome (Italy) in 1992-2010. The achieved results demonstrate the effectiveness of the innovative proposed PhU approach.
机译:我们提出了一种创新的相位展开(PHU)方法来通过生长(RG)策略来解开一系列全分辨率多时间差分干涉图。该算法旨在处理嘈杂的干扰图以执行大型单眼差分干涉图同时执行有效的相位展开过程。我们的算法的关键思想是通过应用现有的多时间差分技术来利用一组井未包装的像素(种子点)并将解决方案传播以成功地解开相邻包装的像素(候选点)。为此目的,有效地执行候选点网络的相位展开,利用应用于约束Delaunay三角剖分的扩展最小成本流(EMCF)算法。建议的算法已应用于1992 - 2010年在罗马市(意大利)获得的116个ERS-1/2和Evensat SAR图像。达到的结果表明了创新提出的PHU方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号