Maximum smoothness consistent unwrapping of n-dimensional phase fields

被引:1
|
作者
Estrada, Julio C. [1 ]
Ramirez-Manzanares, Alonso [1 ]
Concha, Luis [2 ]
Marroquin, Jose L. [1 ]
机构
[1] Ctr Invest Matemat AC, Guanajuato, Gto, Mexico
[2] Univ Nacl Autonoma Mexico, Inst Neurobiol, Queretaro, Mexico
关键词
Fringe analysis; Phase unwrapping; Magnetic resonance imaging; Phase measurement; RADAR INTERFEROMETRY; IRON-DEPOSITION; DYNAMIC-SYSTEM; ALGORITHM;
D O I
10.1016/j.optlaseng.2020.106087
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
The accurate recovery of an n-Dimensional field from observations that are wrapped into a particular interval (e.g., [-pi, pi]) is a problematic step in many applications, such as holography, interferometry, optical metrology, magnetic resonance imaging and analog-to-digital conversion in digital photography. While methods designed for this purpose abound (mainly in the 2-Dimensional case), most fail if the original unwrapped field contains abrupt changes that become aliased. In this paper we present Maximum Smoothness Consistent Unwrapping (MSCU), a novel and general method that overcomes said limitation. The method operates in two stages: in the first, a region without aliased changes which is as large as possible (which we call the consistent region) is found, and in the second, the unwrapped phase in the consistent region is propagated to the inconsistent areas to get the final result. MSCU has the following advantages: it is well founded theoretically, which allows the assessment of the reliability of its results; it is directly applicable to fields in any number of dimensions and when the signal is wrapped module any real number P; it has no free parameters to adjust; and it is computationally efficient and easy to implement. We present a formal derivation of the method and illustrations of its performance, both in synthetic fields -where we compare it with that of other state-of-the-art methods- and in real data (2-D data from optical speckle interferometry and 3-D data from magnetic susceptibility images obtained by magnetic resonance acquisitions). In this paper we focus on phase unwrapping applications, but the presented method may be directly applied to the case of other wrapping intervals as well, as for instance in High Dynamic Range image processing.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Fast, automated, N-dimensional phase-unwrapping algorithm
    Jenkinson, M
    MAGNETIC RESONANCE IN MEDICINE, 2003, 49 (01) : 193 - 197
  • [2] Maximum Matchings in the n-Dimensional Cube
    V. E. Tarakanov
    Mathematical Notes, 2001, 69 : 411 - 420
  • [3] Maximum matchings in the n-dimensional cube
    Tarakanov, VE
    MATHEMATICAL NOTES, 2001, 69 (3-4) : 411 - 420
  • [4] Balancing rewrapping error and smoothness in two dimensional phase unwrapping problems
    Schultz, DC
    Koetter, R
    Frey, BJ
    Munson, DC
    IGARSS 2002: IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM AND 24TH CANADIAN SYMPOSIUM ON REMOTE SENSING, VOLS I-VI, PROCEEDINGS: REMOTE SENSING: INTEGRATING OUR VIEW OF THE PLANET, 2002, : 2507 - 2509
  • [5] TENSOR FIELDS ON AN N-DIMENSIONAL SPHERE
    GLAZUNOV, NI
    DOKLADY AKADEMII NAUK SSSR, 1963, 148 (02): : 264 - &
  • [6] On the n-Dimensional Phase Portraits
    Rodriguez-Licea, Martin-Antonio
    Perez-Pinal, Francisco-J
    Nunez-Perez, Jose-Cruz
    Sandoval-Ibarra, Yuma
    APPLIED SCIENCES-BASEL, 2019, 9 (05):
  • [7] Vector fields in n-dimensional Manifolds.
    Hopf, Heinz
    MATHEMATISCHE ANNALEN, 1927, 96 : 225 - 250
  • [8] N-DIMENSIONAL EQUATIONS WITH THE MAXIMUM NUMBER OF SYMMETRY GENERATORS
    DUARTE, LGS
    DUARTE, SES
    MOREIRA, IC
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1989, 22 (06): : L201 - L205
  • [9] Generalize the EMD scheme on an n-dimensional hypercube with maximum payload
    Leng, Hui-Shih
    Tseng, Hsien-Wen
    MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (13) : 18363 - 18377
  • [10] N-Dimensional Phase Approximation in the L∞-Norm
    Wasfi S. Kafri
    Wael Hashlamoun
    Multidimensional Systems and Signal Processing, 2000, 11 : 257 - 275