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

Reduction of speckle noise in digital holography using a neighborhood filter based on multiple sub-reconstructed images

Open Access Open Access

Abstract

The application of digital holography in several fields is limited since speckle destroys the original information of the reconstructed image. This paper proposes a neighborhood filter based on multiple sub-reconstructed images according to the random distribution of speckle noise. In this method, the denoised value is equal to the weighted sum of neighboring pixel values, and the weight is calculated by the degree of correlation between different positions of multiple sub-holograms. The experimental results show that the method can greatly reduce the speckle noise, and its noise reduction performance is superior to traditional digital image processing algorithms.

© 2022 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

1. Introduction

Digital holography is a three-dimensional imaging technology [1], which uses CCD or CMOS to record the amplitude and phase of an object, and then realizes digital reconstruction through computer simulation. It is widely applied in the fields of microstructure measurement [2], holographic encryption [3], and optical metrology [4]. However, digital holography generally uses a laser as the light source. Due to the high coherence of the laser and the high roughness of the object, the scattered light will be coherently superimposed on the holographic plane to form speckle noise [5]. speckle will reduce the contrast and resolution of the reconstructed image [6], limiting the application of digital holography [24]. In order to suppress the speckle, numerous speckle reduction methods have been developed over the years.

Multi-look digital holography [7,8] has also been proven to be an effective optical method to reduce speckle noise. This method realizes speckle reduction by averaging multiple reconstructed images of the same object under different speckle distributions. It generally obtains multiple reconstructed images through polarization diversification [9], angle diversification [10], and wavelength diversification [7]. However, this kind of holography needs to rely on complex optical equipment. At the same time, the recording process will also consume a lot of time. Hincapie et al. proposed a single-shot speckle reduction method to overcome the shortcomings of the above-mentioned methods [11]. The method averages multiple sub-reconstructed images with uncorrelated speckle patterns obtained from a single hologram to suppress the speckle. Fukuoka et al. proposed a spatial mask method [12], which uses aperture overlap to obtain more sub-reconstructed images to enhance the noise reduction effect of the single-shot speckle reduction method. Although these two methods are simple and time-saving, they do not consider the distribution characteristics of speckle noise. Therefore, their speckle reduction performance is not excellent.

In addition, digital image processing methods have shown strong performance in the field of image noise reduction [1315]. Non-local means filter [1618] and BM3D [19] are classical noise reduction methods in digital image processing. They make full use of a large amount of redundant information in the image to reduce noise. However, these methods only have an excellent noise reduction effect for specific noise models. The speckle pattern of the reconstructed image of digital holography is randomly distributed [20], and it is difficult to estimate the noise model of the image. Therefore, these traditional digital image processing methods cannot achieve better results when dealing with coherent noise.

In this paper, combining digital image processing methods and the spatial mask method, we propose the neighborhood filter based on multiple sub-reconstructed images and the Pearson correlation coefficient [21]. Since the speckle is randomly distributed, the speckle patterns of the different sub-reconstructed images are different. According to this characteristic, the filter uses the correlation degree between different positions of multiple sub-reconstructed images to calculate the weight of the neighborhood pixels to the denoising pixels in the full reconstructed image. Experimental results show that this calculation method can effectively reduce the speckle in digital holography, and it is better than traditional digital image processing methods and the spatial mask method.

2. Principle and method

2.1 Off-axis lensless Fourier transform digital holography

In digital holography, the digital hologram recorded by CCD is obtained by the interference of the object light $O$ and the reference light $R$ [22]. The intensity distribution $I$ of the hologram can be described by Eq. (1):

$$I=|R+O|^{2}=|R|^{2}+|O|^{2}+R^{*}O+RO^{*} ,$$
where the superscript * denotes the complex conjugation.

The hologram formed when the object light and the reference light are coaxial is called a coaxial hologram. The zero-order light and the twin image of the coaxial holography will overlap, causing the reconstructed image to become blurred. However, off-axis holography can solve this shortcoming [23]. The way is to form an angle between the object light and the reference light. As long as the deflection angle is large enough, the zero-order light and the twin image can be separated, and the image resolution will be improved. Next, we will do the mathematical proof. In off-axis holography, if the reference light wave vector is in the $y$-$z$ plane, $R$ will be equal to $a\cdot \exp [-j2 \pi \beta y]$. Therefore, Eq. (1) is rewritten as:

