上海航天（中英文）2024，Vol.41Issue(1)：116-121,6.DOI:10.19328/j.cnki.2096-8655.2024.01.015
自适应分块的改进最小费用网络流解缠算法
Improved MCF Unwrapping Algorithm with Adaptive Chunking
摘要
Abstract
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.关键词
相位解缠/最小费用网络流算法/分块/尺寸选择/自适应寻优Key words
phase unwrapping/minimum cost network flow(MCF)algorithm/chunking/size selection/adaptive optimization search分类
天文与地球科学引用本文复制引用
张金翼,王辉,吴思利,郑世超,顾约翰..自适应分块的改进最小费用网络流解缠算法[J].上海航天（中英文）,2024,41(1):116-121,6.基金项目
国家自然科学基金(U22B2015) （U22B2015）
