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

Generating Multi-Depth 3D Holograms Using a Fully Convolutional Neural Network

Efficiently generating 3D holograms is one of the most challenging research topics in the field of holography. This work introduces a method for generating multi-depth phase-only holograms using a fully convolutional neural network (FCN). The method primarily involves a forward-backward-diffraction framework to compute multi-depth diffraction fields, along with a layer-by-layer replacement method (L2RM) to handle occlusion relationships. The diffraction fields computed by the former are fed into the carefully designed FCN, which leverages its powerful non-linear fitting capability to generate multi-depth holograms of 3D scenes. The latter can smooth the boundaries of different layers in scene reconstruction by complementing information of occluded objects, thus enhancing the reconstruction quality of holograms. The proposed method can generate a multi-depth 3D hologram with a PSNR of 31.8 dB in just 90 ms for a resolution of 2160 × 3840 on the NVIDIA Tesla A100 40G tensor core GPU. Additionally, numerical and experimental results indicate that the generated holograms accurately reconstruct clear 3D scenes with correct occlusion relationships and provide excellent depth focusing.

Adaptive layer-based computer-generated holograms

We propose a novel, to the best of our knowledge, and fast adaptive layer-based (ALB) method for generating a computer-generated hologram (CGH) with accurate depth information. A complex three-dimensional (3D) object is adaptively divided into layers along the depth direction according to its own non-uniformly distributed depth coordinates, which reduces the depth error caused by the conventional layer-based method. Each adaptive layer generates a single-layer hologram using the angular spectrum method for diffraction, and the final hologram of a complex three-dimensional object is obtained by superimposing all the adaptive layer holograms. A hologram derived with the proposed method is referred to as an adaptive layer-based hologram (ALBH). Our demonstration shows that the desired reconstruction can be achieved with 52 adaptive layers in 8.7 s, whereas the conventional method requires 397 layers in 74.9 s.

Fast non-iterative algorithm for 3D point-cloud holography

Recently developed iterative and deep learning-based approaches to computer-generated holography (CGH) have been shown to achieve high-quality photorealistic 3D images with spatial light modulators. However, such approaches remain overly cumbersome for patterning sparse collections of target points across a photoresponsive volume in applications including biological microscopy and material processing. Specifically, in addition to requiring heavy computation that cannot accommodate real-time operation in mobile or hardware-light settings, existing sampling-dependent 3D CGH methods preclude the ability to place target points with arbitrary precision, limiting accessible depths to a handful of planes. Accordingly, we present a non-iterative point cloud holography algorithm that employs fast deterministic calculations in order to efficiently allocate patches of SLM pixels to different target points in the 3D volume and spread the patterning of all points across multiple time frames. Compared to a matched-performance implementation of the iterative Gerchberg-Saxton algorithm, our algorithm's relative computation speed advantage was found to increase with SLM pixel count, reaching >100,000x at 512 × 512 array format.

Fast Hologram Calculation Method Based on Wavefront Precise Diffraction

In this paper, a fast hologram calculation method based on wavefront precise diffraction is proposed. By analyzing the diffraction characteristics of the object point on the 3D object, the effective viewing area of the reproduced image is analyzed. Based on the effective viewing area, the effective hologram size of the object point is obtained, and then the accurate diffraction calculation from the object point to the wavefront recording plane (WRP) is performed. By calculating all the object points on the recorded object, the optimized WRP of the whole 3D object can be obtained. The final hologram is obtained by calculating the diffraction light field from the WRP to the holographic plane. Compared with the traditional method, the proposed method can improve the calculation speed by more than 55%, while the image quality of the holographic 3D display is not affected. The proposed calculation method provides an idea for fast calculation of holograms and is expected to contribute to the development of dynamic holographic displays.

Efficient rendering by parallelogram-approximation for full analytical polygon-based computer-generated holography using planar texture mapping

