Three-directional motion-compensation mask-based novel look-up table on graphics processing units for video-rate generation of digital holographic videos of three-dimensional scenes

Holographic display with optical computational Fresnel convolution to broaden distance

As a method of near-field diffraction in the condition of the paraxial approximation, the Fresnel convolution (FR-CV) method is widely used in hologram generation and other applications. However, it is applicable to near-field diffraction, and the quality of holographic reconstruction degrades seriously with the increase of diffraction distance. Moreover, its hologram generation speed is limited due to the use of three fast Fourier transforms in the convolution operation. Nevertheless, there are also many application scenarios that need longer distance diffraction. To achieve a holographic display in broadened distance with high generation speed and reconstruction quality, an optical computational Fresnel convolution method is proposed in this paper. Since an optical Fourier lens is used to perform optical calculations for Fourier transforms in our proposed method, the hologram generation speed of the proposed method is approximately 8 times faster than that of the FR-CV method. Moreover, the reconstructed image with our proposed method can be successfully and clearly displayed at both short and longer diffraction distance by changing focal lengths of the Fourier lens. The effectiveness and superiority of the proposed method have been validated by both numerical simulations and optical experiments.

Fast hologram generation method based on the optimal segmentation of a sub-CGH

In this paper, a fast hologram generation method is proposed based on the optimal segmentation of a sub-computer-generated-hologram (sub-CGH). The relationship between the pixels on the hologram and the corresponding reconstructed image is calculated firstly. Secondly, the sub-CGH corresponding to the object point from the recorded object is optimized and divided into the optimized diffraction area and the invalid diffraction area. Then, the optimized diffraction area of the sub-CGH for each object point is pre-calculated and saved. Finally, the final hologram can be generated by superimposing all the sub-CGHs. With the proposed method, the calculation time for the final hologram can be significantly reduced and the quality of the reconstructed image is not affected. Moreover, the proposed method has the advantages of perspective enlargement compared with the traditional method, and the experiment results verify its feasibility.

Faster generation of holographic videos of objects moving in space using a spherical hologram-based 3-D rotational motion compensation scheme

A spherical hologram-based three-dimensional rotational-motion compensation (SH-3DRMC) method is proposed for the accelerated generation of holographic videos of a three-dimensional (3-D) object moving in space along the arbitrary trajectory with many locally-different curvatures. All those 3-D rotational motions of the object made on each arc can be compensated just by rotating their local spherical holograms along the spherical surfaces matched with the object's moving trajectory using the estimated rotation-axes and angles, which enables a massive reduction of computational complexity of the conventional hologram-generation algorithm and results in an accelerated calculation of holographic videos. Experiments with a test video show that the average calculation times of the conventional NLUT, WRP and 1-D NLUT methods employing the proposed SH-3DRMC scheme have been noticeably reduced by 34.75%, 41.37% and 31.64%, respectively, in comparison with those of their original methods. These good experimental results confirm the feasibility of the proposed system.

Full-scale one-dimensional NLUT method for accelerated generation of holographic videos with the least memory capacity

A full-scale one-dimensional novel-look-up-table (1-D NLUT) method enabling faster generation of holographic videos with the minimum memory capacity is proposed. Only a pair of half-sized 1-D baseline and depth-compensating principal-fringe-patterns (PFPs) is pre-calculated and stored based on the concentric-symmetry property of the PFP, and from which a set of half-sized 1-D PFPs for all depth planes are generated based on its thin-lens property, which enables minimization of the required memory size down to a few KB regardless of the number of depth planes. Moreover, all those hologram calculations are fully one-dimensionally performed with a set of half-sized 1-D PFPs based on its shift invariance property, which also allows minimization of its overall hologram calculation time. From experiments with test videos, the proposed method has been found to have the shortest hologram calculation time even with the least memory in comparison with several modified versions of the conventional NLUT and LUT methods, which confirms its feasibility.

Accelerated generation of holographic videos of 3-D objects in rotational motion using a curved hologram-based rotational-motion compensation method

