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

Application of global phase filtering method in multi frequency measurement

Open Access Open Access

Abstract

In reverse engineering, reconstruction of 3D point cloud data is the key step to acquire the final profile of the object. However, the quality of 3D reconstruction is influenced by noise in the three-dimensional measurement. This paper aims to tackle the issue of removing the noisy data from the complex point cloud data. The 3D-GPF (Three Dimensional Global Phase Filtering) global phase filtering method is proposed based on the study of phase filtering method, consisting of the steps below. Firstly, the six-step phase shift profilometry is used to obtain the local phase information, and encoding the obtained phase information. Through the global phase unwrapping method, the global phase can be acquired. Secondly, 3D-GPF method is used for the obtained global phase. Finally, the effect of 3D reconstruction is analyzed after the global phase filtering. Experimental results indicate that the noisy points of three-dimensional graphics is reduced 98.02%, the speed of 3D reconstruction is raised 12%.The effect of the proposed global phase filtering method is better than DCT and GSM methods. It is high precision and fast speed, and can be widely used in other 3D reconstruction application.

© 2014 Optical Society of America

1. Introduction

3D shape measurement based on fringe pattern projection is widely used in the manufacturing inspection, medical sciences, reverse engineering, etc. It has the advantages of fast speed, high accuracy, easy to detect free-form surface, real 3D scene pick-up [1], etc. However, the quality of 3D image reconstruction often suffers from the influence of noise associated with the measurement. Therefore, image denoising has been an active topic of research and a few approached have been proposed in order to improve the quality of the 3D images, such as the following:

DCT (Discrete Cosine Transformation) method: Yang, et al. [2] proposed a method using three-dimensional block matching to remove Gauss noise of image. Danielyan, et al. [3] demonstrated that the Block-Matching 3D (BM3D) filter can significantly improve the quality of two-photon fluorescence images. Kang, et al. [4] studied the statistical characteristics of self-similarity presented a two-stage 3D filtering algorithm to eliminate the noise in images. However, these DCT algorithms are of local pixel level in nature where the statistical features of the global image are not considered.

GSM (Gaussian Scale Mixtures) method: Theis, et al. [5] presented a probabilistic model for natural images based on mixtures of Gaussian scale mixtures and a simple multi-scale representation. Goossens, et al. [6] proposed a statistical model for image restoration in which neighborhoods of wavelet subbands are modeled by a discrete mixture of linear projected Gaussian Scale Mixtures (MPGSM). This algorithm described the correlation between the shape of the edge and neighborhood coefficients in the wavelets, but the local structures cannot be well described.

NLMID (Non-local Means Image Denoising) method: Wu, et al. [7] presented a structure-tensor based on non-local mean (NLM) denoising technique that can effectively reduce noise in MRI data and improve tissue characterization. Hou, et al. [8] proposed a programmable GPU (graphic processor unit) based on fast NLM filter for 3D ultrasound speckle reduction. Jiang, et al. [9] proposed an improved bilateral filtering algorithm based on the signal structure. Yu, et al. [10] introduced a 3D space-time non-adaptive pre-filtering approach in airborne radar. The speed of 3D measurement can be improved with this method. However, the phase filtering method cannot retain the phase information effectively when removing the noise, and a lot of useful phase information can get lost.

In conclusion, it's very necessary to look for an algorithm which considers the statistical features of the global image, involves low computational complexity and has excellent denoising performance. Based on the former research of our laboratory [11], we propose to employ a 3D-GPF (Three Dimensional Global Phase Filtering) global phase filtering method for solving the challenging problem of noise removal. The proposed method uses the six-step phase shift profilometry (PSP) method to obtain the local phase information. The proposed method can be considered as a new NLMID method. In contrast to existing techniques, the proposed is advantageous in a number of aspects. The proposed is better than the local phase filtering methods in its capability of eliminating the noisy disturbance. And the method proposed can protect the structure information of the original image. Also, with the proposed method the speed of 3D measurement can be improved. The proposed method is suitable to other 3D reconstruction methods, such as multiple frequency method as well as the gray (code) method.

2. The unwrapping principle of multi frequency phase