$$I=a^{2}+|O|^{2}+a\cdot\exp[j2 \pi\beta y]\cdot O+a\cdot\exp[{-}j2 \pi\beta y]\cdot O^{*} ,$$
where $a$ is the amplitude of the reference light, and $\beta$ is the spatial carrier frequency. $\beta =sin\theta / \lambda$, where $\theta$ is the deflection angle between the object light and the reference light. Assuming that the illuminating light is C, the reconstructed light field $I_c$ can be described by Eq. (3):
$$I_c=C\cdot a^{2}+C\cdot|O|^{2}+C\cdot a\cdot\exp[j2 \pi\beta y]\cdot O+C\cdot a\cdot\exp[{-}j2 \pi\beta y]\cdot O^{*} ,$$
where the first two items are zero-order light, the third item is the reconstructed image of the object, and the fourth item is the twin image. The propagation directions of the third and fourth terms are at an angle with the vertical direction of the holographic plane, where one is propagating upward, and the other is propagating downward. Assuming that the highest frequency of the object light is $\omega$, the bandwidth will be $2\omega$. So that the above four items do not overlap each other, $\beta -\omega >2\omega$ is required. According to $\beta =sin\theta / \lambda$, we get the formula: $\theta \geq arcsin (3\omega \lambda )$. Therefore, as long as the deflection angle satisfies the formula, the zero-order light and the twin image can be separated.

The lens has Fourier transform properties. If we use the lens to record the interference pattern of the object light spectrum and the reference light spectrum, the Fourier transform hologram can be obtained [22,23]. Fourier transform holography can complete the reconstruction process only by Fourier transforming the hologram. In addition, when the object light in off-axis holography is spherical, a lensless Fourier transform hologram can be obtained, as shown in Fig. 1. The lensless Fourier transform holography can make more effective use of the bandwidth of the image sensor, and make reconstruction steps simpler [24].

 figure: Fig. 1.

Fig. 1. Lensless Fourier hologram recording structure.

Download Full Size | PDF

Based on the above description, this paper will use off-axis lensless Fourier transform digital holography to realize the recording process.

2.2 Proposed method

In general digital image processing, bilateral filter [25] and non-local means filter are proven to be effective methods to reduce image noise. Both of these filters are neighborhood filters, so they can be described by Eq. (4):

$$\overline{y}(i,j)=\sum_{i',j' \in \Omega } \omega (i',j')\cdot y(i',j') ,$$
where $\overline {y}(i,j)$ is the denoised grayscale of the pixel $(i,j)$, $y(i',j')$ is the grayscale of the pixel $(i',j')$ in the neighborhood window $\Omega$ of the pixel $(i,j)$, $\omega$ is the weight of the pixel $(i, j)$ to the pixel $(i', j')$. The weight comes from the similarity between pixels, and the more similar the pixels, the greater the weight. In the bilateral filter, the similarity is measured by the grayscale and distance between different pixels. In the non-local means filter, the similarity is measured by the grayscale and distance between the neighborhoods of different pixels. However, when calculating the weights of these two filters, only grayscale and distance are used. It often leads to inaccurate estimation of pixels. In addition, laser speckle is randomly distributed, and there is no specific noise model, which will greatly increase the error rate of estimation. Therefore, inspired by neighborhood filters [17,18,25] and the spatial mask method, we propose a neighborhood filter based on Pearson correlation coefficient [21] and multiple sub-holograms, which takes into account the random distribution of laser speckles in digital holography. The proposed filter improves the weight calculation more reasonably. It should be noted that the denoising target of the filter is the reconstructed image of the entire hologram, and the target of weight calculation is the reconstructed image of multiple sub-holograms. Here we focus on the weight calculation. The weight calculation process is divided into two steps.

In Step 1, $N$ sub-holograms are constructed by multiplying the original hologram and the moving binary mask window, as shown in Fig. 2. This method is mentioned in the spatial mask method [12]. The size of the entire hologram is $H_x$ x $H_y$, and the size of the mask window is $S_x$ x $S_y$, which is consistent with the size of the neighborhood window $\Omega$. Therefore, the number $N$ of sub-holograms can be calculated by Eq. (5):

