...
首页> 外文期刊>IEEE Transactions on Geoscience and Remote Sensing. >Phase unwrapping for large SAR interferograms: statistical segmentation and generalized network models
【24h】

Phase unwrapping for large SAR interferograms: statistical segmentation and generalized network models

机译:大型SAR干涉图的相位展开:统计分割和广义网络模型

获取原文

摘要

Two-dimensional (2-D) phase unwrapping is a key step in the analysis of interferometric synthetic aperture radar (InSAR) data. While challenging even in the best of circumstances, this problem poses unique difficulties when the dimensions of the interferometric input data exceed the limits of one's computational capabilities. In order to deal with such cases, we propose a technique for applying the statistical-cost, network-flow phase-unwrapping algorithm (SNAPHU) of Chen and Zebker (2001) to large datasets. Specifically, we introduce a methodology whereby a large interferogram is partitioned into a set of several smaller tiles that are unwrapped individually and then divided further into independent, irregularly shaped reliable regions. These regions are subsequently assembled into a full unwrapped solution, with the phase offsets between regions computed in a secondary optimization problem whose objective is to maximize the a posteriori probability of the final solution. As this secondary problem assumes the same statistical models as employed in the initial tile-unwrapping stage, the technique results in a solution that approximates the solution that would have been obtained had the full-size interferogram been unwrapped as a single piece. The secondary problem is framed in terms of network-flow ideas, allowing the use of an existing nonlinear solver. Applying the algorithm to a large topographic interferogram acquired over central Alaska, we find that the technique is less prone to unwrapping artifacts than more simple tiling approaches.
机译:二维(2-D)相位展开是干涉式合成孔径雷达(InSAR)数据分析中的关键步骤。尽管即使在最好的情况下也具有挑战性,但是当干涉测量输入数据的尺寸超过人的计算能力的极限时,该问题带来了独特的困难。为了处理这种情况,我们提出了一种将Chen和Zebker(2001)的统计成本,网络流相位展开算法(SNAPHU)应用于大型数据集的技术。具体来说,我们介绍一种方法,将大的干涉图划分为一组几个较小的切片,然后分别将它们展开,然后再进一步分为独立的,形状不规则的可靠区域。随后将这些区域组装成一个完整的解包解,并在次级优化问题中计算出区域之间的相位偏移,该次级优化问题的目的是使最终解决方案的后验概率最大化。由于此次要问题假设使用与初始图块展开阶段中使用的统计模型相同的统计模型,因此该技术得出的解决方案近似于将完整尺寸的干涉图展开为单个件时将获得的解决方案。第二个问题是根据网络流思想构架的,从而允许使用现有的非线性求解器。将算法应用于在阿拉斯加中部采集的大型地形干涉图上,我们发现该技术比更简单的平铺方法更不容易展开伪像。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号