Complementary Gray Code Fourfold-N Step Phase Shift Grating Fringe Projection Profilometry
Shuhuan Han, Yanxi Yang, Xinyu Zhang, Wei Liu
Abstract
Complementary Gray code <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> -step phase shift algorithm has been widely used because of its high detection accuracy. In order to solve its low detection efficiency and real-time detection, this article proposes a grating projection profilometry based on the combination of complementary Gray code and fourfold- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> step phase shift algorithm. When the number of phase shift steps is an integral multiple of four, divide images into <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> /4 groups according to the same phase difference, then get the wrapped phase of each group image, and fuse them. Finally, unwrap phase with complementary Gray code. The algorithm in this article can quickly eliminate periodic phase error and obtain a high-precision unwrapped phase. In order to prove the effectiveness of this algorithm, the algorithm in this article is compared with the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> -step phase shift algorithm of complementary Gray code and the double <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> -step phase shift algorithm of complementary Gray code with different <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> -values. The experimental result shows that the proposed algorithm can achieve high-precision phase unwrapping and improve the efficiency by 5%–20%.