We have developed a full analytical method with texture mapping for polygon-based computer-generated holography. A parallel planar projection mapping for holographic rendering along with affine transformation and self-similar segmentation is derived. Based on this method, we further propose a parallelogram-approximation to reduce the number of polygons used in the polygon-based technique. We demonstrate that the overall method can reduce the computational effort by 50% as compared to an existing method without sacrificing the reconstruction quality based on high precision rendering of complex textures. Numerical and optical reconstructions have shown the effectiveness of the overall scheme.

Reducing the computational complexity of high-resolution hologram calculations using polynomial approximation

In this paper, we have proposed a hologram calculation method using polynomial approximations for reducing the computational complexity of point-cloud-based hologram calculations. The computational complexity of existing point-cloud-based hologram calculations is proportional to the product of the number of point light sources and hologram resolution, whereas that of the proposed method can be reduced to approximately proportional to the sum of the number of point light sources and hologram resolution by approximating the object wave with polynomials. The computation time and reconstructed image quality were compared with those of the existing methods. The proposed method was approximately 10 times faster than the conventional acceleration method, and did not produce significant errors when the object was far from the hologram.

Fast shadow casting algorithm in analytical polygon-based computer-generated holography

Shadow casting is essential in computer graphics, which can significantly enhance the reality of rendered images. However, shadow casting is rarely studied in polygon-based computer-generated holography (CGH) because state-of-art triangle-based occlusion handling methods are too complicated for shadow casting and unfeasible for complex mutual occlusion handling. We proposed a novel drawing method based on the analytical polygon-based CGH framework and achieved Z-buffer-based occlusion handling instead of the traditional Painter's algorithm. We also achieved shadow casting for parallel and point light sources. Our framework can be generalized to N-edge polygon (N-gon) rendering and accelerated using CUDA hardware, by which the rendering speed can be significantly enhanced.

Deep hologram converter from low-precision to middle-precision holograms

We propose a deep hologram converter based on deep learning to convert low-precision holograms into middle-precision holograms. The low-precision holograms were calculated using a shorter bit width. It can increase the amount of data packing for single instruction/multiple data in the software approach and the number of calculation circuits in the hardware approach. One small and one large deep neural network (DNN) are investigated. The large DNN exhibited better image quality, whereas the smaller DNN exhibited a faster inference time. Although the study demonstrated the effectiveness of point-cloud hologram calculations, this scheme could be extended to various other hologram calculation algorithms.

Wavefront recording plane-like method for polygon-based holograms

The wavefront recording plane (WRP) method is an algorithm for computer-generated holograms, which has significantly promoted the accelerated computation of point-based holograms. Similarly, in this paper, we propose a WRP-like method for polygon-based holograms. A WRP is placed near the object, and the diffracted fields of all polygons are aggregated in the WRP so that the fields propagating from the polygonal mesh affect only a small region of the plane rather than the full region. Unlike the conventional WRP method used in point-based holograms, the proposed WRP-like method utilizes sparse sampling in the frequency domain to significantly reduce the practical computational kernel size. The proposed WRP-like method and the analytical shading model are used to generate polygon-based holograms of multiple three-dimensional (3D) objects, which are then reproduced to confirm 3D perception. The results indicate that the proposed WRP-like method based on an analytical algorithm is hundreds of times faster than the reference full region sampling case; a hologram with tens of thousands of triangles can be computed in seconds even on a CPU, whereas previous methods required a graphics processing unit to achieve these speeds.

Review of computer-generated hologram algorithms for color dynamic holographic three-dimensional display

Holographic three-dimensional display is an important display technique because it can provide all depth information of a real or virtual scene without any special eyewear. In recent years, with the development of computer and optoelectronic technology, computer-generated holograms have attracted extensive attention and developed as the most promising method to realize holographic display. However, some bottlenecks still restrict the development of computer-generated holograms, such as heavy computation burden, low image quality, and the complicated system of color holographic display. To overcome these problems, numerous algorithms have been investigated with the aim of color dynamic holographic three-dimensional display. In this review, we will explain the essence of various computer-generated hologram algorithms and provide some insights for future research.

