A New Particle Swarm Optimization-Based Method for Phase Unwrapping of MRI Data

A new method based on discrete particle swarm optimization (dPSO) algorithm is proposed to solve the branch-cut phase unwrapping problem of MRI data. In this method, the optimal order of matching the positive residues with the negative residues is first identified by the dPSO algorithm, then the branch cuts are placed to join each pair of the opposite polarity residues, and in the last step phases are unwrapped by flood-fill algorithm. The performance of the proposed algorithm was tested on both simulated phase image and MRI wrapped phase data sets. The results demonstrated that, compared with conventionally used branch-cut phase unwrapping algorithms, the dPSO algorithm is rather robust and effective.

[1]  Jiangtao Xi,et al.  Fast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry , 2010, SPIE/COS Photonics Asia.

[2]  C. Werner,et al.  Satellite radar interferometry: Two-dimensional phase unwrapping , 1988 .

[3]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[4]  Tutut Herawan,et al.  Computational and mathematical methods in medicine. , 2006, Computational and mathematical methods in medicine.

[5]  Hans Knutsson,et al.  Phase Sensitive Reconstruction for Water/Fat Separation in MR Imaging Using Inverse Gradient , 2007, MICCAI.

[6]  Jun Liu,et al.  A Modified Particle Swarm Optimization Algorithm and its Application For Solving Traveling Salesman Problem , 2005, 2005 International Conference on Neural Networks and Brain.

[7]  Richard Gran,et al.  On the Convergence of Random Search Algorithms In Continuous Time with Applications to Adaptive Control , 1970, IEEE Trans. Syst. Man Cybern..

[8]  J. R. Buckland,et al.  Unwrapping noisy phase maps by use of a minimum-cost-matching algorithm. , 1995, Applied optics.

[9]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[10]  B. Spottiswoode.  2D Phase Unwrapping Algorithms , 2009 .

[11]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[12]  Munther A Gdeisat,et al.  Two-dimensional phase unwrapping using a hybrid genetic algorithm. , 2007, Applied optics.

[13]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[14]  K Itoh,et al.  Analysis of the phase unwrapping algorithm. , 1982, Applied optics.

[15]  R Cusack,et al.  Improved noise-immune phase-unwrapping algorithm. , 1995, Applied optics.

[16]  Jigui Sun,et al.  An Improved Discrete Particle Swarm Optimization Algorithm for TSP , 2007, 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops.