干涉SAR相位解缠中的枝切策略分析  

Branch-cut strategy analyses in phase unwrapping algorithm for interferometric SAR

作　　者：杨磊[1] 刘伟[1] 赵拥军[1] 

机构地区：[1]解放军信息工程大学信息工程学院,郑州450002

出　　处：《测绘科学》2007年第3期75-77,共3页Science of Surveying and Mapping

摘　　要：二维相位解缠是合成孔径雷达干涉测量数据处理中的关键步骤和难点,通过对现有相位枝切解缠算法的枝切连接策略进行分析,并结合最小生成树的原理,提出了一种最优最小生成树相位解缠的方法,很大程度地减少了以往方法中造成地枝切线过多、过长、闭合等弊病的发生,阻止了由于枝切线设置错误所引起的误差传播,既保持了枝切法速度快的特点,又优化了算法。通过几种方案的对比实验,说明该方法能提高相位解缠精度。2-Dimensional phase unwrapping is a stubborn problem in the image formation of interferometric SAR. In this paper, some main branch-cut strategies in phase unwrapping algorithm for interferometric SAR are analyzed in detail. On the basis of minimum spanning tree theory, an optimized minimum spanning tree phase unwrapping algorithm for interferometric SAR is proposed. It can farthest reduces or stop the phenomenon of more, longer and closed branch-cut lines. With this method, the error is restricted in a small bound of value, and the operation keeps fast. The contrastive experiment result indicates that the method can improve the precision of phase unwrapping.

关 键 词：干涉SAR 相位解缠 最小生成树 残差点 枝切线 

分 类 号：TN957.52[电子电信—信号与信息处理] TP7[电子电信—信息与通信工程]