Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Differential Hadamard ghost imaging via single-round detection

Open Access Open Access

Abstract

The experimental implementation of computational ghost imaging based on orthogonalized patterns usually consists of two steps, corresponding to the illumination of the positive and negative elements. Here, we put forward a novel technique which avoids "negative illumination" and involves a single round of measurements. Our method is based on the properties of the second-order correlation function in Hadamard-based computational ghost imaging. Experimental results show that object information may be effectively recovered with half of the measurements compared to the conventional differential scheme. As a matter of fact, the application of our scheme is not limited to the Hadamard pattern, but it may be applied also to other orthogonal matrices. As such, it may be relevant for the general development of computational ghost imaging.

© 2021 Optical Society of America under the terms of the OSA Open Access Publishing Agreement

1. Introduction

Ghost imaging (GI) is a remarkable imaging method where the image of an unknown object may be reconstructed by intensity correlation measurements. In traditional ghost imaging systems, the light signal is split in two correlated beams, one beam illuminates the object and it is referred to as the object beam. After passing through the object, the transmitted light is measured by a single-pixel detector. The other beam, usually referred to as the reference beam, does not pass through the object, and is measured by a charge coupled device (CCD). The image of the object can be retrieved by performing correlation measurements of the intensities at the two detectors. Ghost imaging was first proposed by Pittman et al. [1,2]. Later on, Shapiro et al. proposed a computational ghost imaging (CGI) scheme [3]. Compared to traditional GI, the experimental setup of CGI is significantly simplified. The reference beam is no longer present, and a single-pixel detector is used to detect the object beam [4]. A deterministic illumination pattern at the object plane is created by a spatial light modulator (SLM) or a Digital Micromirror Device (DMD), and the image may be reconstructed by recording only the total reflected light (or the transmitted light) intensity by a single-pixel detector. In recent years, several sophisticated algorithms have been developed to improve the computing efficiency and imaging quality of CGI, such as differential computational ghost imaging (DCGI) [5], compressed sensing computational ghost imaging (CSGI) [6], Singular value decomposition ghost imaging [7], deep learning ghost imaging (DLGI), and few more methods [817].At present, the applications of ghost imaging include but are not limited to three-dimensional imaging [1822], Acoustic Imaging [23], multispectral imaging [24,25], infrared imaging [26,27], and terahertz imaging [28,29] .

In addition, since structured patterns are key factors affecting the CGI imaging efficiency, various types of structured illumination patterns have been suggested using sparse bases that are also orthogonal. These include Hadamard, Fourier, and wavelets, which are commonly used in single-pixel imaging [3043].

CGI based on orthogonal illumination patterns, however, is affected by the so-called negative illumination problem. In order to illustrate the issue, let us consider CGI based on the Hadamard pattern (HCGI). Since the Hadamard matrix is a square matrix whose entries are either "+ 1" or "-1", the SLM (or DMD) is unable to project the pattern with "-1". Some researchers proposed to transform the "-1"’s to "0"’s to obtain a special Hadamard matrix, modulate it to scatterer for sampling, and the reconstruct the image. The corresponding reconstruction, however, turned out to be not very accurate. Welsh et al. suggested the use of a differential method to split the Hadamard matrix into positive and negative illumination patterns to solve the problem [44]. Currently, this method is widely used in the computational ghost imaging experiments based on Hadamard matrix such as the "Russian Dolls ordering", the "Cake-Cutting strategy", the "Fast Walsh transform", and few others [4550]. The method has been experimental advantages but involves positive and negative patterns, i.e. it needs twice the number of samplings. In this paper, we propose a new scheme which only needs 1 round of measurement while maintaining good image quality.

The paper is arranged as follows. In Section 2, use HCGI as a case study, we illustrate the feasibility of our scheme. In Section 3, we show experimental results and discuss their significance. Finally, conclusions are given in Section 4.

2. Theoretical model analysis

The schematic diagram of the conventional CGI is shown in Fig. 1. A series of patterns are generated by a computer and projected onto the object by a projector. The quantity $R_i(x,y)$ is a $N_x \times N_y$ matrix which denotes the $i$-th illumination pattern. The patterns $R_i(x, y)$ interacts with a target object, and then it is measured by a bucket detector. The i-th detector signal detected is denoted by $B_i$. After $N$ measurements, the image could be reconstructed by calculating the second-order correlation function as:

