Phase Unwrapping for 3D Object Reconstruction by means of Population-based Metaheuristics

Metaheuristics are employed for the solution of th e p ase unwrapping problem (for 3D object reconstruction) by the branch cuts method, posed as an analogous of the traveling salesman problem, which is an NP-hard decision problem. The metaheuristic algorithms carry out a globa l se rch for the optimal configuration of the so-called branch cuts which corre sponds to a pairing of discontinuities with opposed sign in the wrapped phase ma p. Three representative algorithms of different metaheuristic families are comp ared: discrete Particle Swarm Optimization (from bioinspired algorithms), Genetic Algorithms (from evolutionary algorithms) and a novel Estimation of Distr ibution Algorithm presented in this work that follows a Multinomial distributio n. These metaheuristics are comparatively evaluated according to the quality of the solutions achieved, execution time and computational cost, with the aim of building a robust and automated algorithm competitive against traditional met hods.

[1]  Qian Huang,et al.  Parallel Branch-Cut Algorithm Based on Simulated Annealing for Large-Scale Phase Unwrapping , 2015, IEEE Transactions on Geoscience and Remote Sensing.

[2]  L. Ying.  PHASE UNWRAPPING , 2005 .

[3]  Boris Pavez-Lazo,et al.  A deterministic annular crossover genetic algorithm optimisation for the unit commitment problem , 2011, Expert Syst. Appl..

[4]  Jaafar Abouchabaka,et al.  Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem , 2012, ArXiv.

[5]  Munther A Gdeisat,et al.  Residue vector, an approach to branch-cut placement in phase unwrapping: theoretical study. , 2007, Applied optics.

[6]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[7]  Feng Xu,et al.  Phase unwrapping for SAR interferometry based on an ant colony optimization algorithm , 2008 .

[8]  V. Vidal,et al.  Ian Hodara Herszterg 2D Phase Unwrapping via Minimum Spanning Forest with Balance Constraints , 2015 .

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

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

[11]  Ling Xia,et al.  A New Particle Swarm Optimization-Based Method for Phase Unwrapping of MRI Data , 2012, Comput. Math. Methods Medicine.

[12]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[13]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[14]  J C de Souza,et al.  Branch-cut algorithm for optical phase unwrapping. , 2015, Optics letters.

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

[16]  Petra Kaufmann,et al.  Two Dimensional Phase Unwrapping Theory Algorithms And Software , 2016 .