A multigrid approach to two‐dimensional phase unwrapping
DOI10.1002/NLA.380zbMATH Open1164.94300OpenAlexW2035070982MaRDI QIDQ3412432FDOQ3412432
Authors: Gregory Dardyk, Irad Yavneh 
Publication date: 6 December 2006
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.380
Recommendations
- A comparative study of two fast phase unwrapping algorithms.
- Publication:4493216
- A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
- Solving the Phase Unwrapping Problem by a Parametrized Network Optimization Approach
- A class of global optimization problems as models of the phase unwrapping problem
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10) Computing methodologies for image processing (68U10)
Cited In (9)
- Solving the Phase Unwrapping Problem by a Parametrized Network Optimization Approach
- Algebraic multidimensional phase unwrapping and zero distribution of complex polynomials -- characterization of multivariate stable polynomials
- Title not available (Why is that?)
- A comparative study of two fast phase unwrapping algorithms.
- A class of global optimization problems as models of the phase unwrapping problem
- Sparse-representation-based direct minimum \(L^p\)-norm algorithm for MRI phase unwrapping
- Title not available (Why is that?)
- A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
- Title not available (Why is that?)
This page was built for publication: A multigrid approach to two‐dimensional phase unwrapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412432)
