Hierarchical GraphCut Phase Unwrapping Based on Invariance of Diffeomorphisms Framework
Open Access
- 9 May 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 6, 546-554
Abstract
Recent years have witnessed rapid advancements in 3D scanning technologies, with diverse applications spanning VR/AR, digital human creation, and medical imaging. Structured-light scanning with phase-shifting techniques is preferred for its use of non-radiative, low-intensity visible light and high accuracy, making it well suited for human-centric applications such as capturing 4D facial dynamics. A key step in these systems is phase unwrapping, which recovers continuous phase values from measurements that are inherently wrapped modulo $2\pi$. The goal is to estimate the unwrapped phase count $k$, an integer-valued variable in the equation $\Phi = \phi + 2\pi k$, where $\phi$ is the wrapped phase and $\Phi$ is the true phase. However, the presence of noise, occlusions, and piecewise continuous phase functions induced by complex 3D surface geometry makes the inverse reconstruction of the true phase extremely challenging. This is because phase unwrapping is an inherently ill-posed problem: measurements only provide modulo $2\pi$ values, and recovering the correct unwrapped phase count requires strong assumptions about the smoothness or continuity of the underlying 3D surface. Existing methods typically involve a trade-off between speed and accuracy: Fast approaches lack precision, while accurate algorithms are too slow for real-time use. To overcome these limitations, this work proposes a novel phase unwrapping framework that reformulates GraphCut-based unwrapping as a pixel-labeling problem. This framework helps significantly improve the estimation of the unwrapped phase count $k$ through the invariance property of diffeomorphisms applied in image space via conformal and optimal transport (OT) maps. An odd number of diffeomorphisms are precomputed from the input phase data, and a hierarchical GraphCut algorithm is applied in each corresponding domain. The resulting label maps are fused via majority voting to efficiently and robustly estimate the unwrapped phase count $k$ at each pixel, using an odd number of votes to break ties. Experimental results demonstrate a 45.5× speedup and lower $L^{2}$ error in both real experiments and simulations, showing potential for real-time applications.Keywords
This publication has 25 references indexed in Scilit:
- High-speed 3D shape measurement with structured light methods: A reviewOptics and Lasers in Engineering, 2018
- Infrared system for 3D scanning of metallic surfacesMachine Vision and Applications, 2013
- 3D shape scanning with a time-of-flight camera2010
- Recent progresses on real-time 3D shape measurement using digital fringe projection techniquesOptics and Lasers in Engineering, 2010
- High-quality scanning using time-of-flight depth superresolution2008
- Star Shape Prior for Graph-Cut Image Segmentation2008
- Reliability-guided phase unwrapping algorithm: a reviewOptics and Lasers in Engineering, 2004
- Topics in Optimal Transportation2003
- Phase unwrapping by means of multigrid techniques for interferometric SARIEEE Transactions on Geoscience and Remote Sensing, 1996
- Satellite radar interferometry: Two‐dimensional phase unwrappingRadio Science, 1988