arrow
返回

Fast two-step layer-based method for computer generated hologram using sub-sparse 2D fast Fourier transform

delete2018-06-21
delete35
delete
OA
AI
J
Jia Jia
J
Jhen Si
D
Daping Chu *
DOI:10.1364/OE.26.017487delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Fast two-step layer-based and sub-sparse two-dimensional Fast Fourier transform (SS-2DFFT ) algorithms arc 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 two-step layer-based algorithm only calculates the nonzero image areas of each layer. In addition, the SS-2DFFT method implements two one-dimensional fast Fourier transforms (1DFFT) 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, 3.4 times for a 3D object of a castle and 10 times for a 3D object of a statue head when compared with a conventional layer-based method if combining the two proposed methods together. (C) 2018 Optical Society of America under the terms of the OSA Open Access Publishing Agreement
Keyword:
LOOK-UP TABLE
FRINGE PATTERN
DIFFRACTION
SPECTRUM
DISPLAY
OBJECT
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Optics Express 封面图
Optics Express
IF:
3.3
论文数:
6.1W
被引数:
14.3W

机构

U
University of Cambridge
学者数:
7.7W
论文数: 7.1W
被引数: 13.7W
引用论文

引用论文

Accurate compressed look up table method for CGH in 3D holographic display
err2015-12-16
err54
errOAAI
errGao, Chuan; Liu, Juan; Li, Xin; Xue, Gaolei; Jia, Jia; Wang, Yongtian
err分享
err收藏
err
IF0
err
err0
errOAAI
err
err分享
err收藏
学者 查看更多内容