Real-time structured light patterns coding with subperfect submaps

Coded structured light is a technique that allows the 3-D reconstruction of poorly or non-textured scene areas. The codes, uniquely associated with visual primitives of the projected pattern, allow to solve the correspondence problem using local information only with robustness against pertubations like high curvatures, occlusions, out of field of view, out-of-focus. Real-time 3-D reconstruction is possible with pseudo-random arrays, where the encoding is done in a single pattern using spatial neighbourhood. Ensuring a higher Hamming distance between all the used codewords, will allow to correct more mislabeled primitives and thus ensure patterns globally more robust.1 Up to now, the proposed coding schemes ensured the Hamming distance between all the primitives of the pattern which was generated offline, beforehand, producing Perfect SubMaps (PSM). But knowing the epipolar geometry of the projector-camera system, one can ensure the Hamming distance only between primitives that will project along nearby epipolar lines, because these only can produce correspondence ambiguity during the decoding process. As for such a new coding scheme, the Hamming distance have to be checked only in subsets of the pattern primitives, the patterns are globally far less constrained and therefore can be generated at a video framerate. We call such a new pattern coding as SubPerfect SubMaps (SPSM).

[1]  de Ng Dick Bruijn A combinatorial problem , 1946 .

[2]  Kasper Claes Structured Light Adapted to Control a Robot Arm(Gestructureerd licht aangepast aan de controle van een robotarm) , 2008 .

[3]  Antonio Adán,et al.  Moving surface extraction based on unordered hexagonal perfect submaps projection: Applications to 3D feature tracking , 2009, Image Vis. Comput..

[4]  Pierre Graebling,et al.  Robust Structured Light Coding for 3D Reconstruction , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[5]  Joaquim Salvi,et al.  A robust-coded pattern projection for dynamic 3D scene measurement , 1998, Pattern Recognit. Lett..

[6]  Shojiro Sakata,et al.  Reconstruction Of Surfaces Of 3-D Objects By M-array Pattern Projection Method , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[7]  Kenneth G. Paterson Perfect maps , 1994, IEEE Trans. Inf. Theory.

[8]  Emil M. Petriu,et al.  Robust pseudo-random coded colored structured light technique for 3D object model recovery , 2008, 2008 International Workshop on Robotic and Sensors Environments.

[9]  Cengizhan Ozturk,et al.  Structured Light Using Pseudorandom Codes , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Joaquim Salvi,et al.  Pattern codification strategies in structured light systems , 2004, Pattern Recognit..

[11]  Paul M. Griffin,et al.  Generation of uniquely encoded light patterns for range data acquisition , 1992, Pattern Recognit..

[12]  Tuvi Etzion,et al.  Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.

[13]  Glenn H. Hurlbert,et al.  On the de Bruijn Torus Problem , 1993, J. Comb. Theory, Ser. A.

[14]  Luc Van Gool,et al.  Real-time range acquisition by adaptive structured light , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Jianwei Zhang,et al.  Realtime Structured Light Vision with the Principle of Unique Color Codes , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[16]  Joaquim Salvi,et al.  Recent progress in coded structured light as a technique to solve the correspondence problem: a survey , 1998, Pattern Recognit..

[17]  Xavier Armangué,et al.  Overall view regarding fundamental matrix estimation , 2003, Image Vis. Comput..

[18]  Chris J. Mitchell,et al.  Aperiodic and semi-periodic perfect maps , 1995, IEEE Trans. Inf. Theory.