自适应分块的改进最小费用网络流解缠算法

Improved MCF Unwrapping Algorithm with Adaptive Chunking

相位解缠是进行精确差分干涉测绘的关键步骤,在相位解缠算法中,最小费用网络流(MCF)是当前常用的算法,该算法具有精度高、限制残差点误差扩散、优先将误差限制在低相干区域的优点,但随着残差点数量的增多,其计算效率也随之降低。改进的MCF算法通过对其做分块,有效提升了算法效率,但块尺寸的选取影响最后的准确度与效率。本文提出一种自适应分块的改进MCF解缠算法,通过自适应寻优的方式选取合适的分割块,将相干性较高的点集中在同一块内,使得在准确度不受过多影响的情况下有效地提升算法效率。

Phase unwrapping is a key step for accurate differential interferometric mapping The minimum cost network flow(MCF) algorithm is a commonly used algorithm in phase unwrapping algorithms It has the advantage of high accuracy,can restrict the diffusion of residual point errors,and prefers to limit the errors to low coherence regions However,its computational efficiency decreases with the increase in the number of residual points The improved MCF algorithm can effectively improve the efficiency of the algorithm by chunking it,but the selection of the block size affects the final accuracy and efficiency In this paper,an improved MCF phase unwrapping algorithm with adaptive chunking is proposed The points with higher coherence are concentrated in the same chunk by selecting the appropriate partition block through adaptive optimization,so that the efficiency of the algorithm can be effectively improved without too much influence on the accuracy.