基于中性残差点集的干涉SAR相位解缠算法  

InSAR Phase Unwrapping Based on Neutral Residue Sets

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

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

出　　处：《数据采集与处理》2009年第3期280-284,共5页Journal of Data Acquisition and Processing

摘　　要：相位解缠是合成孔径雷达干涉测量数据处理的关键性步骤之一。在分析Goldstein枝切法和残差点位置的基础上,提出了一种改进的相位解缠算法。首先采用4点环路积分识别残差点,在邻近偶极子对残差预处理后,将剩下所有残差点分成若干个总电荷平衡的中性点集。然后采用普里姆算法对各中性残差点集依次处理,获得相应的最小代价生成树,全部最小代价生成树的边就是相位解缠所需的枝切线。最后,采用真实干涉SAR数据,分别利用本文方法和Goldstein法做了相位解缠实验。通过枝切线总长度和未解缠象素数量两项性能指标对比,证明了改进算法的有效性。Phase unwrapping is one of the most important processing steps in SAR interferometry. A novel phase unwrapping algorithm is presented based on the Goldstein＇s branch cut algorithm and the residue theorem. Firstly, residues by the integration of phase differences are determined on a squared closed loop including four pixels, and then all left residues are divided into some neutral sets after dipole preprocessing. Secondly, each the neutral residue set with the Prim algorithm to obtain the minimum cost spanning tree （MCST）. All the edges of the MCST are the branch cuts used to unwrap the interferometry phase. Finally, simulations are carried out with real Interferometric SAR data using the proposed algorithm and the Goldstein branch cut algorithm. Experimental results show the validity of the proposed algorithm.

关 键 词：合成孔径雷达 干涉 相位解缠 中性残差点集 最小代价生成树 

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