$$N=[\frac{H_x-S_x}{d_x}+1]\cdot[\frac{H_y-S_y}{d_y}+1] ,$$
where, $d_x$ and $d_y$ are the movement intervals of the mask window on the $x$-axis and $y$-axis, respectively.

 figure: Fig. 2.

Fig. 2. Reconstruction process of multiple sub-holograms.

Download Full Size | PDF

In Step 2, we take the grayscale of the same pixels of the $N$ sub-reconstructed images as a data set. The data set corresponds to the same pixel of the denoising target (The reconstructed image of the entire hologram). The similarity between different pixels in the denoising target is measured by calculating the Pearson correlation coefficient between the data sets. Assuming $(i, j)$ is a denoising pixel in the denoising targe, the corresponding data set is $X^{(i, j)}$, which is described by Eq. (6):

$$X^{(i,j)}=\left\{{x^{(i,j)}_1, x^{(i,j)}_2, \ldots, x^{(i,j)}_N}\right\} .$$
The data set $X^{(i+k_1, j+k_2)}$ corresponding to other pixels in the neighborhood of the pixel $(i, j)$ can be described by Eq. (7):
$$X^{(i+k_1,j+k_2)}=\left\{{x^{(i+k_1,j+k_2)}_1, x^{(i+k_1,j+k_2)}_2, \ldots, x^{(i+k_1,j+k_2)}_N}\right\} ,$$
where both $k_1$ and $k_2$ are are determined by the neighborhood window $\Omega$ size ( $m$ x $n$), and $\frac {-(m-1)}{2}\le k_1\le \frac {m-1}{2}$, $\frac {-(n-1)}{2}\le k_2\le \frac {n-1}{2}$. Therefore, we can calculate the Pearson correlation coefficient between different pixels through $X^{(i, j)}$ and $X^{(i+k_1, j+k_2)}$. In addition, to describe the above process more vividly, we illustrate it in Fig. 3, which shows the calculation process of the Pearson correlation coefficient between the denoising pixel and the neighboring pixels when the neighborhood window size is 3 x 3. Figure 3(a) is a three-dimensional display of data sets, where the red pixel set is $X^{(i, j)}$, and the black box pixel sets are $X^{(i+k_1, j+k_2)}$. Figure 3(b) is a two-dimensional display of data sets. Figure 3(c) is the schematic diagram of the calculation of the Pearson correlation coefficient. It should be mentioned that the Pearson correlation coefficient between the denoising pixel and the neighboring pixel can be described by Eq. (8):
$$\begin{aligned} \rho (X^{(i,j)},X^{(i+k_1,j+k_2)}) =\frac{\sum_{t=1}^{N}(x^{(i,j)}_t- \overline{X^{(i,j)}})(x^{(i+k_1,j+k_2)}_t-\overline{X^{(i+k_1,j+k_2)}})}{\sqrt{\sum_{t=1}^{N}(x^{(i,j)}_t-\overline{X^{(i,j)}})^{2}{\sum_{t=1}^{N}(x^{(i+k_1,j+k_2)}_t-\overline{X^{(i+k_1,j+k_2)}}})^{2}}} . \end{aligned}$$
In statistics, the Pearson correlation coefficient is used to measure the similarity between two variables, and its value is between -1 and 1. It should be noted that the speckles of digital holography are randomly distributed [20], and the speckle patterns of different sub-reconstruction images obtained by moving the mask window are different [11,12]. Therefore, the correlation between these speckle patterns is very low, which indicates that in the denoising target, the similarity between the data set corresponding to the noise pixel and the data set corresponding to the clean pixel is very low. Therefore, using the Pearson correlation coefficient is reasonable to distinguish between the clean and noisy pixels. When $\rho$ is close to 1, the two pixels are very similar, and the weight is very large. When $\rho$ is close to 0 or negative, the pixels of the two windows are very low, and the weight is very small. So the weight can be described by Eq. (9):
$$\omega (i+k_1,j+k_2)=\frac{1}{C}\cdot \exp[ \frac{\rho (X^{(i,j)},X^{(i+k_1,j+k_2)})}{h^{2}}],$$
where $C$ is the normalization coefficient, and $h^{2}$ is a parameter controlling the filter size. Equation (4) is rewritten as:
$$\overline{y}(i,j)=\sum_{k_1}\sum_{k_2}\omega (i+k_1,j+k_2)\cdot y(i+k_1,j+k_2) .$$

 figure: Fig. 3.

