By Topic

Phase unwrapping by means of multigrid techniques for interferometric SAR

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. D. Pritt ; Loral Corp., Gaithersburg, MD, USA

Weighted least squares phase unwrapping is a robust approach to phase unwrapping that unwraps around (rather than through) regions of corrupted phase. Currently, the only practical method for solving the weighted least squares equations is a preconditioned conjugate gradient (PCG) technique. In this paper the authors present a new method for weighted least squares phase unwrapping. Their method is a multigrid technique that solves the equations on smaller, coarser grids by means of Gauss-Seidel relaxation schemes and transfers the intermediate results to the finer grids. A key idea of their approach is to maintain the partial derivatives of the given phase data in separate arrays and to correct these derivatives at the boundaries of the coarser grids. This correction maintains the boundary conditions necessary for convergence to the correct solution. Another key idea of their approach is to transfer the weighting values to the coarser grids in a carefully defined manner. They also present methods for defining the initial phase weights in an automated fashion. The resulting multigrid algorithm converges in only one or two multigrid cycles and is generally 15-25 times faster than the PCG technique

Published in:

IEEE Transactions on Geoscience and Remote Sensing  (Volume:34 ,  Issue: 3 )