中文摘要：

针对InSAR数据处理中干涉相位解缠的效率问题,该文在Goldstein枝切法的基础上提出了一种改进的枝切解缠算法,对枝切法中积分的方法进行了研究。首先按一定原则生成枝切线,然后选择一个非残差点作为积分的起始点,利用行扫描算法进行绕过枝切线的积分,得到最终的解缠相位。通过实验验证表明,行扫描积分法在解缠速度上比常见的四邻域积分法更快,可有效提高枝切法的解缠效率。

英文摘要：

According to the fact that the efficiency of phase unwrapping in InSAR data processing is not satisfactory,this paper presented an improved branch-cut algorithm and studied the improvement of integration in the branch-cut unwrapping phase algorithm.Firstly,branches were created according to given rule.Then the phase difference was integrated in such a way as not to cross any of the branch cuts by using line scanning algorithm,and the initial point for integration must not be residue.Finally,the unwrapping phase was obtained.Experimental results showed that the line scanning integration algorithm was faster than the four neighborhood algorithm,which improved the efficiency of phase unwrapping.