Fig. 3. Illustration of Pearson’s correlation coefficient calculation in a neighborhood window $\Omega$ of 3x3.

Download Full Size | PDF

The above is the content of the weight calculation. To better describe our proposed neighborhood filtering method, we show the sequential steps for speckle reduction through Fig. 4. First, a reconstructed image with speckle noise is obtained by Fourier transforming the Fourier transform hologram. Second, determine the denoising pixel $(i,j)$. Third, determine the neighborhood $\Omega$ by the pixel $(i,j)$. Fourth, calculate the weight of pixels in $\Omega$ to the pixel $(i,j)$. The weight is calculated by the data set corresponding to the pixel $(i,j)$ and data sets corresponding to neighborhood pixels. Data sets are determined by the neighborhood $\Omega$ and multiple sub-reconstructed images. Finally, according to Eq. (10), we can estimate the new gray value of the pixel $(i,j)$ to achieve speckle noise reduction.

 figure: Fig. 4.

Fig. 4. Sequential steps of the proposed method for speckle reduction.

Download Full Size | PDF

3. Experimental result

Figure 5 shows the experimental setup of off-axis lensless Fourier transform digital holography. A He-Ne laser with a wavelength of 632.8nm is used as the light source. "BE" denotes the beam expander, and "BS" denotes the beam splitter. The beam splitting ratio of the beam splitter is 1:1. The resolution of the CCD is 960 x 1280, and the size of each pixel is 4.65${\mu }$m x 4.65${\mu }$m. The object of recording digital holograms is a coin. To meet the experimental requirements of lensless Fourier transform holography, the distance from the reference point light source P to the CCD should be equal to the distance from the object to the CCD.

 figure: Fig. 5.

Fig. 5. Experimental setup of off-axis lensless Fourier transform digital holography.

Download Full Size | PDF

We obtained a reconstructed image of a digital hologram using the experimental setup in Fig. 5, as shown in Fig. 6(a). As expected, the reconstructed image contains a lot of speckle noise. Figure 6(d) shows the effect of our method. At the same time, we selected the excellent non-local means method (NLM) in the neighborhood algorithm and spatial mask method (SDM) to compare with our method, as shown in Fig. 6(b)-6(c). The parameters for these three methods are: SDM ($S_x$ x $S_y$, 640 x 320; N, 320), NLM (the search window size, 9 x 9; the similarity window size, 7 x 7), and our method ($S_x$ x $S_y$, 640 x 320; $m$ x $n$, 9 x 9; N, 320; $h^{2}$, 0.5). As we can see, the three methods have different degrees of noise suppression. Compared to SDM and NLM, our method has more noise reduction. In addition, the right side of each image in Fig. 6 shows the magnification effect of the red box and the yellow box, which more clearly confirms that our algorithm has better noise reduction performance.

 figure: Fig. 6.

Fig. 6. (a) The reconstructed image of digital hologram with speckle. Denoised images with (b) SDM, (c) NLM and (d) our method.

Download Full Size | PDF

According to $RD(i,j)=(I(i,j)-\overline I)/\overline I$, we can estimate the relative deviation of each pixel in the image [26]. Figure 7(a)-7(d) show the relative deviation of the green boxes (contains the letter "Z") in Fig. 6. The original image has a lot of burrs (speckle), which will cause the letter "z" not to be identified. After the original image is processed by SDM and NLM, although the letter "Z" is slightly visible, the image still has more burrs. In contrast, after processing the image with our method, not only the letter "Z" is easy to recognize, but also the burr is greatly reduced. Additionally, Fig. 6 shows that our method loses edge and sharpness more than other methods. Our method is a neighborhood filtering method. Like other neighborhood filters, its speckle reduction is realized by the weighted sum of neighborhood pixel values. Although this weighted sum can weaken the noise intensity, it will also destroy the original image information. Therefore, We conduct an experiment to test how well our method destroys the edge information of the original image. This way is to extract a straight contour line from the image, which is located on the area with high black and white contrast information, as shown in the green line of Fig. 6(a). The experimental results are shown in Fig. 7(e)-7(h). It can be seen that our method does not break the edge information very much, and the contrast between the black area and the white area is large. Compared with SDM and NLM, Our method has lower noise contrast.

 figure: Fig. 7.

