Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Hologram generation via Hilbert transform

Open Access Open Access

Abstract

We propose an indirect method for generating a complex hologram and phase-only hologram from an amplitude hologram using the Hilbert transform. The Hilbert transform generates an imaginary part of complex amplitude from only an amplitude hologram, resulting in the reduction of the total computational complexity of complex and phase-only holograms. More importantly, the proposed method can reduce the hardware resources of dedicated hologram processors.

© 2020 Optical Society of America under the terms of the OSA Open Access Publishing Agreement

1. Introduction

Digital holograms are generated using a computer [13], and their application includes holographic three-dimensional (3D) displays [4,5], projections [6,7], beam generation [8], and holographic optical elements [9]. Digital holograms are primarily categorized into amplitude holograms, phase-only holograms, and complex holograms [3]. A complex hologram includes the amplitude and phase part of a light wave, thus rendering the reconstructed light wave ideal. A complex hologram can be generally expressed as follows:

$$u_c = \sum_j^{N} a_j \exp(i \theta_j),$$
where $N$ is the total number of object points, and $a_j$ and $\theta _j$ are the amplitude and phase of $j$th object light on the hologram plane, respectively. However, a complex hologram cannot be displayed on a spatial light modulator (SLM) because current commercial SLMs modulate only amplitude or phase of light. Phase-only holograms are generated by taking only the phase part of complex holograms, and they can be displayed using a commercial SLM. A phase-only hologram can be expressed as follows:
$$u_p = \tan^{-1} \left( {\operatorname{Im}}\{{u_c}\} / {\operatorname{Re}}\{{u_c}\} \right),$$
where ${\operatorname {Re}}\{{\cdot }\}$ and ${\operatorname {Im}}\{{\cdot }\}$ denote the operators adopting real and imaginary parts of a complex amplitude. To obtain phase-only holograms, we typically need to calculate Eq. (1) and then convert it to a phase-only hologram using Eq. (2). In contrast, an amplitude hologram is simply calculated as follows:
$$u_a = \sum_j^{N} a_j \cos(\theta_j).$$
Eqs. (1) and (2) include cosine and sine functions, whereas Eq. (3) for an amplitude hologram includes only a cosine function; therefore, the computational complexity of Eq. (3) will be lower than that required for complex and phase-only holograms.

In this study, we propose an indirect method for generating a complex hologram and phase-only hologram from an amplitude hologram using the Hilbert transform [10]. The Hilbert transform requires low computational complexity, and generates a complex hologram from only an amplitude hologram. The total computational complexity of the proposed method will be small compared with that of complex and phase-only holograms. More importantly, as will be discussed later, the proposed method can reduce the hardware resources of dedicated hologram computers [3].

2. Proposed method

The Hilbert transform is widely used in signal processing and communication theory. In optical measurement, quantitative phase imaging [11] and optical coherence tomography [12] are both able to employ the transform. However, to our knowledge, the transform has to date not been employed to accelerate hologram generation or to reduce the hardware resources needed for dedicated hologram computers. The Hilbert transform [10] is defined as follows:

$$\hat{h}(x)=\mathbb{H} \left[{h(x)} \right]= \frac{1}{\pi} \int_{-\infty}^{+\infty} \frac{h(\tau)}{x-\tau} d\tau,$$
where $\mathbb {H} \left [{\cdot } \right ]$ denotes the operator of the Hilbert transform, $h(x)$ is the real function, and the integral requires $x > 0$, and $\hat {h}$ is the analytical function. This integral is convoluted; therefore, the integral in the numerical calculation is rewritten by using the one-dimensional (1-D) fast Fourier transform (FFT) as follows:
$$\hat{h}(x)=\textrm{FFT}^{-1} \left[{ \textrm{FFT} \left[{h(x)} \right] H(f) } \right],$$
where $\textrm {FFT} \left [{\cdot } \right ]$ and $\textrm {FFT}^{-1} \left [{\cdot } \right ]$ denote forward and inverse 1-D FFT, respectively, and $H(f)$ is the transfer function [13] of the Hilbert transform defined as
$$H(f) = \begin{cases} 1 & (f = 0)\\ 1/2 & (f<W)\\ 0 & (otherwise) \end{cases}$$
where the signal size of $h(x)$ is $W$. Note that in this study, we required $2W$-sized zero-padding of $h(x)$ during calculation to avoid circular convolution.

