检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京大学电子科学与工程学院,南京210046 [2]芜湖职业技术学院电气工程系,江苏芜湖241006
出 处:《光电工程》2014年第1期48-53,共6页Opto-Electronic Engineering
基 金:国家自然科学基金重点项目资助(608320036);科技部对欧盟科技合作专项(0817);国家质检公益性行业科研专项经费资助项目(201110233)
摘 要:全息图的生成速度影响了全息三维显示的实用化,大尺寸、大场景全息图的生成尤为困难,为了解决此问题,将人眼跟踪技术和指向光技术用于全息显示,形成主动式全息显示是一种解决动态全息显示的途径。针对主动式全息显示的需要,提出一种基于二步全息算法及空间冗余光波去除的并行全息图生成方案。首先根据二步全息算法计算行列贡献分量,结合空间冗余光波去除原理确定子全息图范围,合理设计基于GPU的CUDA并行计算方案,以实现大尺寸、大场景全息图的快速生成。实验表明这种方法有效可行,二步算法的引入使计算速度在并行计算的基础上再提高10倍左右,空间冗余光波的去除有效克服大场景与空间采样间隔之间的矛盾。In holographic three-dimensional display, the generation speed of the hologram affected its practical application. Particularly, it is difficult to generate hologram of the large size and large scene fast. In order to solve the problem, the pupil tracking and directional backlight were applied to holographic display. The formation of active holographic display is a way to solve the dynamic holographic display problem. For the need of active holographic display, a parallel hologram generation scheme based on two-step hologram algorithm and spatial redundancy lightwave removal algorithm was proposed. Firstly, rank contribution components were calculated by the two-step algorithm. Secondly, the scope of the sub-hologram was determined by the spatial redundancy lightwave removal algorithm. Finally, a reasonable CUDA parallel computing program was designed to generate hologram of the large size and large scene fast. The experimental results indicated that the algorithm was effective and feasible. With the two-step algorithm, the computing speed was accelerated about ten times on the basis of parallel computing technology. The contradiction between the large scene and spatial sampling interval was also overcome effectively by the spatial redundancy lightwave removal algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229