Hierarchical GraphCut Phase Unwrapping Based on Invariance of Diffeomorphisms Framework

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π. The goal is to estimate the unwrapped phase count k, an integer-valued variable in the equation Φ = φ + 2πk, where φ is the wrapped phase and Φ 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π 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² error in both real experiments and simulations, showing potential for real-time applications.