High Speed Computational Ghost Imaging via Spatial Sweeping
文献类型：期刊论文
| 作者 | Qiao, Chang; Wang, Yuwang; Liu, Yang; Suo, Jinli; Situ, Guohai; Dai, Qionghai |
| 刊名 | Sci Rep
 |
| 出版日期 | 2017 |
| 卷号 | 7 |
| 通讯作者 | jlsuo@tsinghua.edu.cn |
| 英文摘要 | Computational ghost imaging (CGI) achieves single-pixel imaging by using a Spatial Light Modulator (SLM) to generate structured illuminations for spatially resolved information encoding. The imaging speed of CGI is limited by the modulation frequency of available SLMs, and sets back its practical applications. This paper proposes to bypass this limitation by trading off SLM's redundant spatial resolution for multiplication of the modulation frequency. Specifically, a pair of galvanic mirrors sweeping across the high resolution SLM multiply the modulation frequency within the spatial resolution gap between SLM and the final reconstruction. A proof-of-principle setup with two middle end galvanic mirrors achieves ghost imaging as fast as 42 Hz at 80 x 80-pixel resolution, 5 times faster than state-of-the-arts, and holds potential for one magnitude further multiplication by hardware upgrading. Our approach brings a significant improvement in the imaging speed of ghost imaging and pushes ghost imaging towards practical applications. |
| 收录类别 | SCI |
| 资助信息 | National Natural Science Foundation of China [61327902, 61377005]; Chinese Academy of Sciences [QYZDB-SSW-JSC002] |
| WOS记录号 | WOS:000397816000001 |
| 源URL | [http://ir.siom.ac.cn/handle/181231/27510]  |
| 专题 | 上海光学精密机械研究所_信息光学与光电技术实验室 |
| 作者单位 | 中国科学院上海光学精密机械研究所 |
| 推荐引用方式 GB/T 7714 | Qiao, Chang,Wang, Yuwang,Liu, Yang,et al. High Speed Computational Ghost Imaging via Spatial Sweeping[J]. Sci Rep,2017,7. |
| APA | Qiao, Chang,Wang, Yuwang,Liu, Yang,Suo, Jinli,Situ, Guohai,&Dai, Qionghai.(2017).High Speed Computational Ghost Imaging via Spatial Sweeping.Sci Rep,7. |
| MLA | Qiao, Chang,et al."High Speed Computational Ghost Imaging via Spatial Sweeping".Sci Rep 7(2017). |
入库方式： OAI收割
来源：上海光学精密机械研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。