Comparison of six phase unwrapping algorithms

YANG Feng-tao; LUO Jiang-long; LIU Zhi-qiang; L&#252; Xiao-xu

Various phase unwrapping algorithms have been proposed for the last two decades.They mainly can be grouped into two classes：Path-following and global phase unwrapping algorithms.In order to compare their performances,firstly,different type wrap phases were generated according to computer-simulating inclined and Gaussian planes at various noise levels.Then three representative algorithms were chosen from the two classes respectively and their unwrapping phases and root-mean-square errors were calculated.Lastly,experimental data were compared and analyzed theoretically.The results show that minimum cost flow algorithm based on network programming and ZπM algorithm based on Bayesian reference are more robust,effective,and prior to be chosen or improved in practical application.

Corresponding author: YANG Feng-tao, yangfet2005@yahoo.com.cn;

1. Faculty of Science, Jiujiang University, Jiujiang 332005, China;

2. School for Information and Optoelectronic Science and Engineering, South China Normal University, Guangzhou 510631, China

Received Date: 2007-03-21

Accepted Date: 2007-09-10

Available Online: 2008-06-25

Abstract: Various phase unwrapping algorithms have been proposed for the last two decades.They mainly can be grouped into two classes：Path-following and global phase unwrapping algorithms.In order to compare their performances,firstly,different type wrap phases were generated according to computer-simulating inclined and Gaussian planes at various noise levels.Then three representative algorithms were chosen from the two classes respectively and their unwrapping phases and root-mean-square errors were calculated.Lastly,experimental data were compared and analyzed theoretically.The results show that minimum cost flow algorithm based on network programming and ZπM algorithm based on Bayesian reference are more robust,effective,and prior to be chosen or improved in practical application.

HTML

Reference (12)

[1]	CUSACK R,HUNTLEY J M,GOLDREIN H T.Improved noise immune phase unwrapping algorithm[J].Appl Opt,1995,34 (5):781-789.
[2]	ITOH K.Analysis of the phase unwrapping algorithm[J].Appl Opt,1982,21(14):2470.
[3]	GUTMANN B,WEBER H.Phase unwrapping with the branch-cut method:role of phase-field direction[J].Appl Opt,2000; 39 (26):4802-4816.
[4]	QUAN Ch G,TAY Ch J,CHEN L J.Spatial-fringe-modulation-based quality map for phase unwrapping[J].Appl Opt,2003,42 (35):7060-7065.
[5]	SU X Y,CHEN W J.Reliability-guided phase unwrapping algorithm:a review[J].Opt and Lasers Engng,2004,42(3):245-261.
[6]	YANG F T,LU X X,WANG D Y,et al.Weighted minimum cost flow phase unwrapping algorithm based on second difference[J].Laser Technology,2006,30(6):667-669(in Chinese).
[7]	COSTANTINI M.A novel phase unwrapping method based on network programming[J].IEEE Transactions on Geoscience and Remote Sensing,1998,36(3):813-821.
[8]	GHIGLIA D C,ROMERO L A.Robust two-dimensional weighted and unweighted phase unwrapping that uses fast transforms and iterative methods[J].J O S A,1994,A11(1):107-117.
[9]	MARROQUIN J L,RIVERA M.Quadratic regularization functionals for phase unwrapping[J].J O S A,1995,A12(11):2393-2400.
[10]	RIVERA M,MARROQUIN J L.Half-quadratic cost functions for phase unwrapping[J].Opt Lett,2004,29(5):504-506.
[11]	YANG F T,LU X X,ZHONG L Y,et al.Global phase unwrapping algorithm based on simulated annealing[J].Laser Journal,2006,27(3):37-38(in Chinese).
[12]	DIAS J,LEITaO J.The ZπM algorithm for interferometric image reconstruction in SAR/SAS[J].IEEE Transactions on Image Processing,2002,11 (4):408-422.

Comparison of six phase unwrapping algorithms

Abstract

References

Proportional views

通讯作者: 陈斌, bchen63@163.com

Proportional views