Fig. 7. (a)-(d) denote the relative deviation of the green boxes in Fig. 6(a)-6(d), and (e)-(h) denote the evolution of intensity profiles for the green lines in Fig. 6(a)-6(d).

Download Full Size | PDF

We further investigate the effect of the statistical properties of speckle on the performance of denoising methods. Figure 8 shows the gray histogram in the yellow boxes in Fig. 6. This histogram can reflect the statistical distribution of speckle. From Fig. 8, We can see that the noise distribution of the processed image has changed a lot. It is worth mentioning that the images processed by our method have a more concentrated distribution, which shows that our proposed method has a better speckle reduction effect.

 figure: Fig. 8.

Fig. 8. Gray histogram in the yellow boxes in Fig. 6. (a) Result of Fig. 6(a) (the reconstructed image); (b) result of Fig. 6(b) (NLM); (c) result of Fig. 6(c) (SDM); (d) result of Fig. 6(d) (our method).

Download Full Size | PDF

In addition to a qualitative evaluation of the images, we also performed quantitative analysis using three image quality evaluation metrics. These metrics are:

(a) Normalized Root Mean Square Error(NRMSE) [18], defined by

$$NRMSE=\sqrt{{\frac{1}{M \cdot N \cdot 255^{2}}}\sum_{i=1}^{M}\sum_{j=1}^{N}{[I_{out}(i,j)-I_{in}(i,j)]^{2}}},$$
where $M$ and $N$ are the sizes of the image, $I_{out}$ is the grayscale of the denoised image, and $I_{in}$ is the grayscale of the noise image. NRMSE is the point analysis in the multispectral space representing the amount of change in the original and corresponding output pixels after the implementation of data processing. The larger the NEMSE value, the more speckle is processed.

(b) Equivalent Number of Looks (ENL) [18], defined by

$$ENL=(\frac{\mu}{\sigma})^{2},$$
where $\mu$ and $\sigma$ are the mean gray level of the image and standard deviation, respectively. The ENL can reflect the speckle-noise reduction ability of different methods. The larger the ENL value, the smoother the image.

(c) Speckle Index (SI), defined by

$$SI={\frac{1}{M \cdot N}}\sum_{i=1}^{M}\sum_{j=1}^{N}{\frac{\sigma(i,j)}{\mu(i,j)}} ,$$
where $\sigma (i,j)$ and $\mu (i,j)$ are the standard deviation and the mean gray level in the neighborhood of the pixel $(i,j)$, respectively. SI decreases with speckle noise reduction.

Figure 9 shows the comparison of the three metrics values for the three methods (NLM, SDM, and our method). Without loss of generality, we choose the red box, yellow box, and green box of Fig. 6 as the calculation area. It can be seen that in the three boxes, the NRMSE and ENL of our method are the largest, and the SI of our method is the smallest, which shows that the performance of our method in metrics evaluation is also superior to NLM and SDM. Therefore, the quantitative and qualitative analysis has confirmed our method to be reliable. In other words, this method, which combines the spatial mask method and the neighborhood filter, is better than the spatial mask method and the original neighborhood filtering algorithm in speckle reduction.

 figure: Fig. 9.

Fig. 9. Evaluation metrics comparison between the SDM, NLM, and our method. (a) NRMSE, (b) ENL, and (c) SI.

Download Full Size | PDF

