Abstract

Optimal decimation-in-frequency iterative interlacing techniques that have been developed involve iterative processing of hologram blocks in a novel scheme for the minimization of mean-square error (MSE) between the desired image and the reconstructed image. The algorithms can be used together with any existing computer-generated hologram (CGH) synthesis technique. We use them together with the method of projections onto constrained sets. There are two versions of the new algorithm. The first algorithm is adaptive and adjusts the value of λ involved in the MSE after a hologram block is updated. The second algorithm keeps the value of λ constant during each run of the algorithm and updates λ at the end of the run to yield the minimum MSE. The new value of λ is used in the next run. A run of the algorithm is defined as processing all the hologram blocks once. The simulation results show that the second algorithm has much lower reconstruction error and higher diffraction efficiency than those of the previous binary CGH coding techniques.

© 1995 Optical Society of America

Fast decimation-in-frequency direct binary search algorithms for synthesis of computer-generated holograms

J-Y. Zhuang and O. K. Ersoy
J. Opt. Soc. Am. A 11(1) 135-143 (1994)

Iterative interlacing approach for synthesis of computer-generated holograms

O. K. Ersoy, J. Y. Zhuang, and J. Brede
Appl. Opt. 31(32) 6894-6901 (1992)

Iterative interlacing error diffusion for synthesis of computer-generated holograms

M. P. Chang and O. K. Ersoy
Appl. Opt. 32(17) 3122-3129 (1993)

Efficient design of direct-binary-search computer-generated holograms

Brian K. Jennison, Jan P. Allebach, and Donald W. Sweeney
J. Opt. Soc. Am. A 8(4) 652-660 (1991)

Multicriteria optimality for iterative encoding of computer-generated holograms

Luc Legeard, Philippe Réfrégier, and Pierre Ambs
Appl. Opt. 36(29) 7444-7449 (1997)