Currently, the dominant encoding method for computer-generated holograms is phase-only holography. The Gerchberg-Saxton (GS) algorithm is a commonly used approach for hologram generation. However, it suffers from issues such as poor convergence and low efficiency. In this paper, we introduce an iterative hologram algorithm that addresses these challenges. Our proposed algorithm divides the target object into segments with a certain degree of data redundancy. It computes the hologram iteratively, giving extra weight to each iteration. We also incorporate overlap constraints to enhance hologram quality and accelerate convergence by leveraging data redundancy. What sets our algorithm apart from others is that it varies the order in which segments are processed during iterations, resulting in different final holograms. By randomly selecting the order in each iteration, we can rapidly generate multiple diverse holograms. Importantly, objects reconstructed from these holograms exhibit consistency, allowing for the quick generation of multiple phase-only holograms that help mitigate the speckle effect.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.