A fringe pattern with its light intensity exhibiting sinusoidal variance can be expressed as follows:

I(x)=a(x,y)sin(φ(x,y))

In actual measurement, due to the influence of background light, the intensity of the observed can be written as:

Ir(x,y)=b(x,y)+a(x,y)sin(φ(x,y)+δ(x,y))
Whereb(x,y)is the background intensity, a(x,y)is the intensity modulation, δ(x,y)is phase shift value. For the six-step PSP, six image patterns are projected, as shown by the following:

Irk(x,y)=b(x,y)+a(x,y)sin(φ(x,y)+π×k6),k=0,1,...,5

And the wrapped phase valueφ(x,y)can be calculated by:

φ(x,y)=arctanIr3(x,y)Ir5(x,y)Ir4(x,y)Ir1(x,y)+(Ir3(x,y)Ir5(x,y))
Whereφ(x,y)is the wrapped phase ranging fromπto+πwith2πdiscontinuities. In order to recover the 3D shape, the global phase is required and given by the following [12]:
φG(x,y)=φi(x,y)+2π×M(x,y)
Where φG(x,y)is the global phase, φi(x,y)is the local phase. M(x,y)is the code of the point (x,y), which can be calculated from the previous work in our lab [11,12]. If only a single fringe stripe is used, φG(x,y) = φi(x,y)andM(x,y)≡0, and phase unwrapping is not needed. However, for multiple fringe stripes, M(x,y) is not always 0. When fringe patterns are projected with three wavelengths, i.e.,λ1,λ2andλ3. The two patterns with wavelength λ1andλ2can generate an equivalent pattern with the longer wavelengthλ12; similarly, λ2andλ3can generate the longer equivalent wavelengthλ23. These two equivalent wavelengthsλ12andλ23can also generate the even longer equivalent wavelengthλ123. These equivalent wavelengthsλ12, λ23andλ123can be calculated by:

λ12=|λ1×λ2λ1λ2|,λ23=|λ2×λ3λ2λ3|,λ123=|λ12×λ23λ12λ23|

In order for the measurement to cover the whole area of interest, the equivalent wavelengthλ123should be larger than the number of pixels perpendicular to the fringe strips in the fringe patterns, that is, λ123W, where Wdenotes the number of horizontal pixels of the projector (for the case of vertical fringe strips) or the number of vertical pixels (for horizontal fringe stripes).

For eachλ123, there areλ123/λ12discontinuities on the phase map of the pattern with the wavelengthλ12, and there are λ123/λ23discontinuities on the phase maps of the wavelengthλ23. In order words, the phase value of the pattern of wavelengthλ12 can be divided toλ123/λ12parts by the discontinuities. Similarly, the phase value of the pattern with wavelengthλ1can be divided intoλ12/λ1parts. So there are altogether (λ123/λ12) × (λ12/λ1) discontinuities for the pattern with wavelengthλ1. Therefore, when these three fringe patterns are projected onto a point(x,y), six phasesφ1(x,y),φ2(x,y), φ3(x,y), φ12(x,y), φ23(x,y), φ123(x,y)can be obtained, based on which M(x,y) can be determined by:

