Full-color computational ghost imaging using a chromatic LED array and image interpolation

Computational ghost imaging has been an interesting topic for the imaging research community. However, low resolution and quality of image have been a major problem inhibiting the application of computational ghost imaging technique. In this work, we develop a chromatic 64 × 64 LED array which provi...

Full description

Saved in:
Bibliographic Details
Published in:JPhys photonics 2021-04, Vol.3 (2), p.24007
Main Authors: Li, Li-Jing, Huang, Hong-Xu, Sun, Ming-Jie
Format: Article
Language:English
Subjects:
Algorithms
Arrays
Cartesian coordinates
Digital cameras
Error reduction
Image quality
Image resolution
Imaging techniques
Interpolation
Root-mean-square errors
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Computational ghost imaging has been an interesting topic for the imaging research community. However, low resolution and quality of image have been a major problem inhibiting the application of computational ghost imaging technique. In this work, we develop a chromatic 64 × 64 LED array which provides high-speed structured illumination up to 2.5 MHz for computational ghost imaging. Importantly, rather than using regular Cartesian arrangement which is commonly used in a digital camera’s detection array, the LED chips on chromatic LED array we propose are arranged in a special way we refer to as basket-weave sampling. The experimental results demonstrate that our proposed arrangement outperforms Cartesian arrangement for storing high-frequency information of colored pictures, with averaged root mean squared error (RMSE) reduced by 4.6%. Meanwhile, considering the physical structure of the LED array, we propose a targeted interpolation algorithm for resulting images obtained from the experiment, and results show that our algorithm has lower averaged RMSE by 2% when compared to bilinear algorithm and by 6.4% when compared to bicubic algorithm.
ISSN:2515-7647
2515-7647
DOI:10.1088/2515-7647/abe7c8