We provide a review of recent advances in 3D surface imaging technologies. We focus particularly on noncontact 3D surface measurement techniques based on structured illumination. The high-speed and high-resolution pattern projection capability offered by the digital light projection technology, together with the recent advances in imaging sensor technologies, may enable new generation systems for 3D surface measurement applications that will provide much better functionality and performance than existing ones in terms of speed, accuracy, resolution, modularization, and ease of use. Performance indexes of 3D imaging system are discussed, and various 3D surface imaging schemes are categorized, illustrated, and compared. Calibration techniques are also discussed, since they play critical roles in achieving the required precision. Numerous applications of 3D surface imaging technologies are discussed with several examples.

Structured-light 3D surface imaging: a tutorial

http://eia.udg.edu/~qsalvi/papers/2004-PR.pdf

Pattern codification strategies in structured light systems

http://eia.udg.es/~qsalvi/papers/2010-PR.pdf

A state of the art in structured light patterns for surface profilometry

Phase shifting algorithms for fringe projection profilometry: A review

Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas

A common problem of Pattern projection methods to measure surfaces of 3-D objects is that an observed pattern possibly i ncludes disorders such as deficiency, d isplacement, and permutation of subpatterns. These disorders make it difficult to match observed patterns with its position on the projected one and cause wrong m easurements as a result. This paper proposes a new technique to correct pattern disorders by using a pattern made from an M-array which is a two-dimensional extension of a well-known M-sequence.

Reconstruction Of Surfaces Of 3-D Objects By M-array Pattern Projection Method

We present a systematic procedure for mapping data sequences into codewords of a prefix-synchronized code (PS-code), as well as for performing the inverse mapping. A PS-code, proposed by Gilbert (1960), belongs to a subclass of comma-free codes and is useful to recover word synchronization when errors have occurred in the stream of codewords. A PS-code is defined as a set of codewords with the property that each codeword has a known sequence as a prefix, followed by a coded data sequence in which this prefix is not allowed to occur. The largest PS-code among all PS-codes of the same code length is called a maximal prefix-synchronized code (MPS-code). We develop an encoding and decoding algorithm for Gilbert's MPS-code with a prefix of the form 11...10 and extend the algorithm to the class PS-codes of which the prefix is self-uncorrelated. The computational complexity of the entire mapping process is proportional to the length of the codewords.

On the construction of maximal prefix-synchronized codes

Codes over the Ring of Integers Modulo m

This paper shows that a two-pass universal antidictionary coding method is asymptotically optimal for stationary ergodic sources with a finite alphabet. To prove the results, we propose a new compact tree representation of an antidictionary. We also extend the lossless compression algorithm proposed by Dubé and Beaudoin, called CSE, from the binary alphabet to the q-ary alphabet (q ≥ 2), which we utilize to efficiently compress the antidictionary of an input sequence to be encoded.

On a universal antidictionary coding for stationary ergodic sources with finite alphabet.

This paper proposes a new on-line antidictionary code with linear time. The proposed algorithm uses a subset of antidictionary which length of the elements is at most a given fixed length. It is proved that the time complexity of this algorithm is linear with respect to the string length. Its effectiveness is demonstrated by simulation results.

Hiroyoshi Morita

Papers

Reconstruction Of Surfaces Of 3-D Objects By M-array Pattern Projection Method

On the construction of maximal prefix-synchronized codes

Codes over the Ring of Integers Modulo m

On a universal antidictionary coding for stationary ergodic sources with finite alphabet.

On the adaptive antidictionary code using minimal forbidden words with constant lengths