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

Hexagonal diffractive optical elements

Open Access Open Access

Abstract

Diffractive optical elements (DOEs) have widespread applications in optics, ranging from point spread function engineering to holographic display. Conventionally, DOE design relies on Cartesian simulation grids, resulting in square features in the final design. Unfortunately, Cartesian grids provide an anisotropic sampling of the plane, and the resulting square features can be challenging to fabricate with high fidelity using methods such as photolithography. To address these limitations, we explore the use of hexagonal grids as a new grid structure for DOE design and fabrication. In this study, we demonstrate wave propagation simulation using an efficient hexagonal coordinate system and compare simulation accuracy with the standard Cartesian sampling scheme. Additionally, we have implemented algorithms for the inverse DOE design. The resulting hexagonal DOEs, encoded with wavefront information for holograms, are fabricated and experimentally compared to their Cartesian counterparts. Our findings indicate that employing hexagonal grids enhances holographic imaging quality. The exploration of new grid structures holds significant potential for advancing optical technology across various domains, including imaging, microscopy, photography, lighting, and virtual reality.

© 2023 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

1. Introduction

Diffractive optical elements (DOEs) are versatile optical components that enable applications such as point spread function (PSF) engineering [13], end-to-end design of computational imaging systems [46], and holography [7,8]. Typically, DOEs are designed on Cartesian grids using iterative methods such as the Gerchberg-Saxton (GS) algorithm [9,10]. In this context, the Cartesian grid enables fast light propagation simulations using Fourier-based operators, such as Fresnel propagation [11].

Unfortunately, Cartesian grids have several practical disadvantages. First, they exhibit a high degree of anisotropy in the plane, with diagonal frequencies represented more poorly than axially aligned frequencies [12,13]. For this reason, deformable mirrors and other phase modulators intended for adaptive optics often opt for a hexagonal packing of the actuators. Due to its six-fold symmetry, this hexagonal arrangement exhibits better isotropy [14].

In recent years, hexagonal pixel arrangements have shown potential for achieving better resolution and efficiency in fields such as image processing and computer graphics [1416]. In the field of sensing techniques, hexagonal sampling gives wider spectra than rectangular with the same pixel density [12]. Thanks to its six-fold symmetry, the hexagonal lattice offers more isotropy in representing complex elements than Cartesian grids.

Another disadvantage of using Cartesian grids for DOE design is that they yield square-shaped features, placing a significant burden on the accuracy of the fabrication process. For instance, when using photolithography, it is common to experience some corner rounding on the features [17], leading to deviations between the fabricated DOE and its intended design. Moreover, in Cartesian grids, features may touch on a corner, which results in topological changes during fabrication, particularly when using equipment with limited resolution capabilities. As an example, Fig. 1 shows the pattern produced by a mask writer (Heidelberg DWL2000), exhibiting corner rounding and topology artifacts. In contrast, hexagonal features closely approximate the diffraction-limited spot of common lithography equipment such as mask writers, and adjacent features in a hexagonal grid always share an edge, which preserves the topology of the design. These advantages potentially allow us to design for smaller feature sizes, and corresponding stronger diffraction or higher diffraction efficiency using the same lithography equipment. In optics, the use of hexagon arrays has been studied in the field of integral imaging, lens arrays [1719], image display [20], sensors [21], and phase modulators [22,23].

 figure: Fig. 1.

Fig. 1. Fabricated masks with hexagonal and square patterns by laser direct writing (Heidelberg DW2000). Square features are more affected by corner rounding artifacts (areas shaded in green) and touching corners (areas shaded in red), while hexagonal features better preserve the geometry. Microscopic images are taken by a Nikon Eclipse L200N microscope.

Download Full Size | PDF

In this work, we explore the utilization of hexagonal grids for DOE design, which combines the rapid Fourier-based simulation of light propagation from Cartesian grids with the sampling and fabrication advantages of hexagonal grids. This combination is made possible through the use of a hexagonal Fast Fourier Transform (HFFT), which can be considered a drop-in replacement for the Fast Fourier Transform (FFT) in any existing DOE optimization framework, be it GS or a more recent gradient back-propagation method. While our approach is applicable to various DOE design tasks, our primary focus lies in holography applications. Holography offers a straightforward means of characterizing the quality disparities, both in terms of simulation accuracy and direct measurements of fabricated DOEs.

Our contributions encompass several key aspects. Firstly, we adopt a novel 2D hexagonal arrangement for DOE geometries, opting to utilize the Array Set Addressing (ASA) coordinate system [15] for data storage and processing. This innovative approach forms the basis for our subsequent work. Secondly, we implement hexagonal scalar diffraction with differentiable functions, facilitating the back-propagation of gradients. This capability enables us to perform hexagonal Fresnel diffraction simulations and conduct inverse design. To validate our methodology, we compare the simulation accuracy between hexagonal and rectangular sampling schemes. Furthermore, we apply our techniques practically by converting images, serving as holograms, into hexagonal-sampled images. We utilize back-propagation and GS to inversely derive their wavefront, demonstrating the real-world applicability of our approach. The DOEs are fabricated using a combination of photolithography and reactive ion-etching (RIE) techniques, and subjected to comprehensive testing, with comparisons made against DOEs featuring Cartesian grids. As a result, practical holographic examples empirically validate the correctness and effectiveness of our implementation. To facilitate further research in the community, we will release the associated code online at https://github.com/vccimaging/HexDOE.