Our proposed method is a neighborhood filtering method whose denoising performance is affected by the size of the neighborhood window $\Omega$. In addition, the control parameter $h^{2}$ is another important factor that affects the speckle reduction performance. To this end, we designed an experiment to analyze the effect of $h^{2}$ and the neighborhood window size on filter performance. Figure 10 shows the change curves of the three image evaluation metrics and $h^{2}$ in the red box when the neighborhood window size is $'5 x 5'$, $'7 x 7'$, $'9 x 9'$. With the increase of $h^{2}$, SI has been decreasing, NRMSE and ENL have been increasing. When $h^{2}>0.5$, the three metrics values gradually tend to be stable. With the larger size of the neighborhood window, NRMSE and ENL keep increasing, and SI keeps decreasing. Comparison in NRMSE and ENL: $'5$ x $5'$ < $'7$ x $7'$ < $'9$ x $9'$, and Comparison in SI: $'5$ x $5'$ > $'7$ x $7'$ > $'9$ x $9'$. A reasonable selection of parameters can optimize the noise reduction performance of our method.

 figure: Fig. 10.

Fig. 10. Change curves of the three image evaluation metrics and $h^{2}$ in the red box. (a) the Change curves of NRMSE, (b) the Change curves of ENL, and (c) the Change curves of SI.

Download Full Size | PDF

The denoising performances of general digital image processing methods such as the Median filter, Wiener filter, Lee filter, Wavelet filter and BM3D have been compared with our method, as shown in Table 1. As before, our computational regions are still the red box, yellow box, and green box. The parameters for these methods are: Median filter (the filter window size, 3 x 3), Wiener filter (the filter window size, 3 x 3), Lee filter (the filter window size, 3 x 3), Wavelet filter (the mother wavelet, ’db’; the decomposition scale, 3), BM3D (the search window size, 9 x 9; the similarity window size, 7 x 7), and our method ($S_x$ x $S_y$, 640 x 320; $m$ x $n$, 9 x 9; N, 320; $h^{2}$, 0.5). According to the data of the three regions in Table 1, it can be concluded that the advantages of our method in NRMSE, ENL, and SI are obvious. It needs to be further emphasized that the comparison in ENL reflects the better smoothing effect of our method, and the comparison in SI reflects the lower noise level of our method. Therefore, in the field of coherent noise reduction, this digital image processing method that can take into account noise distribution characteristics has better performance than traditional digital image processing methods.

Tables Icon

Table 1. Performance comparison between the Median filter, Wiener filter, Wavelet filter, Lee filter, BM3D, and our method.

4. Conclusion

Speckle noise is inevitable in digital holography. To eliminate speckle noise as much as possible, many denoising methods have been developed. Due to the random distribution of speckles, it is difficult for general digital image processing methods to obtain a good denoising effect. This paper proposes an innovative method, which combines the spatial masking method and neighborhood filters. This method analyzes the distribution characteristics of speckles according to the multiple sub-reconstructed images obtained by using the mask. Experiment results show that this method is more effective than the general method in reducing the speckle noise of digital holography. In addition, this method is specially designed for digital holographic speckle noise, which can provide a new idea in the field of digital holographic speckle denoising.

Funding

National Natural Science Foundation of China (62175039).

Disclosures

The authors declare that there are no conflicts of interest related to this article.

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. H. Lee, J. Kim, J. Kim, P. Jeon, S. A. Lee, and D. Kim, “Noniterative sub-pixel shifting super-resolution lensless digital holography,” Opt. Express 29(19), 29996–30006 (2021). [CrossRef]  

2. J. Li, A. Tian, H. Wang, X. Zhu, C. Wang, B. Liu, and A. Asundi, “Microstructure measurement of digital holography,” in The International Conference on Photonics and Optical Engineering (icPOE 2014), vol. 9449 (International Society for Optics and Photonics, 2015), p. 94493O.

3. C. Lin, Y. Han, S. Lou, and Z. Li, “High spectral and spatial resolved encryption and decryption of 3d color object based on holographic imaging spectroscopy,” Opt. Lasers Eng. 145, 106669 (2021). [CrossRef]  

4. M. Kumar, O. Matoba, X. Quan, S. K. Rajput, Y. Awatsuji, and Y. Tamada, “Single-shot common-path off-axis digital holography: applications in bioimaging and optical metrology,” Appl. Opt. 60(4), A195–A204 (2021). [CrossRef]  

5. J. Dong, S. Jia, and H. Yu, “Hybrid method for speckle noise reduction in digital holography,” J. Opt. Soc. Am. A 36(12), D14–D22 (2019). [CrossRef]  