As an example, we illustrate the proposed method in the case of complex hologram generation using an amplitude hologram generated from point cloud data using the Hilbert transform. Using Eq. (3), we calculated an amplitude hologram from a point cloud as follows:

$$u_a(x_h,y_h) = \sum_j^{N} a_j \cos \left(\frac{(x_h-x_j)^{2}+(y_h-y_j)^{2}}{\lambda z_j} \right),$$
where $(x_h,y_h)$ and $(x_j,y_j,z_j)$ are the coordinates of the hologram plane and point cloud, respectively. As shown in Fig. 1, a point cloud must always set an off-axis configuration ($x_j<x_h$) because the Hilbert transform requires $x_h-x_j > 0$.

 figure: Fig. 1.

Fig. 1. Hologram generation.

Download Full Size | PDF

We then generated a complex hologram from an amplitude hologram using Eq. (7) and the Hilbert transform via the following steps.

  • (1) We expanded the resolution of $u_a$ with $N_x \times N_y$ pixels to $2 N_x \times N_y$ by horizontal zero padding, and then extracted the first row.
  • (2) The Hilbert transform converted the $j$th row of the amplitude hologram into that of a complex hologram; that is, we calculated $u_c(x_h, j)=\mathbb {H} \left [{u_a(x_h,j)} \right ]$.
  • (3) We updated $j$ as $j\leftarrow j+1.$
  • (4) We repeated the steps 2 and 3 up to and including the final row.
  • (5) We obtained the final complex hologram by cropping the result of the Hilbert transform to $N_x \times N_y$ pixels.
If we want a phase-only hologram, we simply apply Eq. (2) to a complex hologram calculated by the proposed method. At a first glance, the proposed method appeared to increase the computational cost compared with Eq. (1). However, the total computational cost of the proposed method was lower compared with Eq. (1) because the computational complexity of the Hilbert transform was only $O(N_y \times N_x \log N_x)$. It is worth mentioning that 2-D Fourier transform requires $O(N_x N_y \log N_x N_y)$, so the Hilbert transform can perform two times faster than the 2-D Fourier transform.

3. Results and discussion

Figures 2 and 3 show numerically reconstructed images from complex holograms generated using Eq. (1), amplitude holograms using Eq. (3), and complex holograms obtained from amplitude holograms using the proposed method. The insets are the enlarged images of the reconstructed object lights. The calculation conditions used were as follows: the wavelength was 633nm, the pixel pitch of the hologram was 10$\mu$m, the distance between the holograms and point cloud was 0.8m, and the resolution of the holograms was $2,048 \times 2,048$ pixels. The centroid of object points was placed at (-15.4mm, 0.0mm, 0.8mm), and the size of the point cloud was approximately 2cm $\times$ 2cm $\times$ 2 cm.

 figure: Fig. 2.

Fig. 2. Reconstructed images from the complex hologram, amplitude hologram, and the proposed method.

Download Full Size | PDF

 figure: Fig. 3.

Fig. 3. Reconstructed images from the complex hologram, amplitude hologram, and the proposed method.

Download Full Size | PDF

In Figs. 2 and 3, the reconstructed images from the complex holograms of Eq. (1) and the proposed method include only object light without conjugate lights. In contrast, the reconstructed images of the amplitude holograms include conjugate lights in principle.

We evaluated the image quality using the peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). The reference image for PSNR and SSIM was the reconstructed images generated by Eq. (1). In Fig. 2, the PSNR and SSIM of the amplitude hologram are 28.5 dB and 0.594, whereas those of the proposed method are 47.7 dB and 0.998, respectively. In Fig. 3, the PSNR and SSIM of the amplitude hologram are 24.9 dB and 0.463, whereas those of the proposed method are 39.4 dB and 0.998, respectively. The proposed method was able to obtain almost the same image quality as the complex holograms of Eq. (1).

