Absolute phase

Abstract: We demonstrate that interferometric imaging may be replaced by noninterferometric propagation-based techniques in many experiments. We explore propagation through the Poynting vector and find two classes of phase, one of which is topological in origin. Only this latter class may require interferometry to be determined, and even then only in specific well-defined circumstances. Our alternative definitions of phase are readily generalized to partially coherent radiation. Our analysis leads to an approach that is able to determine the absolute phase and the amplitude of a wave.

Abstract: Speckle patterns have high frequency phase data, which make it difficult to find the absolute phase of a single speckle pattern; however, the phase of the difference between two correlated speckle patterns can be determined. This is done by applying phase-shifting techniques to speckle interferometry, which will quantitatively determine the phase of double-exposure speckle measurements. The technique uses computer control to take data and calculate phase without an intermediate recording step. The randomness of the speckle causes noisy data points which are removed by data processing routines. One application of this technique is finding the phase of deformations, where up to ten waves of wavefront deformation can easily be measured. Results of deformations caused by tilt of a metal plate and a disbond in a honeycomb structure brazed to an aluminum plate are shown.

Abstract: Phase unwrapping is the inference of absolute phase from modulo-2pi phase. This paper introduces a new energy minimization framework for phase unwrapping. The considered objective functions are first-order Markov random fields. We provide an exact energy minimization algorithm, whenever the corresponding clique potentials are convex, namely for the phase unwrapping classical Lp norm, with pges1. Its complexity is KT(n,3n), where K is the length of the absolute phase domain measured in 2pi units and T(n,m) is the complexity of a max-flow computation in a graph with n nodes and m edges. For nonconvex clique potentials, often used owing to their discontinuity preserving ability, we face an NP-hard problem for which we devise an approximate solution. Both algorithms solve integer optimization problems by computing a sequence of binary optimizations, each one solved by graph cut techniques. Accordingly, we name the two algorithms PUMA, for phase unwrapping max-flow/min-cut. A set of experimental results illustrates the effectiveness of the proposed approach and its competitiveness in comparison with state-of-the-art phase unwrapping algorithms