6. F. Monroy, O. Rincon, Y. M. Torres, and J. Garcia-Sucerquia, “Quantitative assessment of lateral resolution improvement in digital holography,” Opt. Commun. 281(13), 3454–3460 (2008). [CrossRef]  

7. T. Nomura, M. Okamura, E. Nitanai, and T. Numata, “Image quality improvement of digital holography by superposition of reconstructed images obtained by multiple wavelengths,” Appl. Opt. 47(19), D38–D43 (2008). [CrossRef]  

8. T.-W. Su, S. O. Isikman, W. Bishara, D. Tseng, A. Erlinger, and A. Ozcan, “Multi-angle lensless digital holography for depth resolved imaging on a chip,” Opt. Express 18(9), 9690–9711 (2010). [CrossRef]  

9. C.-K. Lo and J.-W. Pan, “Speckle reduction with fast electrically tunable lens and holographic diffusers in a laser projector,” Opt. Commun. 454, 124301 (2020). [CrossRef]  

10. Y. Wang, P. Meng, D. Wang, L. Rong, and S. Panezai, “Speckle noise suppression in digital holography by angular diversity with phase-only spatial light modulator,” Opt. Express 21(17), 19568–19578 (2013). [CrossRef]  

11. D. Hincapie, J. Herrera-Ramírez, and J. Garcia-Sucerquia, “Single-shot speckle reduction in numerical reconstruction of digitally recorded holograms,” Opt. Lett. 40(8), 1623–1626 (2015). [CrossRef]  

12. T. Fukuoka, Y. Mori, and T. Nomura, “Speckle reduction by spatial-domain mask in digital holography,” J. Disp. Technol. 12(4), 315–322 (2015). [CrossRef]  

13. T. Yassine, S. Ahmed, and N. Abdelkrim, “Speckle noise reduction in digital speckle pattern interferometry using riesz wavelets transform,” in 2017 International Conference on Advanced Technologies for Signal and Image Processing (ATSIP), (IEEE, 2017), pp. 1–4.

14. D. G. A. Ibrahim, “Improving the intensity-contrast image of a noisy digital hologram by convolution of chebyshev type 2 and elliptic filters,” Appl. Opt. 60(13), 3823–3829 (2021). [CrossRef]  

15. J.-M. Leng, F.-B. Li, and H.-L. Li, “Speckle reduction by optical pre-processing and digital filtering in digital holography,” Lasers in Engineering (Old City Publishing) 44, 227–238 (2019).

16. A. Buades, B. Coll, and J.-M. Morel, “Non-local means denoising,” Image Processing On Line 1, 208–212 (2011). [CrossRef]  

17. A. Uzan, Y. Rivenson, and A. Stern, “Speckle denoising in digital holography by nonlocal means filtering,” Appl. Opt. 52(1), A195–A200 (2013). [CrossRef]  

18. Y. Tounsi, M. Kumar, A. Nassim, and F. Mendoza-Santoyo, “Speckle noise reduction in digital speckle pattern interferometric fringes by nonlocal means and its related adaptive kernel-based methods,” Appl. Opt. 57(27), 7681–7690 (2018). [CrossRef]  

19. K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, “Image denoising with block-matching and 3d filtering,” in Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning, vol. 6064 (International Society for Optics and Photonics, 2006), p. 606414.

20. J. W. Goodman, “Some fundamental properties of speckle,” J. Opt. Soc. Am. A 66(11), 1145–1150 (1976). [CrossRef]  

21. J. Benesty, J. Chen, Y. Huang, and I. Cohen, “Pearson correlation coefficient,” in Noise reduction in speech processing, (Springer, 2009), pp. 1–4.

22. W. Lin, L. Chen, Y. Chen, W. Cai, Y. Hu, and K. Wen, “Single-shot speckle reduction by elimination of redundant speckle patterns in digital holography,” Appl. Opt. 59(16), 5066–5072 (2020). [CrossRef]  

23. U. Schnars and W. Jüptner, “Direct recording of holograms by a ccd target and numerical reconstruction,” Appl. Opt. 33(2), 179–181 (1994). [CrossRef]  

24. Q. Fan and J. Zhao, “Resolution analysis of digital holography,” in ICO20: Optical Information Processing, vol. 6027 (International Society for Optics and Photonics, 2006), p. 60273J.

