贪婪算法在InSAR相位解缠中的应用  

Application of Greedy Algorithm to Phase Unwrapping in InSAR

作　　者：张莉[1] 彭石宝[2] 

机构地区：[1]空军雷达学院信息与指挥自动化系,武汉430019 [2]空军雷达学院研究生管理大队,武汉430019

出　　处：《空军雷达学院学报》2007年第3期168-171,共4页Journal of Air Force Radar Academy

摘　　要：针对干涉SAR二维相位解缠问题,提出了一种利用贪婪算法提高解缠精度的新方法.首先从理论上推导了贪婪算法相位解缠的基本原理,然后提出了一种迭代加权的贪婪算法,以克服传统贪婪算法解缠结果收敛于局部最优解的弊病,最后利用仿真数据进行了实验分析,验证了本文算法的有效性.仿真实验结果表明,该算法实时,高效,准确.Concerning for the two dimensinoal phase unwrapping in InSAR data processing, a new method of using the greedy algorithm to improve the precision of phase unwrapping was presented. The fundamentals of phase unwrapping using the greedy algorithm was derived, and then the iterative-weighted greedy algorithm was proposed for overcoming the drawbacks that the result of phase unwrapping using the conventional greedy algorithm converges only to the local optimal solution. Eventually, the experiment and its analysis were done by using the simulative data. which verifies the novel algorithm to be of real time, high efficiency and high accuracy.

关 键 词：干涉SAR 相位解缠 贪婪算法 迭代加权 

分 类 号：TN958[电子电信—信号与信息处理]