PHASE UNWRAPPING WITH HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM
Fan Hongdong 1,2) ;Deng Kazhong 2) ; Xue Jiqun 1,2) ; and Zhu Chuanguang 1,2)
1)Key Laboratory of Mine Spatial Information Technologies, Henan Polytechnic University, Jiaozuo 4540002)Jiangsu Key Laboratory of Resources and Environmental Information Engineering，CUMT, Xuzhou 221116
Abstract Aiming at the disadvantages of phase unwrapping methods for the Goldstein branch cutting and ant colony optimization, a new phase unwrapping algorithm with hybrid particle swarm optimization algorithm (HPSO) is proposed. At first, the residues were divided into dipoles, border points and inner points by preprocessing, and then, the inner points were separated in several areas, where the shortest paths were generated by the HPSO, finally, the shortest paths were segmented into some small branch cuts with the balance charges, and the border points and the disconnected residues were connected with window expanding method. The experimental results show that the algorithm proposed is much better than the classical phase unwrapping method of Goldstein branch cut.
