引用本文: 钟何平, 田振, 吴浩然, 徐魁, 唐劲松. 非递归最小不连续相位解缠算法及其优化方法[J]. 武汉大学学报 ( 信息科学版), 2017, 42(10): 1411-1416.
ZHONG Heping, TIAN Zhen, WU Haoran, XU Kui, TANG Jinsong. Non-recursive Minimum Discontinuity Phase Unwrapping Algorithm and Its Optimization[J]. Geomatics and Information Science of Wuhan University, 2017, 42(10): 1411-1416.
 Citation: ZHONG Heping, TIAN Zhen, WU Haoran, XU Kui, TANG Jinsong. Non-recursive Minimum Discontinuity Phase Unwrapping Algorithm and Its Optimization[J]. Geomatics and Information Science of Wuhan University, 2017, 42(10): 1411-1416.

## Non-recursive Minimum Discontinuity Phase Unwrapping Algorithm and Its Optimization

• 摘要: 提出了一种非递归最小不连续相位解缠算法，并对其解缠效率进行了优化。在深入分析最小不连续算法的基础上，采用栈来保存生长边添加过程和消圈过程中的中间数据，实现了非递归最小不连续相位解缠算法。然后将其与量化质量引导相位解缠算法相结合，通过限制优化区域加速算法收敛。对InSAR（interferometric synthetic aperture radar）和InSAS（interferometric synthetic synthetic aperture sonar）干涉相位图的解缠试验结果表明：本文方法在保持相位解缠精度的同时，极大提高了相位解缠效率。

Abstract: We propose a non-recursive minimum discontinuity phase unwrapping algorithm for improved efficiency. After analyzing the principles of minimum discontinuity phase unwrapping algorithm, a stack is used to store the intermediate results during edge spreading and circle canceling processes and thena non-recursive algorithm for phase unwrapping is implemented. The new algorithm was combined with the quantized quality-guided phase unwrapping algorithm, which enhances the unwrapping efficiency by restricting the optimization area. Unwrapping tests performed on InSAR and InSAS interferograms show that the proposed method maintains high quality unwrapping results and greatly improves efficiency.

/

• 分享
• 用微信扫码二维码

分享至好友和朋友圈