Translator Disclaimer
4 September 2002 Fast and effective algorithm for synthesizing computer-generated holograms
Author Affiliations +
Over the past years great efforts have been made to find the optimization methods for synthesizing computer-generated holograms, e.g., kinoforms. The simulated annealing (SA) method is widely used in programing to approach the global optimization. But the drawback of the SA is it is time consuming. It is not possible to use the SA for some large computational optimization problems. So there is a strong need of the fast and effective algorithm. In this paper we propose a new optimization method, based on the modified Gerchberg-Saxton (G-S) algorithm, for synthesizing the large-scale kinoforms. Both phase and amplitude freedoms are used in this method. This method is especially suitable for the optimization of the large-scale kinoforms. It takes much less computational time than SA and the obtained image quality is also comparable to that of the SA. Another advantage of this method is that the reconstructed image quality is adjustable to meet the different requirements by controlling the noise parameter. The diffractive efficiency or the uniformity of the reconstructed image can be enhanced selectively to satisfy the different needs by the adjustment of the noise parameter. Using this method we have obtained several large-scale kinoforms with fast speed. The pattern of a binary kinoform is transferred into the glass plate by inductive coupled plasma (ICP) technology. Experimental results are also given in this paper to show the effectiveness of our methods.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Enwen Dai, Changhe Zhou, Peng Xi, and Liren Liu "Fast and effective algorithm for synthesizing computer-generated holograms", Proc. SPIE 4768, Novel Optical Systems Design and Optimization V, (4 September 2002);

Back to Top