.png){kind=icon}
.png){kind=icon}
Return
Pattern Encoding of Robust M-Array Driven by Texture Constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/TIM.2023.3277941.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
M-Array pattern encoding is widely used in structured light for 3-D reconstruction due to its single-projection and single-imaging characteristics. The robustness of M-Array in 3-D reconstruction can be assessed by the accuracy of the global positioning of the code word and the density of the decodable feature points. This article proposes a pattern encoding method of robust M-Array based on texture constraints. M-Arrays are formed by matching and splicing candidate sub-windows, which are composed of symbols obtained from an M-Sequence one by one. To construct an M-Array with more texture information, both the number of edges and the maximum rectangular area within the sub-window are constrained. A novel three-level backtracking mechanism reduces the time complexity. Four indicators are introduced to evaluate the robustness of the M-Array and used to compare the proposed method with existing methods. The results show that the proposed method has low similarity between adjacent sub-windows and high uniformity of symbol distribution globally, indicating better accuracy of sub-window decoding. A 3-D reconstruction experiment in the actual scenes proves that the point cloud density and accuracy obtained by solving the M-Array pattern constructed by the method proposed are better.
Keywords:
3-D reconstruction
binary pattern
M-Array
pattern encoding
pseudorandom pattern
structured light
Journal
IF:
5.9
Papers:
1.9W
Citations:
5.8W