首页 | 本学科首页   官方微博 | 高级检索  
     检索      

共享内存环境下的分块最小不连续相位解缠算法
引用本文:钟何平,唐劲松,张森,田振.共享内存环境下的分块最小不连续相位解缠算法[J].武汉大学学报(信息科学版),2018,43(9):1385-1390.
作者姓名:钟何平  唐劲松  张森  田振
作者单位:1.海军工程大学海军水声技术研究所, 湖北 武汉, 430033
基金项目:国家自然科学基金41304015国家自然科学基金61671461中国博士后科学基金2015M582813
摘    要:提出了一种共享内存环境下的分块最小不连续相位解缠方法。首先,利用多核协同计算整块相位质量图;然后,将干涉图和相位质量图分割为规则小块,采用质量引导与最小不连续相合成的方法同时对子块干涉图进行相位解缠;最后,主线程在不同解缠相位块以及位于边界的低质量区域上再次进行最小不连续优化,获取最终合并后的解缠结果。仿真和真实干涉相位图的分块解缠实验结果表明,所提算法在保持解缠精度的同时,加速比分别达到3.98和2.26。

关 键 词:相位解缠    分块最小不连续    共享内存    并行计算    OpenMP
收稿时间:2016-11-19

Blocked Minimum Discontinuity Phase Unwrapping Algorithm in Shared Memory Environment
Institution:1.Naval Institute of Underwater Acoustic Technology, Naval University of Engineering, Wuhan 430033, China
Abstract:Phase unwrapping is one of the key processing steps during reconstruction the digital elevation model from the signal of interferometric synthetic aperture radar(InSAR) or interferometric synthetic aperture sonar(InSAS). In order to solve the problem of low unwrapping efficiency with large interferogram, we propose a blocked minimum discontinuity phase unwrapping algorithm in shared memory environment. The whole phase quality map is computed firstly through multi-cores of CPU, then wrapped phase image and phase quality map are tessellated into small regular blocks, which are unwrapped by the quality guided and minimum discontinuity optimization method simultaneously. In the end, the minimum discontinuity optimization process is performed again on the border of different blocks and the low quality areas located on the border to get the final merged unwrapped result in the main thread. Tests performed on the simulated and real InSAS interferogram show that the speed up reaches 3.98 and 2.26 respectively.
Keywords:
本文献已被 CNKI 等数据库收录!
点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息
点击此处可从《武汉大学学报(信息科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号