OSA's Digital Library

Applied Optics

Applied Optics

APPLICATIONS-CENTERED RESEARCH IN OPTICS

  • Editor: James C. Wyant
  • Vol. 46, Iss. 5 — Feb. 10, 2007
  • pp: 730–743

Two-dimensional phase unwrapping using a hybrid genetic algorithm

Salah A. Karout, Munther A. Gdeisat, David R. Burton, and Michael J. Lalor  »View Author Affiliations


Applied Optics, Vol. 46, Issue 5, pp. 730-743 (2007)
http://dx.doi.org/10.1364/AO.46.000730


View Full Text Article

Enhanced HTML    Acrobat PDF (3551 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

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.

© 2007 Optical Society of America

OCIS Codes
(100.2650) Image processing : Fringe analysis
(100.3020) Image processing : Image reconstruction-restoration
(100.5070) Image processing : Phase retrieval
(120.5050) Instrumentation, measurement, and metrology : Phase measurement

ToC Category:
Image Processing

History
Original Manuscript: May 30, 2006
Revised Manuscript: September 12, 2006
Manuscript Accepted: October 3, 2006
Published: January 25, 2007

Citation
Salah A. Karout, Munther A. Gdeisat, David R. Burton, and Michael J. Lalor, "Two-dimensional phase unwrapping using a hybrid genetic algorithm," Appl. Opt. 46, 730-743 (2007)
http://www.opticsinfobase.org/ao/abstract.cfm?URI=ao-46-5-730


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. J. M. Huntley, "Three-dimensional noise-immune phase unwrapping algorithm," Appl. Opt. 40, 3901-3908 (2001). [CrossRef]
  2. R. Cusack, J. M. Huntley, and H. T. Goldrein, "Improved noise-immune phase-unwrapping algorithm," Appl. Opt. 24, 781-789 (1995). [CrossRef]
  3. J. R. Buckland, J. M. Huntley, and J. M. Turner, "Unwrapping noisy phase maps by use of a minimum-cost-matching algorithm," Appl. Opt. 34, 5100-5108 (1995). [CrossRef] [PubMed]
  4. D. C. Ghiglia and M. D. Pritt, Two-Dimensional Phase Unwrapping: Theory, Algorithms and Software (Wiley, 1998).
  5. B. Gutmann, "Phase unwrapping with the branch-cut method: clustering of discontinuity sources and reverse simulated annealing," Appl. Opt. 38, 5577-5793 (1999). [CrossRef]
  6. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, 1989).
  7. W. H. Steeb, The Nonlinear Workbook (World Scientific, 2002).
  8. S. Jung and B. R. Moon, "Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP," IEEE Trans. Evol. Comput. 6, 557-564 (2002). [CrossRef]
  9. Y. Nagata and S. Kobayashi, "An analysis of edge assembly crossover for the traveling salesman problem," in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics (IEEE, 1999), pp. 628-633.
  10. H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, "An evolutionary algorithm for large traveling salesman problem," IEEE Trans. Syst. Man Cybern. 34, 1718-1729 (2004). [CrossRef]
  11. G. A. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram, "A hybrid genetic algorithm--a new approach to solve traveling salesman problem," Int. J. Comput. Eng. Sci. 2, 339-355 (2001). [CrossRef]
  12. N. Mansour, H. Tabbara, and T. Dana, "A genetic algorithm approach for regrouping service sites," Comput. Oper. Res. 31, 1318-1333 (2004). [CrossRef]
  13. R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput. 5, 613-622 (2001). [CrossRef]
  14. H. Tsai, "Heterogeneous selection genetic algorithms for traveling salesman problems," Eng. Optimiz. 35, 297-311 (2003). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited