Abstract
Two iterative algorithms for synthesis of binary computer-generated holograms (CGHs) for image reconstruction are described: alternating projections onto constraint sets (POCS) and direct binary search (DBS). Comparisons with conventional methods for CGH synthesis show that POCS and DBS yield substantially lower mean-squared reconstruction error and higher diffraction efficiency. The best method is DBS, but it is also the most computationally intensive. To ameliorate this disadvantage, an acceleration technique is presented for DBS. With this technique, the design of binary holograms with moderate space-bandwidth product becomes feasible. For example, the computation required to design a hologram with 256K elements is reduced by a factor of 121.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
