z-logo
open-access-imgOpen Access
Efficient intensity-based fringe projection profilometry method resistant to global illumination
Author(s) -
Ji Deng,
Jian Li,
Hao Feng,
Shumeng Ding,
Xiaoli Yu,
Wei Han,
Zhoumo Zeng
Publication year - 2020
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.408835
Subject(s) - computer science , optics , structured light 3d scanner , artificial intelligence , robustness (evolution) , computer vision , global illumination , projection (relational algebra) , phase retrieval , algorithm , mathematics , physics , rendering (computer graphics) , fourier transform , mathematical analysis , biochemistry , chemistry , scanner , gene
Intensity-based fringe projection profilometry (IBFPP) is used widely because of its simple structure, high robustness, and noise resilience. Most IBFPP methods assume that any scene point is illuminated by direct illumination only, but global illumination effects introduce strong biases in the reconstruction result for many real-world scenes. To solve this problem, this paper describes an efficient IBFPP method for reconstructing three-dimensional geometry in the presence of global illumination. First, the average intensity of two sinusoidal patterns is used as a pixel-wise threshold to binarize the codeword patterns. The binarized template pattern is then used to convert other binarized fringe patterns into traditional Gray-code patterns. A proprietary compensation algorithm is then applied to eliminate fringe errors caused by environmental noise and lens defocusing. Finally, simple, efficient, and robust phase unwrapping can be achieved despite the effects of subsurface scattering and interreflection. Experimental results obtained in different environments show that the proposed method can obtain three-dimensional information reliably when influenced by global illumination.

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