We measured the calculation times of Eq. (1) and the proposed method. This was done using a computer with an AMD Ryzen5 3600X CPU with 64GB memory, and Visual C++ 2015 as a compiler. We used eight CPU threads. In Fig. 2, the calculation times for Eq. (1) and the proposed method were 24 and 15 s, respectively. The number of object points was 11,646. The calculation time of the Hilbert transform was only 83 ms. The proposed method calculated approximately 1.6 times faster than Eq. 1. In Fig. 3, the calculation times of Eq. (1) and the proposed method were 93 and 59 s, respectively. The number of object points was 44,647. The proposed method calculated approximately 1.6 times faster than Eq. (1). All the calculations in this study were performed by using our wave optics library [14].

Figure 4 shows the optical reconstructions of a phase-only hologram obtained using Eq. (1) and the proposed method. A phase-modulated type SLM was used in this study (HoloEye PLUTO-2). Similar to the numerical reconstructions, the image quality for Eq. (1) and the proposed method was essentially almost the same.

 figure: Fig. 4.

Fig. 4. Optical reconstructions.

Download Full Size | PDF

The proposed method indicated not only has a calculation speed advantage but also has efficient implementation with dedicated computers. We developed dedicated hologram computers, referred to as “HOlographic ReconstructioN (HORN)” [15,16]. A HORN computer for phase-only holograms includes a large number of “complex amplitude units” (CAUs), which include cosine and sine circuits and the two product-sum circuits. Accordingly, by operating a large number of CAUs in parallel, the HORN computer can calculate Eq. (1) rapidly. The proposed method anticipates increasing the number of CAUs because it can generate phase-only holograms from amplitude holograms; the CAUs of which require only a cosine circuit and one product-sum circuit. Current HORN computers have been implemented on field-programmable gate arrays (FPGAs); current FPGAs have a logic block, which is used for user logic circuits, and have embedded CPUs. Since the computational complexity of the Hilbert transform is low, the embedded CPU will simultaneously perform the Hilbert transform while the logic block performs hologram calculations. This will result in further efficient generation of phase-only holograms compared with current HORN computers.

4. Conclusion

In this paper, we proposed the Hilbert transform-based hologram generation. The proposed method was able to calculate complex holograms and phase-only holograms from amplitude holograms. The total computational complexity of the proposed method was reduced compared with the direct calculation of Eqs. (1) and (2). Moreover, we discussed the efficient implementation of phase-only holograms into dedicated hologram processors. In future work, we will implement the proposed method for FPGAs.

Funding

Japan Society for the Promotion of Science (19H01097, 19H04132).

Disclosures

The authors declare no conflicts of interest.

References

1. P. W. M. Tsang and T.-C. Poon, “Review on the state-of-the-art technologies for acquisition and display of digital holograms,” IEEE Trans. Ind. Inf. 12(3), 886–901 (2016). [CrossRef]  

2. D. Blinder, A. Ahar, S. Bettens, T. Birnbaum, A. Symeonidou, H. Ottevaere, C. Schretter, and P. Schelkens, “Signal processing challenges for digital holographic video display systems,” Signal Process. Image Commun. 70, 114–130 (2019). [CrossRef]  

3. T. Shimobaba and T. Ito, Computer Holography: Acceleration Algorithms and Hardware Implementations (CRC press, 2019).

4. F. Yaraş, H. Kang, and L. Onural, “State of the art in holographic displays: a survey,” J. Disp. Technol. 6(10), 443–454 (2010). [CrossRef]  

5. T. Inoue and Y. Takaki, “Table screen 360-degree holographic display using circular viewing-zone scanning,” Opt. Express 23(5), 6533–6542 (2015). [CrossRef]  

