Global phase unwrapping of interferograms

• US 5,923,278 A
• Filed: 07/09/1997
• Issued: 07/13/1999
• Est. Priority Date: 07/11/1996
• Status: Expired due to Term

• Current Assignee: Leidos, Inc. (Leidos Holdings, Inc.)
• Original Assignee: Science Applications International Corporation
• Inventors: Poehler, Paul L., Mansfield, Arthur W.
• Primary Examiner(s): Lobo, Ian J.
• Application Number:
  US08/890,597
• Time in Patent Office: 734 Days
• Field of Search: 342/25, 342/191
• US Class Current: 342/25.00C
• CPC Class Codes: G01S 13/86 Combinations of radar systems with non-radar systems, e.g. sonar, direction finder
• CPC Class Codes: G01S 13/9019 Auto-focussing of the SAR signals
• CPC Class Codes: G01S 13/9023 combined with interferometric techniques
• CPC Class Codes: G01S 13/904 SAR modes

Abstract

An interferogram is an array of phases, often generated from the inverse tangent of a ratio of an imaginary component divided by a real component. The array is said to be a wrapped phase array when the phase angle is modulo between zero and 2π. A method of processing a wrapped phase array into an unwrapped phase array includes computing a first array from the wrapped phase array, each element of the first array being based on a discrete Poisson difference equation, processing the first array through a two dimensional FFT to form a second array, scaling the second array by a scaling function to form a third array, and processing the third array through an inverse two dimensional FFT to form the unwrapped phase array. The step of computing a first array includes forming a twice unfolded array from the wrapped phase array, computing a row difference array, an element in the row difference array being based on a difference between an element in a particular row in the twice unfolded array and an element in an adjacent row in the twice unfolded array, computing a column difference array, an element in the column difference array being based on a difference between an element in a particular column in the twice unfolded array and an element in an adjacent column in the twice unfolded array, computing a double row difference array, an element in the double row difference array being based on a difference between an element in the particular row in the row difference array and an element in an adjacent row in the row difference array, computing a double column difference array, an element in the double column difference array being based on a difference between an element in the particular column in the column difference array and an element in an adjacent column in the column difference array, and adding the double row difference array to the double column difference array element by element to form the first array.

Claims

1. A method of processing a wrapped phase array into an unwrapped phase array, the method comprising steps of:

forming a twice unfolded array from the wrapped phase array and computing a first array, each element of the first array being based on a discrete Poisson difference equation;

processing the first array through a two dimensional FFT to form a second array;

scaling the second array by a scaling function to form a third array; and

processing the third array through an inverse two dimensional FFT to form the unwrapped phase array.

2. The method of claim 1, wherein the step of forming a twice unfolded array forms an array periodic in two dimensions.

3. The method of claim 2, wherein the step of computing a first array further comprises steps of:

computing a row difference array, an element in the row difference array being based on a difference between an element in a particular row in the twice unfolded array and an element in an adjacent row in the twice unfolded array;

computing a column difference array, an element in the column difference array being based on a difference between an element in a particular column in the twice unfolded array and an element in an adjacent column in the twice unfolded array;

computing a double row difference array, an element in the double row difference array being based on a difference between an element in the particular row in the row difference array and an element in an adjacent row in the row difference array;

computing a double column difference array, an element in the double column difference array being based on a difference between an element in the particular column in the column difference array and an element in an adjacent column in the column difference array; and

adding the double row difference array to the double column difference array element by element to form the first array.

4. The method of claim 1, wherein the step of scaling multiplies the scaling function by each element in the second array, the scaling function being an inverse of:

space="preserve" listing-type="equation">2cos(π

m/M)+2cos(π

n/N)-4,

where

M is a number of rows in the second array,

m is an index for M,

N is a number of columns in the second array, and

n is an index for N.

5. A computing machine comprising:

a processor;

a first module to form a twice unfolded array and compute a first array from a wrapped phase array, each element of the first array being based on a discrete Poisson difference equation;

a second module to process the first array through a two dimensional FFT to form a second array;

a third module to scale the second array by a scaling function to form a third array; and

a fourth module to process the third array through an inverse two dimensional FFT to form a unwrapped phase array.

6. The machine of claim 5, wherein the first module comprises a first sub-module to form the twice unfolded array as an array periodic in two dimensions.

7. The machine of claim 6, wherein the first module further comprises:

a second sub-module to compute a row difference array, an element in the row difference array being based on a difference between an element in a particular row in the twice unfolded array and an element in an adjacent row in the twice unfolded array;

a third sub-module to compute a column difference array, an element in the column difference array being based on a difference between an element in a particular column in the twice unfolded array and an element in an adjacent column in the twice unfolded array;

a fourth sub-module to compute a double row difference array, an element in the double row difference array being based on a difference between an element in the particular row in the row difference array and an element in an adjacent row in the row difference array;

a fifth sub-module to compute a double column difference array, an element in the double column difference array being based on a difference between an element in the particular column in the column difference array and an element in an adjacent column in the column difference array; and

a sixth sub-module to add the double row difference array to the double column difference array element by element to form the first array.

8. The machine of claim 5, wherein the third module multiplies the scaling function by each element in the second array, the scaling function being an inverse of:

space="preserve" listing-type="equation">2cos(π

m/M)+2cos(π

n/N)-4,

where

M is a number of rows in the second array,

m is an index for M,

N is a number of columns in the second array, and

n is an index for N.

9. A computer readable medium having stored thereon a plurality of modules for controlling a computer, the plurality of modules comprising:

a first module to control the processor to form a twice unfolded array and compute a first array from a wrapped phase array, each element of the first array being based on a discrete Poisson difference equation;

a second module to control the procesor to process the first array through a two dimensional FFT to form a second array;

a third module to control the processor to scale the second array by a scaling function to form a third array; and

a fourth module to control the processor to process the third array through an inverse two dimensional FFT to form a unwrapped phase array.

10. The medium of claim 9, wherein the first module comprises a first sub-module to control the processor to form the twice unfolded array as an array in two dimensions.

11. The medium of claim 10, wherein the first module further comprises:

a second sub-module to control the processor to compute a row difference array, an element in the row difference array being based on a difference between an element in a particular row in the twice unfolded array and an element in an adjacent row in the twice unfolded array;

a third sub-module to control the processor to compute a column difference array, an element in the column difference array being based on a difference between an element in a particular column in the twice unfolded array and an element in an adjacent column in the twice unfolded array;

a fourth sub-module to control the processor to compute a double row difference array, an element in the double row difference array being based on a difference between an element in the particular row in the row difference array and an element in an adjacent row in the row difference array;

a fifth sub-module to control the processor to compute a double column difference array, an element in the double column difference array being based on a difference between an element in the particular column in the column difference array and an element in an adjacent column in the column difference array; and

a sixth sub-module to control the processor to add the double row difference array to the double column difference array element by element to form the first array.

12. The medium of claim 9, wherein the third module controls the processor to multiply the scaling function by each element in the second array, the scaling function being an inverse of:

space="preserve" listing-type="equation">2cos(π

m/M)+2cos(π

n/N)-4,

where

M is a number of rows in the second array,

m is an index for M,

N is a number of columns in the second array, and

n is an index for N.