The paper presents a new max-flow/min-cut approach for recovering the absolute phase from modulo-2/spl pi/ phase, the so-called phase unwrapping (PU) problem. The adopted criterion is the minimization of the L/sup p/ norm of phase differences, leading to computationally demanding integer optimization problems. The unwrapped phase is computed iteratively through a sequence of binary optimizations, each one mapped onto a max-flow/min-cut problem on a certain graph. Accordingly, we name this new algorithm PUMF (for phase unwrapping max-flow). A set of experimental results illustrates the effectiveness of PUMF approach, namely for 0 < p < 1, where most competitors fail.
Phase unwrapping: a new max-flow/min-cut based approach
2005-01-01
200235 byte
Conference paper
Electronic Resource
English
Phase Unwrapping: A New Max-Flow/Min-Cut Based Approach
British Library Conference Proceedings | 2005
|British Library Conference Proceedings | 1990
|A CNN-Based Coherence-Driven Approach for InSAR Phase Unwrapping
German Aerospace Center (DLR) | 2020
|Temporal Phase Unwrapping Using Bayesian Inference
British Library Conference Proceedings | 2010
|