M(x,y)={int(φ123(x,y)2π×λ123λj)×λjλi+int(φj(x,y)2π×λjλi),φi(x,y)2πandφj(x,y)2πandφ123(x,y)2πint(φ123(x,y)2π×λ123λj)×λjλi+int(φj(x,y)2π×λjλi)1,(φi(x,y)=2πorφj(x,y)=2πandφ123(x,y)2πint(φ123(x,y)2π×λ123λj1)×λjλi+int(φj(x,y)2π×λjλi),φi(x,y)2πandφj(x,y)2πandφ123(x,y)=2π
Where for φ1(x,y), i=1,j=12; forφ2(x,y),i=3,j=23; forφ3(x,y), its value can be calculated fromλ12andλ23, so i=2,j=12or i=2,j=23.

With the method described above,the global phase maps can be recovered for the surfaces with discontinuities or sharp changes in their shape.

3. The filtering principle of global phase

The global phase recovery is influenced by color, and shape of object surface, as well as background light, and so the recovered global phase will not be not uniformly increasing line over x. Let us consider an example for the measurement of a plaster and models shown in Fig. 1 (a). One of images from the six-step PSP is shown in Fig. 1 (b). The local phase and the global phase of the 512 line in Fig. 1 are shown in Fig. 2 and Fig. 3 respectively. It is seen that the global phase contains many random noisy points. In order to ensure the accuracy and reliability of 3D measurement, these points must be removed.

 figure: Fig. 1

Fig. 1 Protecting the six steps PSP with one wavelength onto a fingerprint. (a) The fingerprint to be measured. (b) One of images from the six steps PSP with one wavelength.

Download Full Size | PDF

 figure: Fig. 2

Fig. 2 The partial phase diagram of the line 512

Download Full Size | PDF

 figure: Fig. 3

Fig. 3 The global phase diagram of the line 512

Download Full Size | PDF

Slope filtering method is a commonly used method to make the phase a linear increasing function. However, the values of the slope may change over different measurement points. A method for the difference of adjacent slope is proposed to filter the global phase. Firstly, the line slope of the adjacent points is calculated to obtain the absolute subtraction's result between the two slopes. If the obtained results are less than the threshold value, the line of the three points is smooth; otherwise, there is a noise at least in the three points. Secondly, some points conform to the above rules are searched, searching the adjacent points before and after the point, if the front point is a breakpoint, in front of all the breakpoint will be set to the noisy points. If the back point is a breakpoint, from the point before the breakpoint, searching some new points which conform to the above rules. Finally, based on the new points, searching more points which meet the rules, until all the points be searched. The judging criterion is that when the number of the breakpoint is less than or equal to the number of the noisy points, the curve appears breakpoints, and then a new datum point need to be found. The proposed method to filter the global phase using different slops over adjacent points is based on the continuous conditions (Eq. (8) below) and smooth conditions (Eq. (9) below), described respectively by the following:

limxx1+f(x)=limxx1-f(x)
and

limxx1+f'(x)=limxx1-f'(x)

The specific process of the global phase filtering is as follows.

Let us assume that the resolution of the image is N by M pixels (i.e., N rows and M columns, each line of the image has M pixels). For the consecutive natural numbers x1、x2、 ……、xm, y1、y2、……、ym is their reflection. According to the continuous conditions and smooth conditions, the slope of two adjacent points (k and j) must be calculated, it can be written as:

K=ykyjxkxj

The processing points are discrete points, so we must change the continuous conditions and smooth conditions based on the value of the slope between two adjacent points. In order to access the smoothness of the points, we should calculate the slops of two adjacent pairs of two adjacent points. In other words, for the three consecutive points i, j, and k, the two slopes are:

K1=yjykxjxk,K2=yiyjxixj

According to the rules of the smooth conditions, these three points are considered as smooth if |K1K2|ε, whereεis the threshold for decision making. If |K1K2|>ε, the three points will be considered as a noisy group, as at least one point among the three points contains noise. When the noisy points are eliminated, the continuous conditions can be defined. Assume that the resolving power of the image is N by M pixels, M noise phase values need to be removed in each row. X is the horizontal ordinate of these phase points; it changes from 1 to M. Y is the phase value. Theoretically, Y should be an increasing linear function. However, due to the background interference and other reasons, there are a lot of noisy points in the Y, the noisy part of Y is scattered data points, and the normal part is still local linear increasing function. Normally, X should be increasing (decreasing), and the increased (decreased) value is a constant, it can be expressed as:

xjxka(aisaconstant)

Now we applied the above to the phase map in Fig. 3, and the results are shown in Fig. 4. It is clear that the noisy points in Fig. 3 are effectively eliminated.

 figure: Fig. 4

Fig. 4 The denoising global phase diagram of the line 512

Download Full Size | PDF

4.Experiments

In order to clearly show the performance of the proposed denoising method, let us take a segment of the phase map obtained from Fig. 1 for the 26th fringe strip, as shown in Fig. 5. Without using the proposed method, the phase diagram contains many noisy points as shown in Fig. 5(a). After the global phase filtering, most of noisy points have been removed; as witnessed by the phase map shown in Fig. 5(b). Also, we construction the 3D shape based on the two phase maps respectively. Figure 6(a) shows the 3D reconstruction is very poor without using the proposed method. With the global phase filter, the 3D reconstruction of the plaster hand model is much better as shown in Fig. 6(b).

 figure: Fig. 5

Fig. 5 A cycle's phase of the encoded point M = 26. (a) The phase diagram before removing the noisy points. (b) The phase diagram after removing the noisy points.

Download Full Size | PDF

 figure: Fig. 6

Fig. 6 The effect of 3D reconstruction. (a) The effect of 3D reconstruction without global phase filter. (b) The effect of 3D reconstruction after global phase filter.

Download Full Size | PDF

To further verify the effectiveness of this method, the statistical data is collected to measure the performance of 3D reconstruction by means of the number of the noisy points and the speed of 3D reconstruction. The results for the case in Fig. 6 are shown in Table 1. It is clear that the number of 3D noisy points can be significantly reduced by the proposed method. The speed of 3D reconstruction is also increased.

Tables Icon

Table 1. the number of noisy points and the speed of 3D reconstruction comparison

5.Conclusions

We proposed a new denoising approach for the global phase map for 3D profilometry based on digital projection. In contrast to existing techniques, the proposed is advantageous in a number of aspects:

  • 1) Better denoising effect: based on the global phase, the global phase filtering method is proposed in this paper, it has better effect than the local phase filtering method, and it can effectively eliminate the noisy disturbance.
  • 2) Effectively retained the available phase information: for the existing phase filtering methods, a lot of useful phase information is also removed in removing noisy points, the method in this paper can retain the phase information effectively when removing all the noisy signals.
  • 3) High speed: the number of the noisy points is less than other filtering methods, so the speed of 3D measurement can be improved.
  • 4) Suit to different 3D reconstruction methods: the proposed phase filtering method is based on the absolute phase value, so the proposed method is suitable to other 3D reconstruction methods, such as multiple frequency method as well as the gray (code) method.