Fast 3D Analytical Affine Transformation for Polygon-Based Computer-Generated Holograms

We present a fast 3D analytical affine transformation (F3DAAT) method to obtain polygon-based computer-generated holograms (CGHs). CGHs consisting of tens of thousands of triangles from 3D objects are obtained by this method. We have attempted a revised method based on previous 3D affine transformation methods. In order to improve computational efficiency, we have derived and analyzed our proposed affine transformation matrix. We show that we have further increased the computational efficiency compared with previous affine methods. We also have added flat shading to improve the reconstructed image quality. A 3D object from a 3D camera is reconstructed holographically by numerical and optical experiments.

Wide-viewing holographic stereogram based on self-interference incoherent digital holography

We propose a holographic stereogram synthesis method which uses holograms that are optically captured by self-interference incoherent digital holography (SIDH) based on a geometric phase lens. SIDH is a promising solution for hologram acquisition under low-coherence lighting condition. A mechanical scanning system is constructed to acquire multiple perspective holograms. Numerical simulations and experimental analyses conducted using high-resolution diffractive optical element demonstrate that the proposed method can produce a wide-viewing hologram which can realize realistic 3D scenarios with depth cues such as accommodation and motion parallax. The future objectives include the implementation of a multiple-camera system for holographic videos.

Polygon-based computer-generated holography: a review of fundamentals and recent progress [Invited]

In this review paper, we first provide comprehensive tutorials on two classical methods of polygon-based computer-generated holography: the traditional method (also called the fast-Fourier-transform-based method) and the analytical method. Indeed, other modern polygon-based methods build on the idea of the two methods. We will then present some selective methods with recent developments and progress and compare their computational reconstructions in terms of calculation speed and image quality, among other things. Finally, we discuss and propose a fast analytical method called the fast 3D affine transformation method, and based on the method, we present a numerical reconstruction of a computer-generated hologram (CGH) of a 3D surface consisting of 49,272 processed polygons of the face of a real person without the use of graphic processing units; to the best of our knowledge, this represents a state-of-the-art numerical result in polygon-based computed-generated holography. Finally, we also show optical reconstructions of such a CGH and another CGH of the Stanford bunny of 59,996 polygons with 31,724 processed polygons after back-face culling. We hope that this paper will bring out some of the essence of polygon-based computer-generated holography and provide some insights for future research.

Acceleration of polygon-based computer-generated holograms using look-up tables and reduction of the table size via principal component analysis

In this study, we first analyze the fully analytical frequency spectrum solving method based on three-dimensional affine transform. Thus, we establish a new method for combining look-up tables (LUTs) with polygon holography. The proposed method was implemented and proved to be accelerated about twice compared to the existing methods. In addition, principal component analysis was used to compress the LUTs, effectively reducing the required memory without artifacts. Finally, we calculated very complex objects on a graphics processing unit using the proposed method, and the calculation speed was higher than that of existing polygon-based methods.

Hologram computation using the radial point spread function

Holograms are computed by superimposing point spread functions (PSFs), which represent the distribution of light on the hologram plane. The computational cost and the spatial bandwidth product required to generate holograms are significant; therefore, it is challenging to compute high-resolution holograms at the rates required for videos. Among the possible displays, fixed-eye-position holographic displays, such as holographic head-mounted displays, reduce the spatial bandwidth product by fixing eye positions while satisfying almost all human depth cues. In eye-fixed holograms, by calculating a part distribution of the entire PSF, we observe reconstructed images that maintain the image quality and the depth of focus almost as high as those generated by the entire PSF. In this study, we accelerate the calculation of eye-fixed holograms by engineering the PSFs. We propose cross and radial PSFs, and we determine that, out of the two, the radial PSFs have a better image quality. By combining the look-up table method and the wavefront-recording plane method with radial PSFs, we show that the proposed method can rapidly compute holograms.