2. Methods

To demonstrate the benefits of the hexagonal grid in DOE design, we first introduce general data processing operations and fast Fourier transforms for the hexagonal grids in the ASA format following [15]. Next, we illustrate how to implement the Fresnel diffraction method in the hexagonal grids for general wave propagation. Last, for the purpose of demonstration, we implement the classic GS algorithm [9] as well as a differentiable back-propagation method for the inverse design of a holographic hexagonal DOE.

2.1 Hexagonal coordinate system and HFFTs

Among multiple choices for hexagonal grid representation [2428], the ASA coordinate system [15] is best suited for data storage and allows easy implementation of algorithms. As shown in Fig. 2, two rectangular grids are employed to represent a hexagonal grid. The hexagons are identified using three coordinates,

$$(a,r,c) \in \{ 0,1 \} \times \mathbb{Z} \times \mathbb{Z},$$
where the coordinates represent the array ($a$), row ($r$), and column ($c$), respectively.

 figure: Fig. 2.

Fig. 2. Hexagonal coordinate system: Array Set Addressing. The data on hexagonal grids are stored as two interleaved rectangular arrays. Each hexagon pixel in the 2D space can be uniquely represented by $(a,r,c)$ coordinates, where $a$ is either 0 or 1 to address which rectangular array the pixel is stored in. $r$ and $c$ address the row and column respectively. $s_h$ is the horizontal spacing of the hexagonal grids, and $e$ is the edge length of a single hexagon.

Download Full Size | PDF

Note that we adopt the pointy-top-orientated [29] regular hexagon layout in the ASA coordinate. The horizontal spacing between neighboring hexagons $s_h$ measures the sampling density of the hexagonal grids, and it follows that $s_h=\sqrt {3}e$, where $e$ is the edge of the hexagon.

The forward and inverse hexagonal discrete Fourier transforms in ASA coordinates [30] can be expressed as

