Abstract

In this paper we demonstrate the theoretical equivalence of two robust techniques for two-dimensional phase unwrapping. The first is based on the least-squares (LS) approach, and the second is based on Green’s formulation. To be theoretically comparable with Green’s method, the LS phase unwrapping is formulated in the continuous domain, leading to the minimization of a specific functional. Subsequently, we investigate the computational requirements of the procedures implementing the two methods. To do this, we have modified the first Green’s identity-based algorithm to account for periodic phase patterns. This reformulation allows us to compare the existing efficient LS procedures and leads to a procedure whose memory and computational requirements are less stringent than those presented in Fornaro et al. [ IEEE Trans. Geosci. Remote Sens. 34, 720 ( 1996)].

© 1996 Optical Society of America

Global and local phase-unwrapping techniques: a comparison

Gianfranco Fornaro, Giorgio Franceschetti, Riccardo Lanari, Eugenio Sansosti, and Manlio Tesauro
J. Opt. Soc. Am. A 14(10) 2702-2708 (1997)

Phase unwrapping for interferometric synthetic aperture radar by use of Helmholtz equation eigenfunctions and the first Green’s identity

Igor Lyuboshenko and Henri Maı̂tre
J. Opt. Soc. Am. A 16(2) 378-395 (1999)

Minimum Lp-norm two-dimensional phase unwrapping

Dennis C. Ghiglia and Louis A. Romero
J. Opt. Soc. Am. A 13(10) 1999-2013 (1996)

Robust phase-unwrapping method for phase images with high noise content

Paul G. Charette and Ian W. Hunter
Appl. Opt. 35(19) 3506-3513 (1996)

Edgelist phase unwrapping algorithm for time series InSAR analysis

A. Piyush Shanker and Howard Zebker
J. Opt. Soc. Am. A 27(3) 605-612 (2010)