An iterative algorithm for phase hologram generation with overlap constraints

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.