Several approaches for increasing the speed in computation of the digital holograms of three-dimensional objects have been presented with applications to real-time display of holographic images. Among them, a look-up table (LUT) approach, in which the precalculated principal fringe patterns for all possible image points of the object are provided, has gained a large speed increase in generation of computer-generated holograms. But the greatest drawback of this method is the enormous memory size of the LUT. A novel approach to dramatically reduce the size of the conventional LUT, still keeping its advantage of fast computational speed, is proposed, which is called here a novel LUT (N-LUT) method. A three-dimensional object can be treated as a set of image planes discretely sliced in the z direction, in which each image plane having a fixed depth is approximated as some collection of self-luminous object points of light. In the proposed method, only the fringe patterns of the center points on each image plane are precalculated, called principal fringe patterns (PFPs) and stored in the LUT. Then, the fringe patterns for other object points on each image plane can be obtained by simply shifting this precalculated PFP according to the displaced values from the center to those points and adding them together. Some experimental results reveal that the computational speed and the required memory size of the proposed approach are found to be 69.5 times faster than that of the ray-tracing method and 744 times smaller than that of the conventional LUT method, respectively.
© 2008 Optical Society of AmericaFull Article | PDF Article
Seung-Cheol Kim, Jung-Hoon Yoon, and Eun-Soo Kim
Appl. Opt. 47(32) 5986-5995 (2008)
Seung-Cheol Kim and Eun-Soo Kim
Appl. Opt. 48(6) 1030-1041 (2009)
Seung-Cheol Kim, Jae-Ho Kim, and Eun-Soo Kim
Appl. Opt. 50(19) 3375-3382 (2011)