Format

Send to

Choose Destination
See comment in PubMed Commons below
Appl Opt. 2007 Feb 10;46(5):730-43.

Two-dimensional phase unwrapping using a hybrid genetic algorithm.

Author information

1
General Engineering Research Institute (GERI), Liverpool John Moores University, Liverpool, UK. S.A.Karout@2004.ljmu.ac.uk

Abstract

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.

PMID:
17279161
PubMed Commons home

PubMed Commons

0 comments

    Supplemental Content

    Full text links

    Icon for Optical Society of America
    Loading ...
    Support Center