| 集群环境下的复合最小不连续相位解缠算法 |
| |
| 引用本文： | 钟何平,唐劲松,张森,黄攀.集群环境下的复合最小不连续相位解缠算法[J].武汉大学学报(信息科学版),2019,44(9):1363-1368. |
| |
| 作者姓名： | 钟何平 唐劲松 张森 黄攀 |
| |
| 作者单位： | 1.海军工程大学海军水声技术研究所, 湖北 武汉, 430033 |
| |
| 基金项目： | 国家自然科学基金61671461国家自然科学基金41304015中国博士后科学基金2015M582813 |
| |
| 摘 要： | 提出了一种集群环境下的复合最小不连续相位解缠算法。首先主线程根据计算资源数将原始缠绕相位分为规则小块，并将未解缠相位块发送至空闲计算节点进行解缠。单块缠绕相位图解缠时，先计算相位质量图，并将缠绕相位分为高低质量区域，然后采用质量引导与最小不连续相结合的复合相位解缠策略进行解缠，最后将解缠结果和区域分割结果发送回主线程。完成所有分块缠绕相位解缠后，主线程在不同解缠相位块边界及其与边界相邻的低质量区域进行最小不连续优化来获取最终的解缠相位。通过集群环境下的并行相位解缠试验，验证了所提算法的正确性和高效性。
|
| 关 键 词： | 相位解缠 最小不连续 集群 并行计算 |
| 收稿时间： | 2018-06-30 |
Combined Minimum Discontinuity Phase Unwrapping Based on Clusters |
| |
| Affiliation: | 1.Naval Institute of Underwater Acoustic Technology, Naval University of Engineering, Wuhan 430033, China |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息 |
|
点击此处可从《武汉大学学报(信息科学版)》下载全文 |
