Loading…
Parallel computational ghost imaging with modulation patterns multiplexing and permutation inspired by compound eyes
Real-time computational ghost imaging (CGI) has received significant attention in recent years to overcome the trade-off between long acquisition time and high reconstructed image quality of CGI. Inspired by compound eyes, we propose a parallel computational ghost imaging with modulation patterns mu...
Saved in:
Published in: | Applied physics letters 2024-02, Vol.124 (7) |
---|---|
Main Authors: | , , , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Real-time computational ghost imaging (CGI) has received significant attention in recent years to overcome the trade-off between long acquisition time and high reconstructed image quality of CGI. Inspired by compound eyes, we propose a parallel computational ghost imaging with modulation patterns multiplexing and permutation to achieve a faster and high-resolution CGI. With modulation patterns multiplexing and permutation, several small overlapping fields-of-view can be obtained; meanwhile, the difficulty in alignment of illumination light field and multiple detectors can be well resolved. The method combining compound eyes with multi-detectors to capture light intensity can resolve the issue of a gap between detector units in the array detector. Parallel computation facilitates significantly reduced acquisition time, while maintaining reconstructed quality without compromising the sampling ratio. Experiments indicate that using m × m detectors reduce modulation pattern count, projector storage, and projection time to around 1/m2 of typical CGI methods, while increasing image resolution to m2 times. This work greatly promotes the practicability of parallel computational ghost imaging and provides optional solution for real-time computational ghost imaging. |
---|---|
ISSN: | 0003-6951 1077-3118 |
DOI: | 10.1063/5.0187882 |