引用本文: 钟何平, 唐劲松, 张森, 黄攀. 集群环境下的复合最小不连续相位解缠算法[J]. 武汉大学学报 ( 信息科学版), 2019, 44(9): 1363-1368.
ZHONG Heping, TANG Jinsong, ZHANG Sen, HUANG Pan. Combined Minimum Discontinuity Phase Unwrapping Based on Clusters[J]. Geomatics and Information Science of Wuhan University, 2019, 44(9): 1363-1368.
 Citation: ZHONG Heping, TANG Jinsong, ZHANG Sen, HUANG Pan. Combined Minimum Discontinuity Phase Unwrapping Based on Clusters[J]. Geomatics and Information Science of Wuhan University, 2019, 44(9): 1363-1368.

## Combined Minimum Discontinuity Phase Unwrapping Based on Clusters

• 摘要: 提出了一种集群环境下的复合最小不连续相位解缠算法。首先主线程根据计算资源数将原始缠绕相位分为规则小块，并将未解缠相位块发送至空闲计算节点进行解缠。单块缠绕相位图解缠时，先计算相位质量图，并将缠绕相位分为高低质量区域，然后采用质量引导与最小不连续相结合的复合相位解缠策略进行解缠，最后将解缠结果和区域分割结果发送回主线程。完成所有分块缠绕相位解缠后，主线程在不同解缠相位块边界及其与边界相邻的低质量区域进行最小不连续优化来获取最终的解缠相位。通过集群环境下的并行相位解缠试验，验证了所提算法的正确性和高效性。

Abstract: We propose a combined minimum discontinuity phase unwrapping algorithm based on clusters. The wrapped phase image is tessellated into small regular blocks by the main node according to the computing resources and then sent to the idle computing nodes. During the unwrapping process of single block, the wrapped phase quality map is firstly computed and the wrapped phase image is partitioned into high and low quality areas; then the quality-guided and minimum discontinuity combined phase unwrapping algorithm is performed to get the initial unwrapped result. After the local unwrapping process is finished, the initial unwrapped result and the region partition result are sent to the main node. When all the blocked phases are unwrapped, the main node performs the minimum discontinuity optimization process on the border of different blocks and the adjacent low quality areas to get the final unwrapped result. Tests performed on the simulated and the real InSAS (interferometric synthetic aperture sonar) interferograms based on clusters confirm the validity and efficiency of the proposed algorithm.

/

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

分享至好友和朋友圈