Abstract

The direct binary search (DBS) algorithm was originally invented for the synthesis of a binary Fourier hologram, and was applied for the generation of a binary Fresnel hologram recently. DBS performs quality evaluation on every pixel. Therefore, both the quality and diffraction efficiency of the generated binary hologram are better among various algorithms of the binary hologram. However, DBS is a time-consuming algorithm and thus is impractical for the generation of high-definition computer-generated holograms. In this paper, we proposed an enhanced DBS (E-DBS) method to speed up the hologram computation. E-DBS is based on the same pixelwise evaluation strategy of DBS, but the diffraction field of a single pixel is precomputed as a lookup table. In evaluating any pixel value, only a small area in the region of interest affected by the diffraction field of single pixel is calculated. In addition, it is also found that qualified results can be obtained by using only 4% of the area of the diffraction field. As a result, the computing complexity of E-DBS can be reduced by at least 2 orders of magnitude in contrast to conventional DBS.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call