A new curved hologram-based rotational-motion compensation (CH-RMC) method is proposed for accelerated generation of holographic videos of 3-D objects moving on the random path with many locally different arcs. All of those rotational motions of the object made on each arc can be compensated, just by rotating their local curved holograms along the curving surfaces matched with the object's moving trajectory without any additional calculation process, which results in great enhancements of the computational speed of the conventional hologram-generation algorithms. Experiments with a test video scenario reveal that average numbers of calculated object points (ANCOPs) and average calculation times for one frame (ACTs) of the CH-RMC-based ray-tracing, wavefront-recording-plane and novel- look-up-table methods have been found to be reduced by 73.10%, 73.84%, 73.34%, and 68.75%, 50.82%, 66.59%, respectively, in comparison with those of their original methods. In addition, successful reconstructions of 3-D scenes from those holographic videos confirm the feasibility of the proposed system.

Fast generation of full analytical polygon-based computer-generated holograms

A fast calculation method to obtain the full-analytical frequency spectrum of a spatial triangle based on the three-dimensional (3D) affine transformation is presented. Computer-generated holograms (CGHs) of an object can then be generated rapidly using the angular spectrum for propagation. The derivation process in the theory, which has more preciseness, indicates a difference from previous methods based on affine transformations ([Appl. Opt.47, 1567 (2008)Appl. Opt.52, A290 (2013)]). The proposed method to achieve 3D transformation from an arbitrary triangle to a primitive triangle includes two steps: 3D rotation and 2D affine transformation. The overall transform matrix is given by the product of a rotation matrix and a 2D affine matrix. A modified back-face culling is also introduced based on exterior normal for correct occlusion relation. Several complex 3D objects are implemented successfully using the proposed method in numerical simulations and optical experiments. The resulting computation time demonstrates that the efficiency of the proposed method is enhanced as compared to that of previous works.

Fast two-step layer-based method for computer generated hologram using sub-sparse 2D fast Fourier transform

Fast two-step layer-based and sub-sparse two-dimensional Fast Fourier transform (SS-2DFFT) algorithms are proposed to speed up the calculation of computer-generated holograms. In a layer-based method, each layer image may contain large areas in which the pixel values are zero considering the occlusion effect among the different depth layers. By taking advantage of this feature, the two-step layer-based algorithm only calculates the non-zero image areas of each layer. In addition, the SS-2DFFT method implements two one-dimensional fast Fourier transforms (1DFFT) to compute a 2DFFT without calculating the rows or columns in which the image pixels are all zero. Since the size of the active calculation is reduced, the computational speed is considerably improved. Numerical simulations and optical experiments are performed to confirm these methods. The results show that the total computational time can be reduced by 5 times for a three-dimensional (3D) object of a train, 3.4 times for a 3D object of a castle and 10 times for a 3D object of a statue head when compared with a conventional layer-based method if combining the two proposed methods together.

High-speed computer-generated hologram based on resource optimization for block-based parallel processing

A huge amount of computation is required to generate a hologram using a computer. In order to speed up the computer-generated-hologram (CGH) operation, we use a parallel programming technique using a general purpose graphic processing unit (GPGPU). In this paper, we propose three techniques to improve CGH performance in the condition using GPU. The first is to remove the memory bottleneck by allocating shared memory and a dedicated thread for this process, and the second is to optimize the block allocation within the GPU using a hologram pixel-based method. The third is to increase the computation time by minimizing the idle region by using multiple threads of host processor and device. When these three techniques were implemented in the GTX 1080Ti GPU, it took 25.05 ms to generate the HD digital hologram with 10 K object points, and compared to the previous research, the performance improvement was at least 1.56 times up to 216.71 times.

Improved look-up table method of computer-generated holograms

Heavy computation load and vast memory requirements are major bottlenecks of computer-generated holograms (CGHs), which are promising and challenging in three-dimensional displays. To solve these problems, an improved look-up table (LUT) method suitable for arbitrarily sampled object points is proposed and implemented on a graphics processing unit (GPU) whose reconstructed object quality is consistent with that of the coherent ray-trace (CRT) method. The concept of distance factor is defined, and the distance factors are pre-computed off-line and stored in a look-up table. The results show that while reconstruction quality close to that of the CRT method is obtained, the on-line computation time is dramatically reduced compared with the LUT method on the GPU and the memory usage is lower than that of the novel-LUT considerably. Optical experiments are carried out to validate the effectiveness of the proposed method.