$$G^{(2)}(x, y)=\frac{1}{N} \sum_{i=1}^{N} R_{i}(x, y) B_{i}$$
Since the Hadamard matrix is the simplest orthogonal matrix, we introduce our single-measurement technique using this example. The Hadamard basis is given by
$$\hat H_{2^{n}}=\hat H_{2} \otimes \hat H_{2^{n-1}}=\left[\begin{array}{cc} \hat H_{2^{n-1}} & \hat H_{2^{n-1}} \\ \hat H_{2^{n-1}} & -\hat H_{2^{n-1}} \end{array}\right].$$
where $n \geq$2, $\otimes$ denotes the Kronecker product, $n$ is a positive integer and and the Hadamard matrix $\hat H_{2}$ is the square matrix given by
$$\hat H_{2}=\left[\begin{array}{cc} 1 & 1 \\ 1 & -1 \end{array}\right]\,.$$
The Hadamard basis may be written a column of Hadamard matrices
$$\mathrm{\hat H}=\left[\vec{h}_{1}, \vec{h}_{2}, \ldots, \vec{h}_{N}\right]^T.$$
and then reshaped into $N_x \times N_y$ 2$D$ patterns. To facilitate theoretical analysis, both the patterns and the transmission function of the image are transformed into 1$D$ form, where the 2$D$ object $O(x,y)$ is represented by a $1\times N$ ($N=N_xN_y$) column vector $\textbf {O}$
$$O=\left[O_{1}, O_{2}, O_{3}, \ldots, O_{N}\right]^{T}.$$
The second-order correlation function of Hadamard ghost imaging may be then written as
$$G^{(2)}=\frac{1}{N} \sum_{i=1}^{N} \vec{h}_{i}^T B_{i}.$$
Throughout the paper, we are going to refer to this quantity as the bucket signal, which itself may be rewritten as
$$B_{i}=\vec{h}_{i}^{T} O$$
where T denotes the transpose operator. The second-order correlation function may be rewritten accordingly as
$$G^{(2)}=\frac{1}{N} \hat H^{\prime} \hat H^{\prime T} \mathrm{O}$$
where $H^\prime$ is the $N\times n$ submatrix of the Hadamard matrix. If a complementary matrix $\hat H$ exists, then we have $\hat H\, \hat H^T= N I$, where $\hat I$ is the identity matrix of dimension $N$, and the second-order correlation function is given by $G^{\left (2\right )}=\hat I O= O$. In this case, the original image may be fully reconstructed.

 figure: Fig. 1.

Fig. 1. Schematic diagram of computational ghost imaging.

Download Full Size | PDF

Assuming that the binary patterns illuminated by the projector is made of "1" and "0", the Hadamard matrix may be divided into two complementary matrices $\hat H_+=\frac {1+\hat H}{2}$ and $\hat H_-=\frac {1-\hat H}{2}$ , where "1" stands for a matrix with all the entries equal to 1. Then the value range of the differential patterns is given by

