摘要
重点介绍了SARscape核心模块中提供的两种解缠算法,并以Envisat数据为例,分别利用两种解缠算法进行相位解缠。通过实验分析可知,在相干性较好的地区两种算法的解缠效果一致,但对于相干性较差的区域,使用区域增长法会出现孤立区域,而最小费用流法却可得到全局最优结果。
This paper emphatically introduced the two unwrapping algorithms provided in SARscape, and taking the Envisat data for example, used the two algorithms respectively to test. The result of the experiment shows that in areas with good coherence, the region growing and the minimum cost flow(MCF)algorithm can obtain the same unwrapping result, and in areas of bad coherence,the region growing algorithm can appear isolated area, but MCF algorithm can obtain the global optimal result.
出处
《地理空间信息》
2018年第3期20-22,共3页
Geospatial Information
基金
国家自然科学基金资助项目(41174002)
