Paper
18 November 1999 Optimization of computer-generated binary holograms using genetic algorithms
Dan Cojoc, Adrian Alexandrescu
Author Affiliations +
Proceedings Volume 3904, Fourth International Conference on Correlation Optics; (1999) https://doi.org/10.1117/12.370408
Event: International Conference on Correlation Optics, 1999, Chernivsti, Ukraine
Abstract
The aim of this paper is to compare genetic algorithms against direct point oriented coding in the design of binary phase Fourier holograms, computer generated. These are used as fan-out elements for free space optical interconnection. Genetic algorithms are optimization methods which model the natural process of genetic evolution. The configuration of the hologram is encoded to form a chromosome. To start the optimization, a population of different chromosomes randomly generated is considered. The chromosomes compete, mate and mutate until the best chromosome is obtained according to a cost function. After explaining the operators that are used by genetic algorithms, this paper presents two examples with 32 X 32 genes in a chromosome. The crossover type and the number of mutations are shown to be important factors which influence the convergence of the algorithm. GA is demonstrated to be a useful tool to design namely binary phase holograms of complicate structures.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Dan Cojoc and Adrian Alexandrescu "Optimization of computer-generated binary holograms using genetic algorithms", Proc. SPIE 3904, Fourth International Conference on Correlation Optics, (18 November 1999); https://doi.org/10.1117/12.370408
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Holograms

Genetic algorithms

Binary data

Optimization (mathematics)

Sensors

3D image reconstruction

Detector arrays

Back to Top