$$\hat H=\hat H_{+}-\hat H_{-}.$$
For the sake of simplicity, in the following we assume a square picture ($N_x=N_y$). If the image is reconstructed using the $\hat H_+$ matrix, we refer to this scheme as the "Positive Hadamard ghost imaging (PHGI)". The reconstructed image of HCGI can be written as
$$\begin{aligned} & G^{(2)}=\frac{1}{N} \hat H^{T}_{N+} \hat H_{N+} O \\ & =\frac{1}{4}\left(\sum_{n=1}^{N} O_{n}+O_{1}\right)+\frac{1}{4}\left[\begin{array}{c} O_{1}+\sum_{n=1}^{N} O_{n} \\ O_{2} \\ O_{3} \\ \vdots \\ O_{N} \end{array}\right]_{N \times 1} \end{aligned}$$
Looking at Eq. (10), one sees that $G^{(2)}$ is not (strictly and positively) correlated with the object $O$. The reconstructed image may be thus significantly distorted. This is reflected by the fact that the intensity value of the first pixel is significantly increased. This usually results in making visible only the upper left corner of the reconstructed image. We correct the value of the first-pixel point for the second term in the equation. Since the first Hadamard scatter is an all-ones matrix, and the error is $\Delta =\sum _{n=1}^{N} O_{n}$, the resulting bucket signal can be written as
$$B_{1}=\vec{h}_{1} O=\sum_{n=1}^{N} O_{n}.$$
The exact value is obtained by subtracting $B_1$ from the value of the first-pixel point. However, since the first term in Eq. (10) is a background term, this results in a lower contrast in the recovered image. In order to correct this behaviour, the following scheme is employed. In HCGI experiments, we can only use the "1" and "0" special Hadamard patterns for sampling, but in the image reconstruction process, the illumination patterns are controllable, and thus we use the normal Hadamard scatterers for image reconstruction. We refer to this scheme as the "Modified positive Hadamard ghost imaging (MPHGI)". The reconstructed image of HCGI can be written as
$$G^{(2)}=\frac{1}{N} \hat H \hat H_{N+}^{T} O=\frac{2}{N}\left[\begin{array}{c} O_{1}+\sum_{n=1}^{N} O_{n} \\ O_{2} \\ O_{3} \\ \cdots \\ O_{N}. \end{array}\right]_{N \times 1}$$
Compared to PHGI, this scheme removes the background term, but the intensity of the first-pixel point is still much larger than the values of the other pixel points. After correcting the value of the first-pixel point according to the method mentioned above, the correlation function may be re-defined as
$$G^{\prime(2)}=\frac{2}{N} G^{(2)}-B_{1} \delta(n-1)$$
In the MPHGI scheme, one does not detect the bucket signal in the normal Hadamard mode, and therefore picture information cannot be recovered accurately. Inspired by Eq. (9), we argue that the correct signal can be obtained by projecting two opposite illumination patterns. The resulting scheme is termed "Differential Hadamard ghost imaging (DHGI)". The splitting of Hadamard illumination pattern into positive and negative patterns is illustrated in Fig. 2. The two groups, $\hat {H}_+$ and $\hat {H}_-$ patterns, are measured separately to obtain the detection results of Hadamard pattern in normal mode, and the bucket signal may be written as
$$\begin{array}{l} B_{i}=\left(\vec{h}_{i+}-\vec{h}_{i-}\right) O=\vec{h}_{i} O=B_{i+}-B_{i-}. \end{array}$$
In this case, the second-order correlation function is given by
$$G^{(2)}=\frac{1}{N} \sum_{i=1}^{N} \vec{h}_{i}\left(B_{i+}-B_{i-}\right)=O.$$
This scheme obtains the bucket signal under normal Hadamard pattern, however at the price of doubling the number of measurements.

 figure: Fig. 2.

Fig. 2. Splitting the Hadamard illumination pattern into positive and negative patterns (we show a $8\times 8$ Hadamard matrix as an example).

Download Full Size | PDF

In order to overcome this drawback, we suggest to employ a single measurement to obtain the bucket signal. Let us consider $\hat H_{N+}^T$ in Eq. (13) as the observation matrix, and introduce $\hat H_+=\frac {1+\hat H}{2}$. Here, since we add one to the elements of $\hat H$, $\hat H_+$ can be written as an all-ones matrix of the same size as $H$. The positive Hadamard observation matrix can be thus written as

$$\vec{h}_{i+}=\frac{\vec{h}_{1}+\vec{h}_{i}}{2},$$
and the corresponding measurement intensity as
$$B_{i+}=\vec{h}_{i+}^{T} O=\frac{\vec{h}_{1}^{T}+\vec{h}_{i}^{T}}{2} O=\frac{1}{2}\left(B_{1}+B_{i}\right).$$
In this case, we reconstruct the image using the metric intensity $B_{i+}$ and Hadamard matrix $H$. The second-order correlation function can be written as
$$G^{(2)}=\frac{1}{N} \sum_{i=1}^{N} \vec{h}_{i}\left(2 B_{i+}-B_{1}\right)=O,$$
and the original image can be completely reconstructed. We term this scheme "Differential positive Hadamard ghost imaging (DPHGI)".

We also find that if $\vec {h}_{i-}^{T}$ is used for sampling in the DPHGI scheme, the detector signal obtained can be expressed as:

