共享内存环境下的分块最小不连续相位解缠算法

Blocked Minimum Discontinuity Phase Unwrapping Algorithm in Shared Memory Environment

  • 摘要: 提出了一种共享内存环境下的分块最小不连续相位解缠方法。首先,利用多核协同计算整块相位质量图;然后,将干涉图和相位质量图分割为规则小块,采用质量引导与最小不连续相合成的方法同时对子块干涉图进行相位解缠;最后,主线程在不同解缠相位块以及位于边界的低质量区域上再次进行最小不连续优化,获取最终合并后的解缠结果。仿真和真实干涉相位图的分块解缠实验结果表明,所提算法在保持解缠精度的同时,加速比分别达到3.98和2.26。

     

    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.

     

/

返回文章
返回