$$\left\{ \begin{aligned} F(b,s,d) & = \sum_a \sum_r \sum_c f(a,r,c)E(a,r,c,b,s,d),\\ f(a,r,c) & = \frac{1}{2nm}\sum_b \sum_s \sum_d F(b,s,d)E^{{-}1}(a,r,c,b,s,d), \end{aligned} \right.$$
where $f(a,r,c)$ is the spatial signal, $F(b,s,d)$ is its Fourier transform, and
$$E(a,r,c,b,s,d) = \exp \left(- j \pi \left[ \frac{(a+2c)(b+2d)}{2m} +\frac{(a+2r)(b+2s)}{n} \right] \right).$$

Throughout the equations, both spatial and frequency dimensions are $2\times n \times m$ ($n$ is vertical and $m$ is horizontal), and $a, b \in [0, 1]$, $r, s \in [0,\ldots, n-1]$, and $c, d \in [0,\ldots, m-1]$.

Notice that Eq. (2) is separable and can be further expressed in the form of 1D fast Fourier transforms,

$$F(b,s,d)=l_0(b,s,d)+{\rm exp}\left[{-}j\pi \left(\frac{b+2d}{2m}+\frac{b+2s}{n}\right)\right]l_1(b,s,d),$$
where
$$\left\{ \begin{aligned} l_a(b,s,d) & = \sum_r g_a(b,r,d){\rm exp}\left[{-}j2\pi \frac{r(b+2s)}{n}\right],\\ g_a(b,r,d) & = \sum_c f(a,r,c){\rm exp}\left[{-}j2\pi \frac{c(b+2d)}{2m}\right]. \end{aligned} \right.$$

These expressions can be realized using standard 1D fast Fourier transforms. We implement the HFFT using PyTorch [31] to support hardware acceleration and automatic differentiation.

Similar to the 2D Cartesian data, the HFFT assumes that the signal is periodic. To perform the Fourier transform properly, it is necessary to apply a Fourier shift before FFT. We exploit the periodic property of the hexagonal data as shown in Fig. 3(a) to derive proper shift operation. The illustrated hexagonal Fourier shift is used to align the 2D signal correctly. The periodic hexagon sampling domain can be shifted to an interlocking rectangular periodic domain.

 figure: Fig. 3.

Fig. 3. Illustration of Hexagonal Fourier shift and Fourier transform. (a) Fourier shifts in the spatial domain and frequency domain. (b) Workflow of hexagonal Fourier transform by HFFT.

Download Full Size | PDF

To ensure isotropy in the frequency domain, we let $3n = 2m$. Otherwise, the hexagonal grid in the frequency domain will be scaled unequally along vertical and horizontal directions. This also gives the spatial sampling region to be regular hexagon.

In Fig. 3(b), we show the whole hexagonal Fourier transform process of a square signal that uses the HFFT. In the spatial domain, we first sample and shift the data according to the $(a, r, c)$ coordinates. The HFFT is then applied to compute the discrete Fourier transform, followed by an inverse hexagonal Fourier shift to restore to the original order.

2.2 Hexagonal scalar diffraction

Wave propagation is commonly expressed by the Fresnel diffraction [11] in the Cartesian coordinates. Similarly, we can employ the forward and inverse HFFTs to rewrite the Fresnel diffraction in the hexagonal coordinates,

$$u_{z}(\textbf{r}) = {\mathscr{F}_z\left\{u_{0}(\textbf{r})\right\}} = \mathscr{F}^{{-}1} \{ \mathscr{F} \{ u_{0}(\textbf{r}) \} \mathscr{F} \{ h_z(\textbf{r}) \} \},$$
where ${\mathscr{F}_z\left \{\cdot \right \}}$ is the Fresnel propagation, $z$ is the propagation distance, $\textbf {r}$ is a 2D vector that represents the position at the source and observation plane, $u_0(\textbf {r})$ and $u_z(\textbf {r})$ are complex fields at the source plane and image plane respectively, and $h_z(\textbf {r})$ is the impulse response given by
$$h_z(\textbf{r})=\frac{e^{jkz}}{jkz}{\rm exp}\left( \frac{jk}{2z}\vert \textbf{r}\vert ^2\right),$$
where $k = 2\pi / \lambda$ is the wave number, and $\vert \textbf {r} \vert$ is the distance to the z-axis at the observation plane. For the hexagonally-sampled field with the ASA representation and a spacing of $s_h$, we have
$$\vert \textbf{r} \vert= s_h\sqrt{\left( \frac{a}{2} + c\right)^2 + 3\left( \frac{a}{2} + r\right)^2} .$$

The scalar diffraction for a DOE can be mathematically modeled as a complex linear system. This system takes a plane wave as input and generates the diffraction field at a given propagation distance $z$ as output. The DOE phase diagram disrupts the input wave by adding a phase shift to it. Our objective is to extract the phase information from the output intensity of the system. This can be accomplished by minimizing the squared error between the reconstructed and target intensities.

2.3 Inverse hexagonal DOE design

The process of inverse design of the DOE is illustrated in Fig. 4. The first step in this process is to retrieve the phase distribution from the desired image by reversing the forward simulation of Fresnel diffraction. This phase distribution is then used to create the wavefront of the DOE with some fabrication constraints. With this, we can design the DOE to produce the desired hologram.

 figure: Fig. 4.

Fig. 4. Inverse design of a hexagonal DOE. (a) The phase distribution of a target image is retrieved by iterative forward and backward propagation. (b) The optimized phase profile is quantized into 4 bits (16 levels) for fabrication. Finally, the fabricated DOE is used to produce the desired hologram.

Download Full Size | PDF

The problem we are trying to solve can be expressed as follows:

$$\phi^\ast{=} {\rm arg}\mathop{\rm \,\ min}_{\phi} \Vert \left| {\mathscr{F}_z\left\{ u_0 \left( \textbf{r} \right) \cdot \exp{\left(j \phi\right)}\right\}} \right|^2 - I_{\mathrm{target}} \Vert^2_2,$$
where $\phi$ is the phase of the DOE to be optimized, $u_0 \left (\textbf {r} \right )$ is the incident plane wave, and $I_{\mathrm {target}}$ is the intensity of the hologram we wish to reconstruct.

With the basic arithmetic operations and Fourier transforms for the ASA system, any algorithms developed for Cartesian coordinates can readily be modified as their hexagonal counterparts to solve the DOE optimization problem. In this work, we implement two algorithms, GS and back-propagation, for the purpose of demonstration. Other methods can be implemented similarly.

The GS algorithm is an iterative phase retrieval algorithm composed of forward and backward calculations. With the hexagonal Fourier transform and its inverse, we are able to realize the update of phase by replacing the amplitude of backward calculation with the target amplitude.

The other algorithm is back-propagation. The inverse problem in Eq. (9) can be efficiently solved using advanced iterative algorithms, such as stochastic gradient descent [32] or Adam [33]. The optimization algorithm is straightforward and can be implemented using state-of-the-art deep learning modules.

Compared to traditional iterative methods such as GS, using back-propagation is more flexible. The advanced optimization takes advantage of avoiding the local minimum [32] to increase the accuracy and provides the use of regularization terms [34] to add constraints to the solution. Regarding the phase retrieval problem, various results with different requests could be obtained such as smoothed intensities, concentrated energy distribution, adjustable aperture size, etc.

3. Results

3.1 Simulation

We consider a holography system with a hexagonal DOE. The target image size is $4\,\text {mm} \times 4\,\text {mm}$ and the wavelength of the source plane wave is $520\,\text {nm}$. Zero padding is added around the DOE to ensure the simulation accuracy [35], which gives the whole simulation area to be $8\,\text {mm} \times 8\,\text {mm}$.

We use the same configuration for both Cartesian and hexagonal grids for a head-to-head comparison. The horizontal and vertical Cartesian sampling spacings are both $s_r$. To ensure identical sampling density in the hexagonal coordinates, we must let

$$s_r^2=\frac{\sqrt{3}}{2}s_h^2 \triangleq \vert \Delta r \vert ^2.$$

A series of rectangular sampling spaces ranging from 1 $\mu m$ to 10 $\mu m$ have been used to test the fabrication limitation. For the sake of convenience, we use the term “feature size” $\Delta r$, which is equal to the rectangular sample spacing $s_r$, to represent the hexagonal and rectangular resolution with the same sampling density. For example, for the feature size of 1 $\mu m$, the rectangular sampling spacing $s_r = 1\,\mu m$, and the hexagonal sampling spacing $s_h \approx 1.075\,\mu m$.

3.1.1 Forward simulation accuracy

To measure the simulation accuracy, we first compare the diffraction results of a square aperture to the analytical solution of Fresnel diffraction [11]. Various widths for the square aperture are used and the propagation distance is 70 mm. To test the sampling accuracy for tilted features, a slightly rotated square beam (7°) is also used for comparison with the one without rotation. The feature size is 5 $\mu m$ and the width of the aperture ranges from 0.1 mm to 2.0 mm.

The results are illustrated in Fig. 5. The peak signal-to-noise ratios (PNSRs) of the simulations are compared in Figs. 5(a) and 5(d). For an aperture of 1.0 mm width, the corresponding simulation errors are shown in Figs. 5(b) and 5(c) for the hexagonal and Cartesian grids, respectively. It is clear that hexagonal sampling can reduce the error along the x-axis due to its interlaced geometry. However, even though hexagonal coordinates exhibit superior accuracy in these two scenarios, the results diverge when the rotation angle surpasses approximately 30° as in Fig. 5(d). The accuracy of Cartesian coordinates fluctuates significantly with varying rotation angles. This observation underscores that, for this square aperture, Cartesian coordinates are highly sensitive to their direction, whereas hexagonal coordinates demonstrate much greater robustness. A more equitable comparison with the circular beam is presented in Fig. 5(e), where accuracy remains uninfluenced by the sampling direction. In this context, hexagonal coordinates outperform Cartesian coordinates across most radius values. It is also worth noticing that oscillation occurs when the aperture size varies due to the misalignment between the aperture and the sample grids.

 figure: Fig. 5.

Fig. 5. Simulation accuracy comparison of Cartesian and Hexagonal grids with Fresnel diffraction. (a) PSNR of the simulated complex field compared to the analytical results using a square aperture. (b) Error map of the simulation result using a square beam with a width of 1.0 mm. (c) Error map of the simulation result using a rotated (7°counter-clockwise) square beam with a width of 1.0 mm. (d) PSNR of the rotated square beam with different rotation angles and a width of 1.0 mm. (e) PSNR of a circular beam with different aperture size

Download Full Size | PDF

3.1.2 Inverse design

To evaluate the performance, we choose various target images and inverse design the DOEs to generate corresponding holograms. For back-propagation, we choose the Adam optimizer with a starting learning rate of 0.01 to update the phase for each iteration. We start with a uniform distribution to achieve a smoother phase that avoids high-resolution features that hurt the fabrication result. The optimization ends after 100 iterations.

In Fig. 6(a), we show three examples, the KAUST logo, a photograph of Vermeer’s “Girl with a Pearl Earring”, and a spiral pattern (from top to bottom). The corresponding simulated intensity images, with $\Delta r=10\,\mu m$, are shown in Fig. 6(b) for visual comparison.

 figure: Fig. 6.

Fig. 6. Simulation results of target images and their reconstructed holograms using hexagonal pixel arrangement with $\Delta r=10\,\mu m$. (a) Target images after hexagonal sampling through linear interpolation. (b) Simulated diffraction intensities solved by back-propagation.

Download Full Size | PDF

In Fig. 7, we compare the imaging resolution of hexagonal and Cartesian designs using the USAF 1951 resolution chart. It contains features of different sizes, which can challenge the sampling. We first use linear interpolation to convert the original images to hexagonal-sampled data. The source is set to be a plane wave with a square aperture of $4\,\text {mm} \times 4\,\text {mm}$, which is the same as the image size. The propagation distance is 200 mm.

 figure: Fig. 7.

Fig. 7. Comparison of the simulated results of inverse design between hexagonal (b) and Cartesian (c) sampling using the same target image (a). The feature sizes are $\Delta r= 10\,\mu m,\,5\,\mu m,\,1\,\mu m$ (left to right), respectively.

Download Full Size | PDF

The target resolution chart and a zoom-in region are shown in Fig. 7(a). The simulated intensity images for hexagonal designs are shown in Fig. 7(b) and Cartesian designs in Fig. 7(c) for different feature sizes, $\Delta r = 10\,\mu m$, $\Delta r = 5\,\mu m$, and $\Delta r = 1\,\mu m$ (from left to right). The outcomes for hexagonal and Cartesian designs exhibit a high degree of similarity, attributable to their identical sampling density. The specific nuances diverge due to the stochastic nature of the optimization processes and variations in their sampling approaches. For example, when considering $\Delta r= 10\,\mu m$, the hexagonal design demonstrates superior performance in Group 2, whereas with $\Delta r=5\,\mu m$ in Group 1, the results are reversed. As for $\Delta r=1\,\mu m$, the sampled targets closely align since the features are significantly larger than the spacing, resulting in phase retrieval outcomes that are exceptionally close.

3.2 Experimental results

The DOEs are fabricated by a 4-step workflow of consecutive photolithography and RIE steps as employed in [1,2,8]. This yields a 16-level quantization of the DOE profile to approximate the continuous design. A chromium aperture is added to restrict stray light from entering the sensor.

As illustrated in Fig. 8, to measure the hologram created by the DOE, a laser (Thorlabs PL201) with a wavelength of 520 nm is used as the source. A collimator (HONC HC-550) is used to create the plane wave. An image sensor (Lucid TRIO54S-CC) with a resolution of 2880 $\times$ 1860 and pixel size of 3.0 $\mu m$ is used to collect the diffracted pattern of the DOE.

 figure: Fig. 8.

Fig. 8. Experimental layout for the measurement of the proposed hexagonal DOE.

Download Full Size | PDF

We fabricate and measure the DOEs with $\Delta r=5\,\mu m$ and the same aperture size and propagation distance as discussed in Section. 3.1.2. The simulation and measurements are shown in Figs. 9(a) and 9(b). The captured intensity matches well with the simulation, which proves that the implementation of phase retrieval algorithms is correct. The phase retrieval result of the GS algorithm is also fabricated and measured in Fig. 9(c) as a baseline reference.

 figure: Fig. 9.

Fig. 9. Simulation and measurement of the diffraction field of hexagonal DOEs that are optimized by different configurations and algorithms. $\Delta r=5\,\mu m$. (a) and (b) Back-propagation, square source with a width of 4 mm, propagation distance 200 mm. (c) GS, square source with a width of 4 mm, propagation distance 200 mm. (d) Back-propagation, circular source with a diameter of 2 mm, propagation distance 70 mm. The grey-scale images are the simulation results and the zoomed-in images. The green images are the measurements.

Download Full Size | PDF

To further challenge the fabrication resolution and explore the advancement of hexagonal grids, we reduce the aperture as well as the propagation distance to increase the diffraction angle. The aperture is reduced to a circular one with 2 mm diameter. The propagation distance is reduced to 70 mm. The results are illustrated in Fig. 9(d). Different from that in Fig. 9(b), the error between simulation and measurement is significantly increased due to the increased design difficulty.

To experimentally compare the performance of hexagonal and Cartesian designs, we show the hexagonal design in Fig. 10(a) and rectangular design in Fig. 10(b) for the spiral pattern with $\Delta r=5\,\mu m$.

 figure: Fig. 10.

Fig. 10. Comparison of the hexagonal and Cartesian measurements with $\Delta r=5\,\mu m$. The same target image is used for hexagonal (a) and Cartesian (b) grids, respectively. Microscopic images are taken by a Nikon Eclipse L200N microscope.

Download Full Size | PDF

Microscopic images of the fabricated DOEs are shown in the first column. The measured hologram intensities are shown in the middle column, with a zoom-in for the central region in the right column. Note that in the middle of the spiral pattern, the hexagonal design shows more details than the rectangular design. To quantitatively compare the performance, we employ the PSNR as a metric. For hexagonal grids, PSNR = 6.155 and SSIM = 0.0728, and for rectangular grids, PSNR = 5.887 and SSIM = 0.0591. Although the distinction between hexagonal and Cartesian becomes subtle with a small diffraction angle, our findings indicate incremental improvements both in visualization and statistical metrics for this challenging scenario.

4. Discussion

We have successfully implemented the wave propagation simulation and inverse design algorithms on the hexagonal grids. The hexagonal sampling gives a better simulation accuracy due to its higher degree of isotropy. The measurement of the fabricated DOEs shows that the reconstruction quality using a hexagonal grid is superior to that of Cartesian grids.

Although we have demonstrated that the fundamental Cartesian calculations and optimization algorithms for diffraction simulation can be transferred to a hexagonal grid, there are still complex design strategies that remain explored. Since traditional 2D data is mostly processed in Cartesian coordinates, when converted to hexagonal coordinates, they often become more complicated.

In terms of computational efficiency, the 2D HFFT consists of two 1D FFT processes which takes more time than a direct 2D FFT for Cartesian grids. Moreover, HFFT requires additional operations that certainly consume more computational resources. This is shown in execution time. For example, for back-propagation of a hexagonal grid with a data size of $2\times 462 \times 693 = 640,332$, it takes 31.325 seconds to finish the optimization with 100 iterations on CPU whereas for a Cartesian grid with a size of $800 \times 800 = 640,000$ it takes 7.825 seconds. To improve the calculation efficiency, a GPU implementation of HFFT could significantly enhance efficiency in the future.

Our experiments show the advantages of the hexagonal grid representation both in simulation and in the final fabricated results. The improvements in simulation can be attributed to the more isotropic sampling properties of the hexagonal grid. The additional benefits, while present, are subtle in the fabricated hologram results, demonstrating a nuanced improvement in matching the designed DOE and its fabricated counterpart with the hexagonal coordinate. It should be noted, however, that these additional benefits are modest, pointing to other sources of artifacts that affect the fabrication process, such as uneven etching rates in the RIE process, which equally affect both methods [36]. Moreover, it’s essential to highlight that the applications of DOEs go beyond holography, potentially capitalizing more on the advantages of hexagonal grids. For the existing optical elements such as hexagonal-packing SLMs and deformable mirrors that employ the hexagonal grids, the hexagonal wave propagation approach provides a more direct and efficient way to simulate and design, compared to resampling to Cartesian grids that introduces error. The hexagonal representation can be extended to advanced technologies, providing distinctive benefits in applications such as microscopic imaging and laser beam shaping, where sensitivity to fabrication intricacies is particularly pronounced.

5. Conclusion

In this work, we have introduced the design and optimization of DOEs in the hexagonal coordinates. The scalar diffraction formula in the form of hexagonal coordinates is derived and tested with high simulation accuracy. We show that the general algorithms used in conventional Cartesian designs can easily be transferred to hexagonal designs with the proposed methods. As a demonstration, we have implemented two phase retrieval algorithms, including GS and back-propagation, to recover the target holographic images with hexagonal sampling. DOEs with hexagonal grids are fabricated and measured to show the benefits of using hexagonal representation. Compared with traditional Cartesian grids, hexagonal grids reduce the edge effects thanks to the 6-fold symmetry. Due to higher uniformity along different directions, the hexagonal design has the potential to create more detailed diffracted patterns. We envision that hexagonal DOE offers an alternative design strategy for diffractive optics with applications that are not limited to holography, but also beam shaping, PSF engineering, and other advanced imaging and photography techniques.

Funding

King Abdullah University of Science and Technology (Individual Baseline Funding).

Acknowledgments

This work was partly done in the Nanofabrication CoreLabs (NCL) at KAUST.

Disclosures

The authors declare no conflicts of interest.

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. F. Heide, Q. Fu, Y. Peng, et al., “Encoded diffractive optics for full-spectrum computational imaging,” Sci. Rep. 6(1), 33543 (2016). [CrossRef]  

2. Y. Peng, Q. Fu, F. Heide, et al., “The diffractive achromat full spectrum computational imaging with diffractive optics,” in SIGGRAPH ASIA 2016 Virtual Reality Meets Physical Reality: Modelling and Simulating Virtual Humans and Environments (Association for Computing Machinery, 2016).

3. J. Chang, V. Sitzmann, X. Dun, et al., “Hybrid optical-electronic convolutional neural networks with optimized diffractive optics for image classification,” Sci. Rep. 8(1), 12324 (2018). [CrossRef]  

4. V. Sitzmann, S. Diamond, Y. Peng, et al., “End-to-end optimization of optics and image processing for achromatic extended depth of field and super-resolution imaging,” ACM Trans. Graph. 37(4), 1–13 (2018). [CrossRef]  

5. S.-H. Baek, H. Ikoma, D. S. Jeon, et al., “Single-shot hyperspectral-depth imaging with learned diffractive optics,” in IEEE/CVF International Conference on Computer Vision (2021), pp. 2631–2640.

6. Q. Sun, E. Tseng, Q. Fu, et al., “Learning rank-1 diffractive optics for single-shot high dynamic range imaging,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2020), pp. 1386–1396.

7. V. A. Soifer, L. Doskolovich, D. Golovashkin, et al., Methods for Computer Design of Diffractive Optical Elements (John Wiley & Sons, Inc., 2002).

8. D. C. O’Shea, Diffractive Optics: Design, Fabrication, and Test, vol. 62 (SPIE Press, 2004).

9. R. W. Gerchberg, “A practical algorithm for the determination of phase from image and diffraction plane pictures,” Optik 35, 237–246 (1972).

10. W. Saxton, Computer Techniques for Image Processing in Electron Microscopy, vol. 10 (Academic Press, 2013).

11. J. W. Goodman, Introduction to Fourier Optics (McGraw-Hill, 1996).

12. B. Aiazzi, S. Baronti, A. Capanni, et al., “Advantages of hexagonal sampling grids and hexagonal shape detector elements in remote sensing imagers,” in 11th European Signal Processing Conference (2002), pp. 1–4.

13. D. P. Petersen and D. Middleton, “Sampling and reconstruction of wave-number-limited functions in n-dimensional euclidean spaces,” Information and control 5(4), 279–323 (1962). [CrossRef]  

14. J. C. Burton II, End-to-end Analysis of Hexagonal vs. Rectangular Sampling in Digital Imaging Systems (The College of William and Mary, 1993).

15. N. I. Rummelt and J. N. Wilson, “Array set addressing: enabling technology for the efficient processing of hexagonally sampled imagery,” J. Electron. Imaging 20(2), 023012 (2011). [CrossRef]  

16. A. A. Dobrynin, I. Gutman, S. Klavžar, et al., “Wiener index of hexagonal systems,” Acta Applicandae Mathematica 72(3), 247–294 (2002). [CrossRef]  

17. B. Yang, J. Zhou, Q. Chen, et al., “Fabrication of hexagonal compound eye microlens array using DMD-based lithography with dose modulation,” Opt. Express 26(22), 28927–28937 (2018). [CrossRef]  

18. K. Yanaka, “Integral photography using hexagonal fly’s eye lens and fractional view,” Proc. SPIE 6803, 533–540 (2008). [CrossRef]  

19. N. Chen, J. Yeom, J.-H. Jung, et al., “Resolution comparison between integral-imaging-based hologram synthesis methods using rectangular and hexagonal lens arrays,” Opt. Express 19(27), 26917–26927 (2011). [CrossRef]  

20. I. Her and C.-T. Yuan, “Resampling on a pseudohexagonal grid,” CVGIP: Graph. Model. Image Process 56, 336–347 (1994). [CrossRef]  

21. M. Tremblay, M. d’Anjou, and D. Poussart, “Hexagonal sensor with imbedded analog image processing for pattern recognition,” in Proceedings of Custom Integrated Circuits Conference (IEEE, 1993), p. 12.

22. J. Ma, K. Chen, J. Chen, et al., “Closed-loop correction and ocular wavefronts compensation of a 62-element silicon unimorph deformable mirror,” Chin. Opt. Lett. 13(4), 042201 (2015). [CrossRef]  

23. P.-Y. Wang and M. Saffman, “Selecting optical patterns with spatial phase modulation,” Opt. Lett. 24(16), 1118–1120 (1999). [CrossRef]  

24. R. Mersereau, “The processing of hexagonally sampled two-dimensional signals,” Proc. IEEE 67(6), 930–949 (1979). [CrossRef]  

25. P. J. Burt, “Tree and pyramid structures for coding hexagonally sampled binary images,” Comput. Graph. Image Process. 14(3), 271–280 (1980). [CrossRef]  

26. L. Middleton and J. Sivaswamy, “Framework for practical hexagonal-image processing,” J. Electron. Imaging 11(1), 104–114 (2002). [CrossRef]  

27. L. Middleton and J. Sivaswamy, Hexagonal Image Processing: A Practical Approach (Springer Science & Business Media, 2005).

28. W. E. Snyder, H. Qi, and W. A. Sander, “Coordinate system for hexagonal pixels,” in Medical Imaging 1999: Image Processing, vol. 3661 (SPIE, 1999), pp. 716–727.

29. A. Patel, “Hexagonal grids,” https://www.redblobgames.com/grids/hexagons/. Accessed: 2023-08-30.

30. J. B. Birdsong and N. I. Rummelt, “The hexagonal fast Fourier transform,” in International Conference on Image Processing (IEEE, 2016), pp. 1809–1812.

31. A. Paszke, S. Gross, F. Massa, et al., “Pytorch: An imperative style, high-performance deep learning library,” in Advances in Neural Information Processing Systems 32 (Curran Associates, Inc., 2019), pp. 8024–8035.

32. S.-I. Amari, “Backpropagation and stochastic gradient descent method,” Neurocomputing 5(4-5), 185–196 (1993). [CrossRef]  

33. D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv, arXiv:1412.6980 (2014). [CrossRef]  

34. H. W. Engl, M. Hanke, and A. Neubauer, Regularization of Inverse Problems, vol. 375 (Springer Science & Business Media, 1996).

35. D. Hincapié-Zuluaga, J. Herrera-Ram irez, and J. Garcia-Sucerquia, “Study of the padding effects in numerical reconstruction of digitally recorded holograms,” Optik 169, 109–117 (2018). [CrossRef]  

36. Q. Fu, H. Amata, and W. Heidrich, “Etch-free additive lithographic fabrication methods for reflective and transmissive micro-optics,” Opt. Express 29(22), 36886–36899 (2021). [CrossRef]  

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

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 (10)

Fig. 1.
Fig. 1. Fabricated masks with hexagonal and square patterns by laser direct writing (Heidelberg DW2000). Square features are more affected by corner rounding artifacts (areas shaded in green) and touching corners (areas shaded in red), while hexagonal features better preserve the geometry. Microscopic images are taken by a Nikon Eclipse L200N microscope.
Fig. 2.
Fig. 2. Hexagonal coordinate system: Array Set Addressing. The data on hexagonal grids are stored as two interleaved rectangular arrays. Each hexagon pixel in the 2D space can be uniquely represented by $(a,r,c)$ coordinates, where $a$ is either 0 or 1 to address which rectangular array the pixel is stored in. $r$ and $c$ address the row and column respectively. $s_h$ is the horizontal spacing of the hexagonal grids, and $e$ is the edge length of a single hexagon.
Fig. 3.
Fig. 3. Illustration of Hexagonal Fourier shift and Fourier transform. (a) Fourier shifts in the spatial domain and frequency domain. (b) Workflow of hexagonal Fourier transform by HFFT.
Fig. 4.
Fig. 4. Inverse design of a hexagonal DOE. (a) The phase distribution of a target image is retrieved by iterative forward and backward propagation. (b) The optimized phase profile is quantized into 4 bits (16 levels) for fabrication. Finally, the fabricated DOE is used to produce the desired hologram.
Fig. 5.
Fig. 5. Simulation accuracy comparison of Cartesian and Hexagonal grids with Fresnel diffraction. (a) PSNR of the simulated complex field compared to the analytical results using a square aperture. (b) Error map of the simulation result using a square beam with a width of 1.0 mm. (c) Error map of the simulation result using a rotated (7°counter-clockwise) square beam with a width of 1.0 mm. (d) PSNR of the rotated square beam with different rotation angles and a width of 1.0 mm. (e) PSNR of a circular beam with different aperture size
Fig. 6.
Fig. 6. Simulation results of target images and their reconstructed holograms using hexagonal pixel arrangement with $\Delta r=10\,\mu m$ . (a) Target images after hexagonal sampling through linear interpolation. (b) Simulated diffraction intensities solved by back-propagation.
Fig. 7.
Fig. 7. Comparison of the simulated results of inverse design between hexagonal (b) and Cartesian (c) sampling using the same target image (a). The feature sizes are $\Delta r= 10\,\mu m,\,5\,\mu m,\,1\,\mu m$ (left to right), respectively.
Fig. 8.
Fig. 8. Experimental layout for the measurement of the proposed hexagonal DOE.
Fig. 9.
Fig. 9. Simulation and measurement of the diffraction field of hexagonal DOEs that are optimized by different configurations and algorithms. $\Delta r=5\,\mu m$ . (a) and (b) Back-propagation, square source with a width of 4 mm, propagation distance 200 mm. (c) GS, square source with a width of 4 mm, propagation distance 200 mm. (d) Back-propagation, circular source with a diameter of 2 mm, propagation distance 70 mm. The grey-scale images are the simulation results and the zoomed-in images. The green images are the measurements.
Fig. 10.
Fig. 10. Comparison of the hexagonal and Cartesian measurements with $\Delta r=5\,\mu m$ . The same target image is used for hexagonal (a) and Cartesian (b) grids, respectively. Microscopic images are taken by a Nikon Eclipse L200N microscope.

Equations (10)

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

( a , r , c ) { 0 , 1 } × Z × Z ,
{ F ( b , s , d ) = a r c f ( a , r , c ) E ( a , r , c , b , s , d ) , f ( a , r , c ) = 1 2 n m b s d F ( b , s , d ) E 1 ( a , r , c , b , s , d ) ,
E ( a , r , c , b , s , d ) = exp ( j π [ ( a + 2 c ) ( b + 2 d ) 2 m + ( a + 2 r ) ( b + 2 s ) n ] ) .
F ( b , s , d ) = l 0 ( b , s , d ) + e x p [ j π ( b + 2 d 2 m + b + 2 s n ) ] l 1 ( b , s , d ) ,
{ l a ( b , s , d ) = r g a ( b , r , d ) e x p [ j 2 π r ( b + 2 s ) n ] , g a ( b , r , d ) = c f ( a , r , c ) e x p [ j 2 π c ( b + 2 d ) 2 m ] .
u z ( r ) = F z { u 0 ( r ) } = F 1 { F { u 0 ( r ) } F { h z ( r ) } } ,
h z ( r ) = e j k z j k z e x p ( j k 2 z | r | 2 ) ,
| r | = s h ( a 2 + c ) 2 + 3 ( a 2 + r ) 2 .
ϕ = a r g   m i n ϕ | F z { u 0 ( r ) exp ( j ϕ ) } | 2 I t a r g e t 2 2 ,
s r 2 = 3 2 s h 2 | Δ r | 2 .
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.