Two-dimensional phase unwrapping using a hybrid genetic algorithm.
A novel hybrid genetic algorithm (HGA) is proposed to solve the branch-cut phase unwrapping problem. It employs both local and global search methods. The local search is implemented by using the nearest-neighbor method, whereas the global search is performed by using the genetic algorithm. The branch-cut phase unwrapping problem [a nondeterministic polynomial (NP-hard) problem] is implemented in a similar way to the traveling-salesman problem, a very-well-known combinational optimization problem with profound research and applications. The performance of the proposed algorithm was tested on both simulated and real wrapped phase maps. The HGA is found to be robust and fast compared with three well-known branch-cut phase unwrapping algorithms.
Karout
Salah A
SA
General Engineering Research Institute (GERI), Liverpool John Moores University, Liverpool, UK. S.A.Karout@2004.ljmu.ac.uk
Gdeisat
Munther A
MA
Burton
David R
DR
Lalor
Michael J
MJ