Fast Generation and Reconstruction of Digital Holograms Using a Novel Look-up Table 


Vol. 33,  No. 3, pp. 255-261, Mar.  2008


PDF
  Abstract

Conventional look-up table(LT) has gained a lot of speed increase in generation of digital holograms for 3D objects, but it has required an enormous memory size of the LT. In this paper, a novel approach to dramatically reduce the size of the conventional LT, still keeping its advantage of fast computational speed is proposed, which is called here a N-LT(novel look-up table) method. In the proposed method, only the fringe patterns of the center points on each image plane are pre-calculated, called elemental fringe patterns and stored in the look-up table. Then, the fringe patterns for other object points on each image plane can be obtained by simply shifting this pre-calculated elemental fringe pattern according to the displaced values from the center to those points and adding them together. Some experimental results revealed that the computational speed and the required memory size of the proposed approach are found to be 48.7 times faster than that of the ray-tracing method and 217 times smaller than that of the conventional LT method, respectively.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Kim and E. Kim, "Fast Generation and Reconstruction of Digital Holograms Using a Novel Look-up Table," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 3, pp. 255-261, 2008. DOI: .

[ACM Style]

Seung-Chul Kim and Eun-Soo Kim. 2008. Fast Generation and Reconstruction of Digital Holograms Using a Novel Look-up Table. The Journal of Korean Institute of Communications and Information Sciences, 33, 3, (2008), 255-261. DOI: .

[KICS Style]

Seung-Chul Kim and Eun-Soo Kim, "Fast Generation and Reconstruction of Digital Holograms Using a Novel Look-up Table," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 3, pp. 255-261, 3. 2008.