InSAR相位解缠算法的比较 |
| |
引用本文: | 亓宁轩. InSAR相位解缠算法的比较[J]. 测绘与空间地理信息, 2016, 0(3). DOI: 10.3969/j.issn.1672-5867.2016.03.060 |
| |
作者姓名: | 亓宁轩 |
| |
作者单位: | 山东科技大学测绘科学与工程学院,山东青岛,266510 |
| |
摘 要: | 相位解缠作为合成孔径雷达干涉测量(InSAR,Interferometric Synthetic Aperture Radar)中一个关键的步骤,为获取地形高程提供了基础。相位解缠的质量将直接影响着DEM生成的质量。对现有的几类算法进行实验分析,并对解缠结果的质量进行比较,分析其精确性。结果表明:统计耗费网络流算法具有较好的解缠连续性以及较高的精度,可以获得一个较优的全局解。
|
关 键 词: | 相位解缠 InSAR 枝切法 最小范数法 |
Comparison of InSAR Phase Unwrapping Algorithm |
| |
Abstract: | Phase unwrapping is one of the most crucial steps in InSAR processing, which makes people get the information of the sur-face.At the same time, the suitable phase unwrapping algorithm influences the final result, at a large degree.We used the data of I-ran to test these algorithms, and finally gave a conclusion that Snaphu algorithm makes full allowance of the information in coherence map, obtains better global optima, and has a good continuity.It also can directly process the area of interest. |
| |
Keywords: | phase unwrapping InSAR branch-cut algorithm snaphu algorithm |
本文献已被 CNKI 万方数据 等数据库收录! |
|