Abstract
Using a novel genetic algorithm (GA) with a Lamarckian search we optimize the polygonal layout of a new type of multiplexed computer-generated hologram (MCGH) with polygonal apertures. A period of the MCGH is divided into cells, and the cell is further divided into polygonal apertures according to a polygonal layout, which is to be optimized. Among an ensemble of 1.21 × 1024 possible polygonal layouts, we take a population of 102 solutions, which are coded as chromosomes of bits, and find the optimal solution with our GA. We introduce rank-based selection with cumulative normal distribution fitness, double crossover, exponentially decreasing mutation probability and Lamarckian downhill search with a small number of offspring chromosomes into our GA, which shows a rapid convergence to the global minimum of the cost function. In a second step of optimization the phase distributions over the subholograms in the MCGH are determined with our iterative subhologram design algorithm. Our MCGH designs show large-size reconstructed images with high diffraction efficiency and low reconstruction error.
© 2003 Optical Society of America
Full Article | PDF ArticleMore Like This
Jean-Numa Gillet and Yunlong Sheng
J. Opt. Soc. Am. A 19(12) 2403-2413 (2002)
Jean-Numa Gillet and Yunlong Sheng
Appl. Opt. 41(2) 298-307 (2002)
Jing Wang and Yunlong Sheng
Appl. Opt. 55(27) 7636-7644 (2016)