Fast generation of three-dimensional video holograms by combined use of data compression and lookup table techniques

Abstract

Even though there are many types of methods to generate CGH (computer-generated hologram) patterns of three-dimensional (3D) objects, most of them have been applied to still images but not to video images due to their computational complexity in applications of 3D video holograms. A new method for fast computation of CGH patterns for 3D video images is proposed by combined use of data compression and lookup table techniques. Temporally redundant data of the 3D video images are removed with the differential pulse code modulation (DPCM) algorithm, and then the CGH patterns for these compressed videos are generated with the novel lookup table (N-LUT) technique. To confirm the feasibility of the proposed method, some experiments with test 3D videos are carried out, and the results are comparatively discussed with the conventional methods in terms of the number of object points and computation time.

A review on several methods for fast generation of digital Fresnel holograms

“…As reported in the article, these two processes can be conducted swiftly with the multiple core CPU and the GPU, and capable of generating a 2048x2048 hologram, representing 4 10 object points at 10 frames per second.…”

Graphics processing unit-based implementation of a one-dimensional novel-look-up-table for real-time computation of Fresnel hologram patterns of three-dimensional objects

“…[1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] One of them is the look-up-table (LUT) method. 1 In this method, a significant increase of the computational speed has been obtained by precalculating all fringe patterns corresponding to point-source contributions from each of the possible locations in the object volume, which are called elemental fringe patterns (EFPs), and by storing them in the LUT.…”

“…Therefore, several attempts to reduce the memory capacity or to accelerate the computation time of the N-LUT have been made for its practical application. [3][4][5][6][7][8] For further reduction of the memory, a new type of N-LUT based on one-dimensional (1-D) sub-PFPs decomposed from the conventional 2-D PFPs, which is called here 1-D N-LUT, has been proposed. 3 In this 1-D N-LUT method, the GB memory of the conventional 2-D PFPs-based N-LUT, which is called here 2-D N-LUT, could be dropped down to the order of megabyte (MB) memory.…”

“…3 In addition, for further reduction of the computational time of the N-LUT, several software and hardware methods have been proposed. [4][5][6][7][8] That is, in those software approaches, including the spatial redundancy-based N-LUT, 4 line redundancy-based N-LUT, 5 block redundancy-based N-LUT, 6 as well as the temporal redundancy-based N-LUT, 7 3-D object data to be calculated have been effectively reduced by removing the spatial or temporal redundancy of the 3-D objects by using various image compression algorithms.…”

Efficient generation of computer‐generated hologram patterns using spatially redundant data on a 3d object and the novel look‐up table method

“…Recently, a novel look-up table (N-LUT) method that dramatically reduces the number of pre-calculated interference patterns required to generate digital holograms was proposed [9][10]. In this method, a 3D object image is approximated as a set of discretely sliced image planes with different depths, and only the fringe pattern of the center object point on each image plane, called the principal fringe pattern (PFP), is pre-calculated and stored in the N-LUT so that the size of the N-LUT can be significantly reduced from that in the conventional LUT method.…”