Acknowledgments

This research is supported by the National Natural Science Foundation of China (Nos. 60808020 and 61078041) and the Tianjin Research Program of Application Foundation and Advanced Technology (No. 10JCYBJC07200). Thanks for the support from National Natural Science Foundation Committee and Tianjin Research Program of Application Foundation and Advanced Technology. This research is also supported by the Tianjin Key Laboratory of Advanced Electrical Engineering and Energy Technology.

References and links

1. X. X. Jiao, X. Zhao, Y. Yang, Z. L. Fang, and X. C. Yuan, “Dual-camera enabled real-time three-dimensional integral imaging pick-up and display,” Opt. Express 20(25), 27304–27311 (2012). [CrossRef]   [PubMed]  

2. J. Yang, Z. H. Jia, X. Z. Qin, J. Yang, and Y. J. Hu, “BM3D Image Denoising Based on Shape-adaptive Principal Component Analysis,” Comput. Eng. 39(3), 241–244 (2013).

3. A. Danielyan, Y. W. Wu, P. Y. Shih, Y. Dembitskaya and A. Semyanov, “Denoising of two-photon fluorescence images with Block-Matching 3D filtering,” Methods, Japan, Epub 20 Mar. (2014).

4. C. Q. Kang, W. Q. Cao, L. Hua, L. Fang, and H. Chen, “Infrared image denoising algorithm via two-stage 3D filtering,” Laser Infrared. 43(3), 261–264 (2013).

5. L. Theis, R. Hosseini, and M. Bethge, “Mixtures of conditional Gaussian scale mixtures applied to multiscale image representations,” PLoS ONE 7(7), e39857 (2012). [CrossRef]   [PubMed]  

6. B. Goossens, A. Pizurica, and W. Philips, “Image denoising using mixtures of projected Gaussian Scale Mixtures,” IEEE Trans. Image Process. 18(8), 1689–1702 (2009). [CrossRef]   [PubMed]  

