Stochastic approach in the efficient design of the direct-binary-search algorithm for hologram synthesis

An algorithm incorporating a stochastic approach is proposed for reducing the computation time of the direct-binary-search algorithm for hologram synthesis. Two variants of this new algorithm are considered for a number of hologram-generation problems. Both variants can reduce the computation time significantly with a very small increase in the reconstruction error on average. The effectiveness of the proposed algorithm is found to improve with the increasing computational complexity of the design problem. Also, the algorithm is able to generate the hologram in a time that is relatively independent of the initial conditions.