z-logo
open-access-imgOpen Access
Multi-anchor spatial phase unwrapping for fringe projection profilometry
Author(s) -
Sen Xiang,
Yang You,
Deng Hu,
Jin Wu,
Li Yu
Publication year - 2019
Publication title -
optics express
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.27.033488
Subject(s) - computer science , scan line , profilometer , phase unwrapping , structured light 3d scanner , phase (matter) , optics , computer vision , pixel , smoothness , artificial intelligence , projection (relational algebra) , absolute phase , computer graphics (images) , algorithm , phase noise , interferometry , mathematics , surface roughness , physics , mathematical analysis , scanner , quantum mechanics , grayscale
Phase unwrapping is a necessary step in fringe-projection profilometry that produces accurate depth maps. However, the original wrapped phase is often corrupted by errors, and thus conventional spatial unwrapping suffers from error propagation, such as scanline-based unwrapping, and high complexity, such as quality-guided methods. In this paper, we propose a fast and robust spatial unwrapping method called multi-anchor scanline unwrapping (MASU). Different from previous work, when unwrapping each pixel, MASU refers to multiple anchors in the scanline, where each anchor has a threshold adapting to its location. In such a manner, a set of fringe order candidates are predicted by the anchors according to phase smoothness assumption, and the one with the highest number of votes is chosen. After that, with the obtained fringe order, the absolute phase and depth are computed. Simulation and experiments have shown that even corrupted by severe phase errors, the proposed MASU can still produce robust unwrapped results. In addition, MASU is thousands of times faster than quality-guided unwrapping with comparative or even superior depth accuracy.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here