25. H. Salehi and J. Vahidi, “An ultrasound image despeckling method based on weighted adaptive bilateral filter,” Int. J. Image Grap. 20(03), 2050020 (2020). [CrossRef]  

26. W. Jeon, W. Jeong, K. Son, and H. Yang, “Speckle noise reduction for digital holographic images using multi-scale convolutional neural networks,” Opt. Lett. 43(17), 4240–4243 (2018). [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 (10)

Fig. 1.
Fig. 1. Lensless Fourier hologram recording structure.
Fig. 2.
Fig. 2. Reconstruction process of multiple sub-holograms.
Fig. 3.
Fig. 3. Illustration of Pearson’s correlation coefficient calculation in a neighborhood window $\Omega$ of 3x3.
Fig. 4.
Fig. 4. Sequential steps of the proposed method for speckle reduction.
Fig. 5.
Fig. 5. Experimental setup of off-axis lensless Fourier transform digital holography.
Fig. 6.
Fig. 6. (a) The reconstructed image of digital hologram with speckle. Denoised images with (b) SDM, (c) NLM and (d) our method.
Fig. 7.
Fig. 7. (a)-(d) denote the relative deviation of the green boxes in Fig. 6(a)-6(d), and (e)-(h) denote the evolution of intensity profiles for the green lines in Fig. 6(a)-6(d).
Fig. 8.
Fig. 8. Gray histogram in the yellow boxes in Fig. 6. (a) Result of Fig. 6(a) (the reconstructed image); (b) result of Fig. 6(b) (NLM); (c) result of Fig. 6(c) (SDM); (d) result of Fig. 6(d) (our method).
Fig. 9.
Fig. 9. Evaluation metrics comparison between the SDM, NLM, and our method. (a) NRMSE, (b) ENL, and (c) SI.
Fig. 10.
Fig. 10. Change curves of the three image evaluation metrics and $h^{2}$ in the red box. (a) the Change curves of NRMSE, (b) the Change curves of ENL, and (c) the Change curves of SI.

Tables (1)

Tables Icon

Table 1. Performance comparison between the Median filter, Wiener filter, Wavelet filter, Lee filter, BM3D, and our method.

Equations (13)

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

I = | R + O | 2 = | R | 2 + | O | 2 + R O + R O ,
I = a 2 + | O | 2 + a exp [ j 2 π β y ] O + a exp [ j 2 π β y ] O ,
I c = C a 2 + C | O | 2 + C a exp [ j 2 π β y ] O + C a exp [ j 2 π β y ] O ,
y ¯ ( i , j ) = i , j Ω ω ( i , j ) y ( i , j ) ,
N = [ H x S x d x + 1 ] [ H y S y d y + 1 ] ,
X ( i , j ) = { x 1 ( i , j ) , x 2 ( i , j ) , , x N ( i , j ) } .
X ( i + k 1 , j + k 2 ) = { x 1 ( i + k 1 , j + k 2 ) , x 2 ( i + k 1 , j + k 2 ) , , x N ( i + k 1 , j + k 2 ) } ,
ρ ( X ( i , j ) , X ( i + k 1 , j + k 2 ) ) = t = 1 N ( x t ( i , j ) X ( i , j ) ¯ ) ( x t ( i + k 1 , j + k 2 ) X ( i + k 1 , j + k 2 ) ¯ ) t = 1 N ( x t ( i , j ) X ( i , j ) ¯ ) 2 t = 1 N ( x t ( i + k 1 , j + k 2 ) X ( i + k 1 , j + k 2 ) ¯ ) 2 .
ω ( i + k 1 , j + k 2 ) = 1 C exp [ ρ ( X ( i , j ) , X ( i + k 1 , j + k 2 ) ) h 2 ] ,
y ¯ ( i , j ) = k 1 k 2 ω ( i + k 1 , j + k 2 ) y ( i + k 1 , j + k 2 ) .
N R M S E = 1 M N 255 2 i = 1 M j = 1 N [ I o u t ( i , j ) I i n ( i , j ) ] 2 ,
E N L = ( μ σ ) 2 ,
S I = 1 M N i = 1 M j = 1 N σ ( i , j ) μ ( i , j ) ,
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.