7. X. Wu, S. J. Liu, M. Wu, H. Q. Sun, J. L. Zhou, Q. Y. Gong, and Z. H. Ding, “Nonlocal denoising using anisotropic structure tensor for 3D MRI,” Med. Phys. 40(10), 101904 (2013). [CrossRef]   [PubMed]  

8. L. Li, W. Hou, X. Zhang, and M. Ding, “GPU-based block-wise nonlocal means denoising for 3D ultrasound images,” Comput. Math. Methods Med. 2013, 921303 (2013). [CrossRef]   [PubMed]  

9. X. M. Chen, L. T. Jiang, and R. D. Ying, “Research of 3D reconstruction and filtering algorithm based on depth information of Kinect,” Appl. Res. Comput. 30(4), 1216–1218 (2013).

10. H. B. Yu, D. Z. Feng, Y. Cao, and X. K. Yao, “Three-dimensional Space-time Nonadaptive Pre-filtering Approach in Airborne Radar,” J. Electron. Inf. Technol. 36(1), 215–219 (2014).

11. L. M. Song, X. X. Dong, J. T. Xi, Y. G. Yu, and C. K. Yang, “A new phase unwrapping algorithm based on Three Wavelength Phase Shift Profilometry method,” Opt. Laser Technol. 45, 319–329 (2013). [CrossRef]  

12. L. M. Song, C. M. Chen, L. Zhang, and X. X. Dong, “High Precision Global Phase Unwrapping Method Used in the Multi-frequency 3D Measurement,” Opt. Electron Eng. 39(12), 18–25 (2012).

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 Protecting the six steps PSP with one wavelength onto a fingerprint. (a) The fingerprint to be measured. (b) One of images from the six steps PSP with one wavelength.
Fig. 2
Fig. 2 The partial phase diagram of the line 512
Fig. 3
Fig. 3 The global phase diagram of the line 512
Fig. 4
Fig. 4 The denoising global phase diagram of the line 512
Fig. 5
Fig. 5 A cycle's phase of the encoded point M = 26. (a) The phase diagram before removing the noisy points. (b) The phase diagram after removing the noisy points.
Fig. 6
Fig. 6 The effect of 3D reconstruction. (a) The effect of 3D reconstruction without global phase filter. (b) The effect of 3D reconstruction after global phase filter.

Tables (1)

Tables Icon

Table 1 the number of noisy points and the speed of 3D reconstruction comparison

Equations (12)

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

I(x)=a(x,y)sin(φ(x,y))
I r (x,y)=b(x,y)+a(x,y)sin(φ(x,y)+δ(x,y))
I rk (x,y)=b(x,y)+a(x,y)sin(φ(x,y)+ π×k 6 ),k=0,1,...,5
φ(x,y)=arctan I r3 (x,y) I r5 (x,y) I r4 (x,y) I r1 (x,y)+( I r3 (x,y) I r5 (x,y))
φ G (x,y)= φ i (x,y)+2π×M(x,y)
λ 12 =| λ 1 × λ 2 λ 1 λ 2 |, λ 23 =| λ 2 × λ 3 λ 2 λ 3 |, λ 123 =| λ 12 × λ 23 λ 12 λ 23 |
M(x,y)={ int( φ 123 (x,y) 2π × λ 123 λ j )× λ j λ i +int( φ j (x,y) 2π × λ j λ i ), φ i (x,y)2πand φ j (x,y)2πand φ 123 (x,y)2π int( φ 123 (x,y) 2π × λ 123 λ j )× λ j λ i +int( φ j (x,y) 2π × λ j λ i )1,( φ i (x,y)=2πor φ j (x,y)=2πand φ 123 (x,y)2π int( φ 123 (x,y) 2π × λ 123 λ j 1)× λ j λ i +int( φ j (x,y) 2π × λ j λ i ), φ i (x,y)2πand φ j (x,y)2πand φ 123 (x,y)=2π
lim x x 1 + f(x)= lim x x 1 - f(x)
lim x x 1 + f'(x)= lim x x 1 - f'(x)
K= y k y j x k x j
K 1 = y j y k x j x k , K 2 = y i y j x i x j
x j x k a(aisaconstant)
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.