Effective memory reduction of the novel look-up table with one-dimensional sub-principle fringe patterns in computer-generated holograms

Abstract

We propose a novel approach to massively reduce the memory of the novel look-up table (N-LUT) for computer-generated holograms by employing one-dimensional (1-D) sub-principle fringe patterns (sub-PFPs). Two-dimensional (2-D) PFPs used in the conventional N-LUT method are decomposed into a pair of 1-D sub-PFPs through a trigonometric relation. Then, these 1-D sub-PFPs are pre-calculated and stored in the proposed method, which results in a remarkable reduction of the memory of the N-LUT. Experimental results reveal that the memory capacity of the LUT, N-LUT and proposed methods have been calculated to be 149.01 TB, 2.29 GB and 1.51 MB, respectively for the 3-D object having image points of 500 × 500 × 256, which means the memory of the proposed method could be reduced by 103 × 10(6) fold and 1.55 × 10(3) fold compared to those of the conventional LUT and N-LUT methods, respectively.

3D Capture and 3D Contents Generation for Holographic Imaging

“…Unfortunately, this causes speckle noise at reconstruction [63]. A variety of methods have been proposed for fast synthesis of CGHs as look-up table methods with pre-computed fringes [63,64], recurrence relation methods instead of directly calculating the optical path [65], introduction of wavefront recording plane [66], HS methods and many others. Hardware solutions as special-purpose computers like 'Holographic ReconstructioN (HORN)' [67] or GPU computing [32,[68][69][70] are very effective for fast calculation because the pixels on a CGH can be calculated independently.…”

Recent progress in computer-generated holography for three-dimensional scenes

“…In Ref. [25], it is shown that the original 2D distribution of the spherical-wave pattern can be obtained by multiplying a pair of 1D distribution functions. Therefore, only two 1D distributions need to be stored instead of the full 2D distribution for each distance.…”

“…Apart from decomposition into a pair of 1D distributions [25] or the radial interpolation [26,27] mentioned earlier, the FFT-based method has also been proposed [33]. In this method, the spherical-wave pattern is divided into small rectangular sections, each of which is approximated by a linear-phase distribution, as shown in Figure 4.…”

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.…”

“…[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.…”