Laser-Material Interactions of High-Quality Ultrashort Pulsed Vector Vortex Beams

Diffractive multi-beams based on 1 × 5 and 2 × 2 binary Dammann gratings applied to a spatial light modulator (SLM) combined with a nanostructured S-wave plate have been used to generate uniform multiple cylindrical vector beams with radial and azimuthal polarizations. The vector quality factor (concurrence) of the single vector vortex beam was found to be C = 0.95 ± 0.02, hence showing a high degree of vector purity. The multi-beams have been used to ablate polished metal samples (Ti-6Al-4V) with laser-induced periodic surface structures (LIPSS), which confirm the polarization states unambiguously. The measured ablation thresholds of the ring mode radial and azimuthal polarizations are close to those of a Gaussian mode when allowance is made for the expected absolute intensity distribution of a ring beam generated from a Gaussian. In addition, ring mode vortex beams with varying orbital angular momentum (OAM) exhibit the same ablation threshold on titanium alloy. Beam scanning with ring modes for surface LIPSS formation can increase micro-structuring throughput by optimizing fluence over a larger effective beam diameter. The comparison of each machined spot was analysed with a machine learning method—cosine similarity—which confirmed the degree of spatial uniformity achieved, reaching cosθ > 0.96 and 0.92 for the 1 × 5 and 2 × 2 arrays, respectively. Scanning electron microscopy (SEM), optical microscopy and white light surface profiling were used to characterize and quantify the effects of surface modification.

Fast calculation of high-definition depth-added computer-generated holographic stereogram by spectrum-domain look-up table [Invited]

High-definition depth-added computer-generated holographic stereogram (DA-CGHS) is superior in its high quality, easy realization, and auto-shading effect. However, its computing cost is extremely high because numerous scenes together with depth information must be calculated. Here, we proposed a fast calculation scheme of DA-CGHS by the spectrum-domain look-up table (SDLUT) method. In SDLUT, diffraction fields on the hogel plane of selected reference points in the object space are calculated. Subsequently, the fields are Fourier transformed to the spectrum domain. Because the signal energy always concentrates in a small spectrum region, these regions are cropped as the elemental tables. In the computing of the hogels, the field superposition is conducted in the spectrum domain by using the elemental tables. In our demonstration, the table size of SDLUT is only 0.44% that of the look-up table (LUT). Because the table size is very small, the computing time of SDLUT method can be nearly 80 times faster than that of conventional LUTs in the spatial domain, while the image quality is comparable.

An interactive holographic projection system that uses a hand-drawn interface with a consumer CPU

Holography is a promising technology for photo-realistic three-dimensional (3D) displays because of its ability to replay the light reflected from an object using a spatial light modulator (SLM). However, the enormous computational requirements for calculating computer-generated holograms (CGHs)—which are displayed on an SLM as a diffraction pattern—are a significant problem for practical uses (e.g., for interactive 3D displays for remote navigation systems). Here, we demonstrate an interactive 3D display system using electro-holography that can operate with a consumer’s CPU. The proposed system integrates an efficient and fast CGH computation algorithm for line-drawn 3D objects with inter-frame differencing, so that the trajectory of a line-drawn object that is handwritten on a drawing tablet can be played back interactively using only the CPU. In this system, we used an SLM with 1,920 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document}× 1,080 pixels and a pixel pitch of 8 μm × 8 μm, a drawing tablet as an interface, and an Intel Core i9–9900K 3.60 GHz CPU. Numerical and optical experiments using a dataset of handwritten inputs show that the proposed system is capable of reproducing handwritten 3D images in real time with sufficient interactivity and image quality.

Fast calculation of computer-generated hologram of line-drawn objects without FFT

