高效UKF相位解缠算法  

An Efficient UKF Phase Unwrapping Algorithm

作　　者：刘媛媛 谢先明 田宪辉 李春 曾庆宁[1] LIU Yuanyuan;XIE Xianming;TIAN Xianhui;LI Chun;ZENG Qingning(School of Information and Communication,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China;School of Electrical and Information Engineering,Guangxi University of Science and Technology,Liuzhou,Guangxi 545006,China)

机构地区：[1]桂林电子科技大学信息与通信学院,广西桂林541004 [2]广西科技大学电气与信息工程学院,广西柳州545006

出　　处：《遥感信息》2022年第2期60-69,共10页Remote Sensing Information

基　　金：国家自然科学基金项目(41661092);广西无线宽带通信与信号处理重点实验室基金项目(GXKL06180102);广西自然科学基金项目(2018GXNSFAA281196)。

摘　　要：针对传统的无味卡尔曼滤波相位解缠算法解缠精度和解缠效率难以平衡的问题,提出一种高效无味卡尔曼滤波(unscented Kalman filter,UKF)相位解缠算法。首先,根据干涉图生成相应的枝切线分布图;其次,利用二阶差分函数计算干涉图中各像元的二值化质量权值矩阵;然后,由枝切线分布图以及二值化质量权值矩阵生成可靠性掩模图,该可靠性掩模图将干涉图分为权值为“1”的高质量像元(非枝切线上的二值化质量权值为“1”的像元)、权值为“0”的低质量像元(枝切线上的像元、二值化质量权值为“0”的像元以及枝切线围成的闭环区域中的像元)两部分;最后,由可靠性掩模图确定解缠路径,先利用UKF相位解缠程序按照像元扩散策略解缠高质量像元,余下未解缠像元根据已解缠像元信息,利用UKF相位解缠程序按照行(或列)的方式进行解缠。模拟数据及实测数据实验结果表明,该算法能够高效与稳健地处理干涉图的相位解缠问题。An efficient UKF phase unwrapping algorithm is proposed by combining a reliability mask map,a flood fill strategy and an unscented Kalman filter.Firstly,a branch-cut line distribution map of the wrapped image is generated,and a binary quality map of wrapped phase image are also calculated,and then a binary reliability mask guiding the path of the UKF phase unwrapping procedure is obtained by integrating the branch-cut line distribution map and the binary quality map.Secondly,the wrapped pixels with the weight of“1”in the binary reliability mask are unwrapped by the UKF phase unwrapping procedure according to the flood fill strategy.Finally,according to the information of unwrapped pixels,the remaining wrapped pixels are unwrapped in rows(or columns)by the UKF phase unwrapping program.The results obtained with the simulated data and measured data show that the proposed method can efficiently and robustly unwrap the wrapped phase images.

关 键 词：相位解缠 枝切线 二值化权值 可靠性掩模 无味卡尔曼滤波 

分 类 号：P237[天文地球—摄影测量与遥感]