$$B_{i-}=\frac{1}{2}(\hat{I}^{'}O-B_i)$$
where $\hat {I}^{'}$ denotes the all-ones matrix and the value $\hat {I}^{'}O$ denotes the total transmittance of the target object. Since $\vec {h}_{i-}^{T}$ is the inverse of $\vec {h}_{i+}^{T}$ and does not have a measurement base with all elements of 1, the information of the target object is lost by using $\vec {h}_{i-}^{T}$ only for measurement. The results of the above two schemes, MPHGI and DPHGI, illustrate that the full information of the target object can be obtained by using positive pattern measurements, and doubling measurements using negative pattern is redundant.

3. Experiments and discussions

To verify the feasibility of the scheme in practical computational ghost imaging, several experiments have been performed. The experimental setup is shown in Fig. 1. The Model of the projector is XGIMI-XE11F and we use a metal piece with a hollow pentagram in the center as the target object, and the Model of the photodiode in the optical detection circuit is LSSPD-2.5-3P-08.26. We reconstruct the images using all of the four methods introduced in Section 2, and compare their results sampling the target objects in the same conditions. The reconstruction results are shown in Fig. 3. We refer to the four schemes in Section 2 as PHGI, MPHGI, DHGI, and DPHGI, respectively. Among the four options, only PHGI fails to reconstruct the image. The experimental results are consistent with the theoretical derivation. In particular, we see that the value of the first-pixel point is much larger than the other pixel points, so only the first point in the reconstructed image is bright, and the others are dark. The other three reconstruction schemes provide better performance, but the number of measurements of MPHGI and DPHGI is reduced by 50$\%$ compared with DHGI.

 figure: Fig. 3.

Fig. 3. The experimental results of the image reconstruction of the object "star" by using PHGI, MPHGI, DHGI, and DPHGI, respectively.

Download Full Size | PDF

Let us now further analyze and compare MPHGI and DPHGI. DPHGI requires to calculate the bucket signal under normal Hadamard scatter irradiation after a single sampling, and then reconstruct the image. MPHGI allows us to reconstruct the image directly from the result of a single sampling, but then we have to correct the first-pixel value to obtain the correct image. It may be argued that DPHGI can further improve the efficiency of ghost imaging, and we demonstrated this possibility by experiments.

In the literature on compressed sensing imaging, stable and fast imaging schemes, such as Walsh-Hadamard transform and fast Fourier transform, have been proposed. Among them, Walsh-Hadamard transform is based on Hadamard matrices as observation matrices, and the number of sampling and image reconstruction is reduced by changing the order of the Hadamard matrix row order [32].

The experimental results are shown in Fig. 4. The resolution of the reconstructed image is $64$ $\times$ $64$ pixels. As the figure shows, the higher is the sampling rate, the better is the quality of the recovered images, but at the same sampling rate the number of DPHGI measurements is reduced by half compared to DHGI, and the image quality is not much different. If we look closely, the quality of the images recovered by DHGI is slightly better because DPHGI introduces a small amount of noise, while DHGI performs a differential operation on the measurements, which results in a more effective suppression of the noise. In order to compare the quality of the reconstructed image quantitatively, the Peak Signal-to-Noise Ratio (PSNR) is used as a criterion, which is defined as [51]

$$PSNR=20\log _{10}\left[ \frac{\max Val-1}{MSE} \right],$$
where $MSE=\frac {1}{N}\sum _{x,y}{\left ( O_0(x,y)-O(x,y) \right ) ^2}$, $O_0(x,y)$ and $O(x,y)$ represent the original and reconstructed images, respectively, $N$ denotes the total number of pixel points for each of $O_0(x,y)$ and $O(x,y)$, and $max Val$ is the maximum gray value of $O(x,y)$.We calculated the PSNR using Eq. (21), as shown in Fig. 5, and the results show that the difference in imaging quality between the two schemes is not significant, with DHGI being slightly more noise resistant than DPHGI. However, DPHGI still has an advantage in terms of the number of measurements. From the second-order correlation functions of Eq. (16) and Eq. (19) and the relationship between the positive and negative pattern of the two schemes, it can be seen that the results of the two schemes are in principle the same, but the differences in the experimental operation produce differences in the noise suppression. DHGI effectively suppresses noise, while since DPHGI multiplies each measurement by 2 and then subtracts the first measurement (as in Eq. (18)), it doubles the error as well. Besides, the subtracted measurement is a constant, so the robustness of this scheme is poor. On the other hand, the noise has a very small order of magnitude and has little effect on the overall quality of the reconstructed images. Overall, this proves the feasibility of using HCGI with a single-round measurement scheme.

 figure: Fig. 4.

Fig. 4. Experimental results at different sampling rates and the corresponding number of measurements. Row (a) is the image reconstructed using the DHGI, row (b) is the image reconstructed using the DPHGI.

Download Full Size | PDF

 figure: Fig. 5.

Fig. 5. Comparison of PSNR of reconstructed images at different sampling rates for DPHGI and DHGI.

Download Full Size | PDF

From the experimental point of view, the problem of negative illumination is solved by adding a constant to the whole matrix (see Fig. 6 ), which removes all the negative elements in the matrix. For such an operation, one does not need to modify the observation matrix. However, since a known auxiliary element is added to each pattern, a correction is needed for each measured signal (in DPHGI, each detector value is $B_1$ larger than the detector value in normal mode). Remarkably, this method can be extended to other orthogonal matrices, as it is summarized in the following equations

$$\begin{array}{l} \hat A_{+}=\hat A+\left|A_{\min }\right| \hat I^{\prime} \\ B_{+}=\left(\hat A+\left|A_{\min }\right| \hat I^{\prime}\right) O=B+\left|A_{\min }\right| \hat I^{\prime} O \\ B=B_{+}-\left|A_{\min }\right| \hat I^{\prime} O. \end{array}$$
where $\hat A$ is an orthogonal matrix and $\hat I^{\prime }$ denotes a matrix of ones.

 figure: Fig. 6.

Fig. 6. Schematic diagram of the single-round measurement scheme (The effect of projecting 1,0 elements with DMD is the same as projecting 2,0 elements, so there is no division by 2 here).

Download Full Size | PDF

The bucket signal obtained by the all-ones matrix projection contains the transmittance information of the whole target object, and plays an important role in the scheme as the basic unit for correcting the bucket signal. We have simulated this procedure with several common orthogonal pattern spots, and good reconstruction results have been obtained. We thus foresee application of our method to other orthogonal pattern spot-based computational ghost imaging.

4. Conclusions

In conclusion, we have proposed a single-round measurement scheme to solve the "negative illumination" issue in ghost imaging experiments based orthogonalized patterns. By analyzing the form of the second-order correlation function in HCGI experiments, we have put forward the DPHGI scheme, which has been experimentally tested and assessed. Results have shown that DPHGI is able to recover the image information with half the number of samples of DHGI. Upon combining this scheme with the Walsh Hadamard transform, one may recover high quality images using significantly less measurements.

In addition, by further analyzing the DPHGI scheme, we have proposed a method to solve the negative illumination problem by translating the pattern structure and eliminating the negative values, which is theoretically applicable to any computational ghost imaging experiment based on orthogonality patterns. We believe that the proposed scheme may be practically relevant for computational ghost imaging. In future research, we are going to apply the single-round measurement scheme to more CGI experiments.

Funding

Natural Science Foundation of Jilin Province (YDZJ202101ZYTS030).

Disclosures

The authors declare no conflicts of interest.

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. D. N. Klyshko, “Combine epr and two-slit experiments: Interference of advanced waves,” Phys. Lett. A 132(6-7), 299–304 (1988). [CrossRef]  

2. T. B. Pittman, Y. H. Shih, D. V. Strekalov, and A. V. Sergienko, “Optical imaging by means of two-photon quantum entanglement,” Phys. Rev. A 52(5), R3429–R3432 (1995). [CrossRef]  

3. H. Jeffrey Shapiro, “Computational ghost imaging,” Phys. Rev. A 78(6), 061802 (2008). [CrossRef]  

4. Y. Bromberg, O. Katz, and Y. Silberberg, “Ghost imaging with a single detector,” Phys. Rev. A 79(5), 053840 (2009). [CrossRef]  

5. B. Sun, M. Edgar, R. Bowman, L. Vittert, and M. Padgett, “Differential computational ghost imaging,” in Computational Optical Sensing and Imaging, (2013).

6. V. Katkovnik and J. Astola, “Compressive sensing computational ghost imaging,” J. Opt. Soc. Am. A 29(8), 1556–1567 (2012). [CrossRef]  

7. X. Zhang, X. Meng, X. Yang, Y. Wang, Y. Yin, X. Li, X. Peng, W. He, G. Dong, and H. Chen, “Singular value decomposition ghost imaging,” Opt. Express 26(10), 12948–12958 (2018). [CrossRef]  

8. Y. He, G. Wang, G. Dong, S. Zhu, H. Chen, A. Zhang, and Z. Xu, “Ghost imaging based on deep learning,” Sci. Rep. 8(1), 6469 (2018). [CrossRef]  

9. M. Lyu, W. Wang, H. Wang, H. Wang, G. Li, N. Chen, and G. Situ, “Deep-learning-based ghost imaging,” Sci. Rep. 7(1), 17865–17866 (2017). [CrossRef]  

10. F. Wang, H. Wang, H. Wang, G. Li, and G. Situ, “Learning from simulation: An end-to-end deep-learning approach for computational ghost imaging,” Opt. Express 27(18), 25560–25572 (2019). [CrossRef]  

11. P. Clemente, V. Durán, V. Torres-Company, E. Tajahuerce, and J. Lancis, “Optical encryption based on computational ghost imaging,” Opt. Lett. 35(14), 2391–2393 (2010). [CrossRef]  

12. N. D. Hardy and J. H. Shapiro, “Computational ghost imaging versus imaging laser radar for three-dimensional imaging,” Phys. Rev. A 87(2), 023820 (2013). [CrossRef]  

13. M. Tanha, R. Kheradmand, and S. Ahmadi-Kandjani, “Gray-scale and color optical encryption based on computational ghost imaging gray-scale and color optical encryption based on computational ghost imaging,” Appl. Phys. Lett. 101(10), 101108–5907 (2012). [CrossRef]  

14. C. M. Watts, D. Shrekenhamer, J. Montoya, G. Lipworth, J. Hunt, T. Sleasman, S. Krishna, D. R. Smith, and W. J. Padilla, “Terahertz compressive imaging with metamaterial spatial light modulators,” Nat. Photonics 8(8), 605–609 (2014). [CrossRef]  

15. B. I. Erkmen, “Computational ghost imaging for remote sensing,” J. Opt. Soc. Am. A 29(5), 782–789 (2012). [CrossRef]  

16. C. Zhang, S. Guo, J. Cao, J. Guan, and F. Gao, “Object reconstitution using pseudo-inverse for ghost imaging,” Opt. Express 22(24), 30063–30073 (2014). [CrossRef]  

17. C. Gao, X. Wang, Z. Wang, Z. Li, G. Du, F. Chang, and Z. Yao, “Optimization of computational ghost imaging,” Phys. Rev. A 96(2), 023838 (2017). [CrossRef]  

18. B. Sun, M. P. Edgar, R. Bowman, L. E. Vittert, S. Welsh, A. Bowman, and M. J. Padgett, “3d computational imaging with single-pixel detectors,” Science 340(6134), 844–847 (2013). [CrossRef]  

19. E. Salvador-Balaguer, P. Latorre-Carmona, C. Chabert, F. Pla, J. Lancis, and E. Tajahuerce, “Low-cost single-pixel 3d imaging by using an led array,” Opt. Express 26(12), 15623–15631 (2018). [CrossRef]  

20. Y. Qian, R. He, Q. Chen, G. Gu, F. Shi, and W. Zhang, “Adaptive compressed 3d ghost imaging based on the variation of surface normals,” Opt. Express 27(20), 27862–27872 (2019). [CrossRef]  

21. W. Gong, C. Zhao, H. Yu, M. Chen, W. Xu, and S. Han, “Three-dimensional ghost imaging lidar via sparsity constraint,” Sci. Rep. 6(1), 26133–26136 (2016). [CrossRef]  

22. M.-Q. Li, R.-M. Lan, X.-F. Liu, X.-R. Yao, and G.-J. Zhai, “Acoustical ghost imaging,” Appl. Phys. Lett. 117(8), 084102 (2020). [CrossRef]  

23. S. S. Welsh, M. P. Edgar, R. Bowman, P. Jonathan, B. Sun, and M. J. Padgett, “Fast full-color computational imaging with single-pixel detectors,” Opt. Express 21(20), 23068–23074 (2013). [CrossRef]  

24. J. Huang and D. Shi, “Multispectral computational ghost imaging with multiplexed illumination,” J. Opt. 19(7), 075701 (2017). [CrossRef]  

25. L. Bian, J. Suo, G. Situ, Z. Li, J. Fan, F. Chen, and Q. Dai, “Multispectral imaging using a single bucket detector,” Sci. Rep. 6(1), 24752–24757 (2016). [CrossRef]  

26. N. Radwell, K. J. Mitchell, G. M. Gibson, M. P. Edgar, R. Bowman, and M. J. Padgett, “Single-pixel infrared and visible microscope,” Optica 1(5), 285–289 (2014). [CrossRef]  

27. M. P. Edgar, G. M. Gibson, R. W. Bowman, B. Sun, N. Radwell, K. J. Mitchell, S. S. Welsh, and M. J. Padgett, “Simultaneous real-time visible and infrared video with single-pixel detectors,” Sci. Rep. 5(1), 10669 (2015). [CrossRef]  

28. R. I. Stantchev, B. Sun, S. M. Hornett, P. A. Hobson, G. M. Gibson, M. J. Padgett, and E. Hendry, “Noninvasive, near-field terahertz imaging of hidden objects using a single-pixel detector,” Sci. Adv. 2(6), e1600190 (2016). [CrossRef]  

29. T. Vasile, V. Damian, D. Coltuc, and M. Petrovici, “Single pixel sensing for thz laser beam profiler based on hadamard transform,” Opt. Laser Technol. 79, 173–178 (2016). [CrossRef]  

30. S. M. M. Khamoushi, Y. Nosrati, and S. H. Tavassoli, “Sinusoidal ghost imaging,” Opt. Lett. 40(15), 3452–3455 (2015). [CrossRef]  

31. M. Zhang, Q. Wei, X. Shen, Y. Liu, H. Liu, J. Cheng, and S. Han, “Lensless fourier-transform ghost imaging with classical incoherent light,” Phys. Rev. A 75(2), 021803 (2007). [CrossRef]  

32. T. Lu, Z. Qiu, Z. Zhang, and J. Zhong, “Comprehensive comparison of single-pixel imaging methods,” Opt. Lasers Eng. 134, 106301 (2020). [CrossRef]  

33. H. Wu, R. Wang, C. Li, M. Chen, G. Zhao, Z. He, and L. Cheng, “Influence of intensity fluctuations on hadamard-based computational ghost imaging,” Opt. Commun. 454, 124490 (2020). [CrossRef]  

34. M. Xi, H. Chen, Y. Yuan, G. Wang, Y. He, Y. Liang, J. Liu, H. Zheng, and Z. Xu, “Bi-frequency 3d ghost imaging with haar wavelet transform,” Opt. Express 27(22), 32349–32359 (2019). [CrossRef]  

35. R. D. Nowak, “Wavelet-based rician noise removal for magnetic resonance imaging,” IEEE Trans. on Image Process. 8(10), 1408–1419 (1999). [CrossRef]  

36. L. T. Meng, P. Jia, H. H. Shen, M. J. Sun, and C. H. Yan, “Sinusoidal single-pixel imaging based on fourier positive–negative intensity correlation,” Sensors 20(6), 1674 (2020). [CrossRef]  

37. Z. Zhang, S. Liu, J. Peng, M. Yao, G. Zheng, and J. Zhong, “Simultaneous spatial, spectral, and 3d compressive imaging via efficient fourier single-pixel measurements,” Optica 5(3), 315–319 (2018). [CrossRef]  

38. Z. Zhang, X. Ma, and J. Zhong, “Single-pixel imaging by means of fourier spectrum acquisition,” Nat. Commun. 6, 6225 (2015). [CrossRef]  

39. K. M. Czajkowski, A. Pastuszczak, and R. Kotyński, “Real-time single-pixel video imaging with fourier domain regularization,” Opt. Express 26(16), 20009–20022 (2018). [CrossRef]  

40. M. Aßmann and M. Bayer, “Compressive adaptive computational ghost imaging,” Sci. Rep. 3, 1545 (2013). [CrossRef]  

41. W.-K. Yu, M.-F. Li, X.-R. Yao, X.-F. Liu, L.-A. Wu, and G.-J. Zhai, “Adaptive compressive ghost imaging based on wavelet trees and sparse representation,” Opt. Express 22(6), 7133–7144 (2014). [CrossRef]  

42. F. Rousset, N. Ducros, A. Farina, G. Valentini, C. D’Andrea, and F. Peyrin, “Adaptive basis scan by wavelet prediction for single-pixel imaging,” IEEE Trans. Comput. Imaging 3(1), 36–46 (2017). [CrossRef]  

43. K. M. Czajkowski, A. Pastuszczak, and R. Kotyński, “Single-pixel imaging with morlet wavelet correlated random patterns,” Sci. Rep. 8(1), 466–468 (2018). [CrossRef]  

44. S. S. Welsh, M. P. Edgar, R. Bowman, B. Sun, and M. J. Padgett, “Near video-rate linear stokes imaging with single-pixel detectors,” J. Opt. 17(2), 025705 (2015). [CrossRef]  

45. L. Wang and S. Zhao, “Fast reconstructed and high-quality ghost imaging with fast walsh–hadamard transform,” Photonics Res. 4(6), 240–244 (2016). [CrossRef]  

46. S. Tetsuno, K. Shibuya, and T. Iwata, “Subpixel-shift cyclic-hadamard microscopic imaging using a pseudo-inverse-matrix procedure,” Opt. Express 25(4), 3420–3432 (2017). [CrossRef]  

47. H. Ma, A. Sang, C. Zhou, X. An, X. Zhao, and L. Song, “High-efficiency reconstruction of ghost imaging based on equivalent deformation of 2d walsh transform,” J. Opt. 22(12), 125702 (2020). [CrossRef]  

48. W.-K. Yu, “Super sub-nyquist single-pixel imaging by means of cake-cutting hadamard basis sort,” Sensors 19(19), 4122 (2019). [CrossRef]  

49. M.-J. Sun, L.-T. Meng, M. P. Edgar, M. J. Padgett, and N. Radwell, “A russian dolls ordering of the hadamard basis for compressive single-pixel imaging,” Sci. Rep. 7(1), 3464 (2017). [CrossRef]  

50. M. F. Li, L. Yan, R. Yang, and Y. X. Liu, “Fast single-pixel imaging based on optimized reordering hadamard basis,” Acta Phys. Sinica 68(6), 064202 (2019). [CrossRef]  

51. S. Zhao, L. Wang, W. Liang, W. Cheng, and L. Gong, “High performance optical encryption based on computational ghost imaging with qr code and compressive sensing technique,” Opt. Commun. 353, 90–95 (2015). [CrossRef]  

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (6)

Fig. 1.
Fig. 1. Schematic diagram of computational ghost imaging.
Fig. 2.
Fig. 2. Splitting the Hadamard illumination pattern into positive and negative patterns (we show a $8\times 8$ Hadamard matrix as an example).
Fig. 3.
Fig. 3. The experimental results of the image reconstruction of the object "star" by using PHGI, MPHGI, DHGI, and DPHGI, respectively.
Fig. 4.
Fig. 4. Experimental results at different sampling rates and the corresponding number of measurements. Row (a) is the image reconstructed using the DHGI, row (b) is the image reconstructed using the DPHGI.
Fig. 5.
Fig. 5. Comparison of PSNR of reconstructed images at different sampling rates for DPHGI and DHGI.
Fig. 6.
Fig. 6. Schematic diagram of the single-round measurement scheme (The effect of projecting 1,0 elements with DMD is the same as projecting 2,0 elements, so there is no division by 2 here).

Equations (21)

Equations on this page are rendered with MathJax. Learn more.

G ( 2 ) ( x , y ) = 1 N i = 1 N R i ( x , y ) B i
H ^ 2 n = H ^ 2 H ^ 2 n 1 = [ H ^ 2 n 1 H ^ 2 n 1 H ^ 2 n 1 H ^ 2 n 1 ] .
H ^ 2 = [ 1 1 1 1 ] .
H ^ = [ h 1 , h 2 , , h N ] T .
O = [ O 1 , O 2 , O 3 , , O N ] T .
G ( 2 ) = 1 N i = 1 N h i T B i .
B i = h i T O
G ( 2 ) = 1 N H ^ H ^ T O
H ^ = H ^ + H ^ .
G ( 2 ) = 1 N H ^ N + T H ^ N + O = 1 4 ( n = 1 N O n + O 1 ) + 1 4 [ O 1 + n = 1 N O n O 2 O 3 O N ] N × 1
B 1 = h 1 O = n = 1 N O n .
G ( 2 ) = 1 N H ^ H ^ N + T O = 2 N [ O 1 + n = 1 N O n O 2 O 3 O N . ] N × 1
G ( 2 ) = 2 N G ( 2 ) B 1 δ ( n 1 )
B i = ( h i + h i ) O = h i O = B i + B i .
G ( 2 ) = 1 N i = 1 N h i ( B i + B i ) = O .
h i + = h 1 + h i 2 ,
B i + = h i + T O = h 1 T + h i T 2 O = 1 2 ( B 1 + B i ) .
G ( 2 ) = 1 N i = 1 N h i ( 2 B i + B 1 ) = O ,
B i = 1 2 ( I ^ O B i )
P S N R = 20 log 10 [ max V a l 1 M S E ] ,
A ^ + = A ^ + | A min | I ^ B + = ( A ^ + | A min | I ^ ) O = B + | A min | I ^ O B = B + | A min | I ^ O .
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.