Premium
39.2: Fast layer‐based algorithm in computer‐generated holography by using the frequency sparsity of hologram
Author(s) -
Jia Jia
Publication year - 2021
Publication title -
sid symposium digest of technical papers
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.351
H-Index - 44
eISSN - 2168-0159
pISSN - 0097-966X
DOI - 10.1002/sdtp.15173
Subject(s) - holography , pixel , layer (electronics) , algorithm , feature (linguistics) , computer science , image (mathematics) , fourier transform , computer generated holography , fast fourier transform , object (grammar) , spatial frequency , optics , computer vision , artificial intelligence , mathematics , materials science , physics , mathematical analysis , linguistics , philosophy , composite material
Fast layer‐based is proposed to speed up the calculation of computer‐generated holograms. In a layer‐based method, each layer image may contain large areas in which the pixel values are zero considering the occlusion effect among the different depth layers. By taking advantage of this feature, the fast algorithm only calculates the non‐zero image areas of each layer. In addition, two one‐dimensional fast Fourier transforms (1DFFT) are implemented to compute a 2DFFT without calculating the rows or columns in which the image pixels are all zero. Since the size of the active calculation is reduced, the computational speed is considerably improved. Numerical simulations and optical experiments are performed to confirm these methods. The results show that the total computational time can be reduced by 5 times for a three‐dimensional (3D) object of a train with 50 depth layers.