6. T. Shimobaba, T. Kakue, and T. Ito, “Real-time and low speckle holographic projection,” in 2015 IEEE 13th International Conference on Industrial Informatics (INDIN), (IEEE, 2015), pp. 732–741.

7. M. Makowski, I. Ducin, K. Kakarenko, J. Suszek, M. Sypek, and A. Kolodziejczyk, “Simple holographic projection in color,” Opt. Express 20(22), 25130–25136 (2012). [CrossRef]  

8. T. W. Clark, R. F. Offer, S. Franke-Arnold, A. S. Arnold, and N. Radwell, “Comparison of beam generation techniques using a phase only spatial light modulator,” Opt. Express 24(6), 6249–6264 (2016). [CrossRef]  

9. B. J. Jackin, L. Jorissen, R. Oi, J. Y. Wu, K. Wakunami, M. Okui, Y. Ichihashi, P. Bekaert, Y. P. Huang, and K. Yamamoto, “Digitally designed holographic optical element for light field displays,” Opt. Lett. 43(15), 3738–3741 (2018). [CrossRef]  

10. G. T. Nehmetallah, R. Aylo, and L. Williams, “Analog and digital holography with matlab,” (Society of Photo-Optical Instrumentation Engineers (SPIE), 2015).

11. T. Ikeda, G. Popescu, R. R. Dasari, and M. S. Feld, “Hilbert phase microscopy for investigating fast dynamics in transparent systems,” Opt. Lett. 30(10), 1165–1167 (2005). [CrossRef]  

12. Y. Watanabe and M. Sato, “Quasi-single shot axial-lateral parallel time domain optical coherence tomography with hilbert transformation,” Opt. Express 16(2), 524–534 (2008). [CrossRef]  

13. J. V. Lorenzo-Ginori, “An approach to the 2d hilbert transform for image processing applications,” in International Conference Image Analysis and Recognition (Springer, 2007), pp. 157–165.

14. T. Shimobaba, J. Weng, T. Sakurai, N. Okada, T. Nishitsuji, N. Takada, A. Shiraki, N. Masuda, and T. Ito, “Computational wave optics library for C++: CWO++ library,” Comput. Phys. Commun. 183(5), 1124–1138 (2012). [CrossRef]  

15. T. Sugie, T. Akamatsu, T. Nishitsuji, R. Hirayama, N. Masuda, H. Nakayama, Y. Ichihashi, A. Shiraki, M. Oikawa, N. Takada, Y. Endo, T. Kakue, T. Shimobaba, and T. Ito, “High-performance parallel computing for next-generation holographic imaging,” Nat. Electron. 1(4), 254–259 (2018). [CrossRef]  

16. T. Nishitsuji, Y. Yamamoto, T. Sugie, T. Akamatsu, R. Hirayama, H. Nakayama, T. Kakue, T. Shimobaba, and T. Ito, “Special-purpose computer HORN-8 for phase-type electro-holography,” Opt. Express 26(20), 26722–26733 (2018). [CrossRef]  

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (4)

Fig. 1.
Fig. 1. Hologram generation.
Fig. 2.
Fig. 2. Reconstructed images from the complex hologram, amplitude hologram, and the proposed method.
Fig. 3.
Fig. 3. Reconstructed images from the complex hologram, amplitude hologram, and the proposed method.
Fig. 4.
Fig. 4. Optical reconstructions.

Equations (7)

Equations on this page are rendered with MathJax. Learn more.

u c = j N a j exp ( i θ j ) ,
u p = tan 1 ( Im { u c } / Re { u c } ) ,
u a = j N a j cos ( θ j ) .
h ^ ( x ) = H [ h ( x ) ] = 1 π + h ( τ ) x τ d τ ,
h ^ ( x ) = FFT 1 [ FFT [ h ( x ) ] H ( f ) ] ,
H ( f ) = { 1 ( f = 0 ) 1 / 2 ( f < W ) 0 ( o t h e r w i s e )
u a ( x h , y h ) = j N a j cos ( ( x h x j ) 2 + ( y h y j ) 2 λ z j ) ,
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.