OSA's Digital Library

Journal of the Optical Society of America A

Journal of the Optical Society of America A

| OPTICS, IMAGE SCIENCE, AND VISION

  • Editor: Franco Gori
  • Vol. 27, Iss. 3 — Mar. 1, 2010
  • pp: 605–612

Edgelist phase unwrapping algorithm for time series InSAR analysis

A. Piyush Shanker and Howard Zebker  »View Author Affiliations


JOSA A, Vol. 27, Issue 3, pp. 605-612 (2010)
http://dx.doi.org/10.1364/JOSAA.27.000605


View Full Text Article

Enhanced HTML    Acrobat PDF (898 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

We present here a new integer programming formulation for phase unwrapping of multidimensional data. Phase unwrapping is a key problem in many coherent imaging systems, including time series synthetic aperture radar interferometry (InSAR), with two spatial and one temporal data dimensions. The minimum cost flow (MCF) [ IEEE Trans. Geosci. Remote Sens. 36, 813 (1998) ] phase unwrapping algorithm describes a global cost minimization problem involving flow between phase residues computed over closed loops. Here we replace closed loops by reliable edges as the basic construct, thus leading to the name “edgelist.” Our algorithm has several advantages over current methods—it simplifies the representation of multidimensional phase unwrapping, it incorporates data from external sources, such as GPS, where available to better constrain the unwrapped solution, and it treats regularly sampled or sparsely sampled data alike. It thus is particularly applicable to time series InSAR, where data are often irregularly spaced in time and individual interferograms can be corrupted with large decorrelated regions. We show that, similar to the MCF network problem, the edgelist formulation also exhibits total unimodularity, which enables us to solve the integer program problem by using efficient linear programming tools. We apply our method to a persistent scatterer-InSAR data set from the creeping section of the Central San Andreas Fault and find that the average creep rate of 22 mm Yr is constant within 3 mm Yr over 1992–2004 but varies systematically with ground location, with a slightly higher rate in 1992–1998 than in 1999–2003.

© 2010 Optical Society of America

OCIS Codes
(100.6890) Image processing : Three-dimensional image processing
(120.3180) Instrumentation, measurement, and metrology : Interferometry
(280.6730) Remote sensing and sensors : Synthetic aperture radar
(350.5030) Other areas of optics : Phase
(100.5088) Image processing : Phase unwrapping

ToC Category:
Image Processing

History
Original Manuscript: August 31, 2009
Manuscript Accepted: December 8, 2009
Published: February 26, 2010

Citation
A. Piyush Shanker and Howard Zebker, "Edgelist phase unwrapping algorithm for time series InSAR analysis," J. Opt. Soc. Am. A 27, 605-612 (2010)
http://www.opticsinfobase.org/josaa/abstract.cfm?URI=josaa-27-3-605


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. M. Costantini, “A novel phase unwrapping method based on network programming,” IEEE Trans. Geosci. Remote Sens. 36, 813-821 (1998). [CrossRef]
  2. B. R. Hunt, “Matrix formulation of the reconstruction of phase values from phase differences,” J. Opt. Soc. Am. 69, 393-399 (1979). [CrossRef]
  3. R. M. Goldstein, H. A. Zebker, and C. L. Werner, “Satellite radar interferometry: two-dimensional phase unwrapping,” Radio Sci. 23, 713-720 (1988). [CrossRef]
  4. N. H. Ching, D. Rosenfeld, and M. Braun, “Two-dimensional phase unwrapping using a minimum spanning tree algorithm,” IEEE Trans. Image Process. 1, 355-365 (1992). [CrossRef] [PubMed]
  5. D. C. Ghiglia and L. A. Romero, “Minimum Lp-norm two-dimensional phase unwrapping,” J. Opt. Soc. Am. A 13, 1999-2013 (1996). [CrossRef]
  6. M. D. Pritt, “Phase unwrapping by means of multigrid techniques for interferometric SAR,” IEEE Trans. Geosci. Remote Sens. 34, 728-738 (1996). [CrossRef]
  7. T. J. Flynn, “Two-dimensional phase unwrapping with minimum weighted discontinuity,” J. Opt. Soc. Am. A 14, 2692-2701 (1997). [CrossRef]
  8. H. A. Zebker and Y. Lu, “Phase unwrapping algorithms for radar interferometry: residue-cut, least squares, and synthesis algorithms,” J. Opt. Soc. Am. A 15, 586-598 (1998). [CrossRef]
  9. C. W. Chen and H. A. Zebker, “Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms,” J. Opt. Soc. Am. A 17, 401-414 (2000). [CrossRef]
  10. A. Hooper and H. Zebker, “Phase unwrapping three dimensions, with applications to InSAR time series,” J. Opt. Soc. Am. A 24, 2737-2747 (2007). [CrossRef]
  11. D. C. Ghiglia and L. A. Romero, “Robust two-dimensional weighted and unweighted phase unwrapping that uses fast transforms and iterative methods,” J. Opt. Soc. Am. A 11, 107-117 (1994). [CrossRef]
  12. M. Costantini and P. A. Rosen, “A generalized phase unwrapping approach for sparse data,” in IEEE 1999 International Geoscience and Remote Sensing Symposium, 1999, IGARSS'99 (IEEE, 1999), Vol. 1, pp. 267-269. [CrossRef]
  13. C. Barber and H. Hudanpaa, Qhull, http://www.qhull. org.
  14. C. W. Chen and H. A. Zebker, “Two-dimensional phase unwrapping with use of statistical models for cost functions in nonlinear optimization,” J. Opt. Soc. Am. A 18, 338-351 (2001). [CrossRef]
  15. R. K. Ahuja, D. S. Hochbaum, and J. B. Orlin, “Solving the convex cost integer dual network flow problem,” in Integer Programming and Combinatorial Optimization, G.Cornuéjols, R.E.Burkard, and G.J.Woeginger, eds., Vol. 1610 of Lecture Notes in Computer Science (Springer, 1999), pp. 31-44. [CrossRef]
  16. A. J. Hoffman and J. B. Kruskal, “Integral boundary points of convex polyhedral,” in Linear Inequalities and Related Systems, H.W.Tucker and A.W.kuhn, eds. (Princeton Univ. Press, 1965) pp. 223-246.
  17. C. W. Chen and H. A. Zebker, “Phase unwrapping for large SAR interferograms: statistical segmentation and generalized network models,” IEEE Trans. Geosci. Remote Sens. 40, 1709-1719 (2002). [CrossRef]
  18. G. Zhou and M. Gen, “Genetic algorithm approach on multi-criteria minimum spanning tree problem,” Eur. J. Oper. Res. 114141-152 (1997). [CrossRef]
  19. J. D. Knowles and D. W. Corne, “A comparison of encodings and algorithms for multiobjective minimum spanning tree problems,” in Proceedings of the 2001 Congress on Evolutionary Computation, 2001 (IEEE, 2001) Vol. 1, pp. 544-551.
  20. I. Ryder and R. Burgmann, “Spatial variations in slip deficit on the Central San Andreas Fault from InSAR,” Geophys. J. Int. 175, 837-852 (2008). [CrossRef]
  21. P. Shanker and H. Zebker, “Persistent scatterer selection using maximum likelihood estimation,” Geophys. Res. Lett. 34, L22301 (2007). [CrossRef]
  22. C. Colesanti, A. Ferretti, F. Novali, C. Prati, and F. Rocca, “SAR monitoring of progressive and seasonal ground deformation using the permanent scatterers technique,” IEEE Trans. Geosci. Remote Sens. 41, 1685-1701 (2003). [CrossRef]
  23. A. Pepe and R. Lanari, “On the extension of minimum cost flow algorithm for phase unwrapping of multitemporal differential SAR interferograms,” IEEE Trans. Geosci. Remote Sens. 44, 2374-2383 (2006). [CrossRef]
  24. F. Rolandone, R. Bürgmann, D. C. Agnew, I. A. Johanson, D. C. Templeton, M. A. d'Alessio, S. J. Titus, C. DeMets, and B. Tikoff, “Aseismic slip and fault-normal strain along the creeping segment of the San Andreas fault,” Geophys. Res. Lett. 35, L034437 (2007).
  25. R. M. Nadeau and T. V. McEvilly, “Periodic pulsing of characteristic micro earthquakes on San Andreas Fault,” Science 303, 220-222 (2004). [CrossRef] [PubMed]
  26. CPLEX, “Using the CPLEX callable library—version 10.0,” (CPLEX Optimization, Inc., 2006).
  27. M. Costantini, M. Costantini, F. Malvarosa, and F. Minati, “A general formulation for robust integration of finite differences and phase unwrapping on sparse multidimensional domains,” presented at ESA FRINGE 2009 Workshop, Frascati, Italy, Nov. 30-Dec. 4, 2009.
  28. A. F. Veinott and G. B. Dantzig, “Integral extreme points,” SIAM Rev. 10, 371-372 (1968). [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