Although holographic display technology is one of the most promising three-dimensional (3D) display technologies for virtual and augmented reality, the enormous computational effort required to produce computer-generated holograms (CGHs) to digitally record and display 3D images presents a significant roadblock to the implementation of this technology. One of the most effective methods to implement fast CGH calculations is a diffraction calculation (e.g., angular spectrum diffraction) based on the fast-Fourier transform (FFT). Unfortunately, the computational complexity increases with increasing CGH resolution, which is what determines the size of a 3D image. Therefore, enormous calculations are still required to display a reasonably sized 3D image, even for a simple 3D image. To address this issue, we propose herein a fast CGH algorithm for 3D objects comprised of line-drawn objects at layers of different depths. An aperture formed from a continuous line at a single depth can be regarded as a series of aligned point sources of light, and the wavefront converges for a sufficiently long line. Thus, a CGH of a line-drawn object can be calculated by synthesizing converged wavefronts along the line. Numerical experiments indicate that, compared with the FFT-based method, the proposed method offers a factor-56 gain in speed for calculating 16-k-resolution CGHs from 3D objects composed of twelve line-drawn objects at different depths.

Enhancing the Quality of Sampled Phase-Only Hologram (SPOH) Based on Time-Division Comb Filtering

Generation of digital phase-only Fresnel holograms is an important research area in digital holography, as it leads to a substantial simplification of a holographic display system. However, the quality of the reconstructed image of a hologram without the magnitude component is heavily degraded. The problem can be reduced by down-sampling the intensity of an image prior to generating the hologram. The method, referred to as “sampled phase-only hologram” (SPOH) generation, results in reconstructed images that are masked with the pattern of the down-sampling lattice. This paper reports a novel, low complexity method to alleviate this problem through the concept of comb filtering. Results reveal prominent enhancement on the reconstructed image of a SPOH.

Full-color computer-generated holographic near-eye display based on white light illumination

We propose a full color computer generated holographic near-eye display (NED) based on white light illumination. The method inspired from color rainbow holography is used for calculation of 2D and 3D color holograms. The parameters of the color hologram calculation are designed based on the parameters of the spatial light modulator (SLM) with 4K resolution. A slit type spatial filter is designed in frequency domain to extract red, green and blue frequency components for full color display. A NED system including a white light source, an achromatic collimating lens, a 4K SLM, a 4f optical filtering system, and an achromatic lens as eyepiece is designed and developed. The main contribution of this paper is the first time to apply the rainbow holography concept to the dynamic full color NED with a compact display system. The optical experiments prove the feasibility of the proposed method.

Dual-view holographic three-dimensional display using a single spatial light modulator and a directional light-guide plate composed of pixelated gratings

In this paper, a dual-view holographic three-dimensional (3D) display using a single spatial light modulator (SLM) and a directional light-guide plate (DLGP) is proposed and implemented. The SLM is used to load the phase-only hologram calculated from two different 3D scenes for optical holographic reconstruction, and the DLGP composed of pixelated gratings with different periods and orientation angles is employed to guide the reconstructed images into two completely separated viewing zones, where different reconstructed perspectives in each viewing zone will form a stereoscopic 3D image. Furthermore, an experimental verification system for the proposed dual-view holographic 3D display is constructed, and the experimental results demonstrate that the proposed system can successfully present different 3D images in the left and right viewing zones simultaneously, verifying the feasibility of the proposed dual-view holographic 3D display.

Three-dimensional computer-generated hologram with Fourier domain segmentation

We propose an efficient algorithm for calculating photorealistic three-dimensional (3D) computer-generated hologram with Fourier domain segmentation. The segmentation of the spatial frequency processes the depth information from multiple parallel projections, recombining the wave fields of different viewing directions in the Fourier domain. Segmented angular spectrum with layer based processing is introduced to calculate the partitioned elements, which effectively extends the limited region of conventional angular spectrum. The algorithm can provide accurate depth cues and is compatible with computer graphics rendering techniques to provide quality view-dependent properties. Experiments demonstrate the proposed method can reconstruct photorealistic 3D images with accurate depth information.