Skip to main content
Article thumbnail
Location of Repository

Efficient phase unwrapping

By Firas AI-Sawaf

Abstract

In the field of optical interferometry, two-dimensional projections of light interference patterns are often analysed in order to obtain measurements of interest. Such interference patterns, or interferograms, contain phase information which is inherently wrapped onto the range -t to it. Phase unwrapping is the processes of the restoration of the unknown multiple of 2ir, and therefore plays a major role in the overall process of interferogram analysis. Unwrapping phase information correctly becomes a challenging process in the presence of noise. This is particularly the case for speckle interferograms, which are noisy by nature. Many phase unwrapping algorithms have been devised by workers in the field, in order to achieve better noise rejection and improve the computational performance. This thesis focuses on the computational efficiency aspect, and picks as a starting point an existing phase unwrapping algorithm which has been shown to have inherent noise immunity. This is, namely, the tile-based phase unwrapping method, which attains its enhanced noise immunity through the application of the minimum spanning tree concept from graph theory. The thesis examines the problem of finding a minimum spanning tree, for this particular application, from a graph theory perspective, and shows that a more efficient class of minimum spanning tree algorithms can be applied to the problem. The thesis then goes on to show how a novel algorithm can be used to significantly reduce the size of the minimum spanning tree problem in an efficient manner

Publisher: Cranfield University
Year: 2005
OAI identifier: oai:dspace.lib.cranfield.ac.uk:1826/3960
Provided by: Cranfield CERES

Suggested articles

Citations

  1. (1992). A fast implementation of the minimum spanning tree method for phase unwrapping, doi
  2. (2000). A minimum spanning tree algorithm with inverseAckermann type complexity, doi
  3. (1989). A quasi-heterodyne holograph technique and automatic algorithms for phase unwrapping, SPIE, doi
  4. (1995). A randomised linear-time algorithm to find minimum spanning trees, doi
  5. (1994). A review of phase unwrapping techniques in fringe analysis, doi
  6. (1976). A simpler minimum spanning tree verification algorithm, doi
  7. (1991). Analysis of holographic fringe data using the dual reference approach.
  8. (1991). Automatic interferogram analysis techniques applied to quasi-heterodyne holography and ESP. doi
  9. (1985). Computer-aided analysis of holographic interferograms using the phase shift method. doi
  10. (1993). Data structures and network algorithms, doi
  11. (1985). Data structures for on-line updating of minimum spanning tree, with applications, doi
  12. (2001). Development of Shearography for Surface Strain Measurement of Non-Planar Objects, PhD thesis,
  13. (1990). Digital phase-shifting interferometry and its 120 application to automotive structures, Applied Optics,
  14. (1984). Dynamic shape measurement system for laser materials processing,
  15. (1975). Efficiency of a good but not linear set union algorithm, doi
  16. (1999). Finding minimum spanning trees in O(ma(m, n)) time, Tech Rep TR99-23, Univ Texas at Austin,
  17. (1965). Finite graphs and networks - an introduction with applications, doi
  18. (2003). Fringe analysis today and tomorrow, doi
  19. (1976). Graph theory with applications,
  20. (1969). Graph theory,
  21. (1989). Heterodyne and quasi-heterodyne holographic interferometry, doi
  22. (1984). High-resolution video processing for holographic interferometry applied to contouring and measuring deformations. doi
  23. (1992). Holographic deformation measurements by Fourier transform technique with automatic phase unwrapping. doi
  24. (1993). Interferogram analysis - digital fringe pattern measurements techniques, Institute of physics publishing ltd
  25. (1970). Interferometric displacement measurement on scattering surfaces utilizing speckle effect, doi
  26. (1992). Investigation of the cellular automata method of phase unwrapping and its implementation on an array processor, doi
  27. (1984). Moire fringes in metrology, 5(2), doi
  28. (1989). Noise immune phase unwrapping algorithm, doi
  29. (1985). Phase-shifting speckle interferometry, doi
  30. (2004). Quantitative interferogram analysis, Phase vision ltd,
  31. (1981). S Fourier-transform method of fringe pattern analysis for computer based topography and interferometry, doi
  32. (1993). Temporal phase unwrapping algorithm for automated interferogram analysis, doi
  33. (1997). Temporal phase unwrapping: Application to surface profiling of discontinuous objects, doi
  34. (1995). The minimum spanning tree problem on a planar graph, doi
  35. (1998). The tapestry cellular automata phase unwrapping algorithm for interferogram analysis, doi
  36. (2001). Three-dimensional noise immune phase unwrapping algorithm, doi
  37. (1983). Two-dimensional fringe pattern analysis. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.