Digital Signal Processing
|
|
- Mitchell Bailey
- 5 years ago
- Views:
Transcription
1 Digital Signal Processing 0 010) Contents lists available at ScienceDirect Digital Signal Processing Convolution wavelet packet transform and its applications to signal processing Xuezhi Zhao, Bangyan Ye School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou , People s Republic of China article info abstract Article history: Available online 7 January 010 Keywords: Convolution wavelet packet transform Decomposition and reconstruction Length invariance Signal processing Noise reduction The length of decomposition results of traditional wavelet packet transform WPT) will decrease by half in the next level for downsampling, then the length of sequences in the last level will become very short, and this is very inconvenient for further analysis of these sequences. One kind of WPT based on convolution definition is put forward, its fast decomposition and reconstruction algorithms are given, and the outstanding characteristic of this convolution WPT is that no matter how many levels a signal is decomposed, the length of sequences got in every level will never decrease and can always keep the same as that of the original signal, so the defect of traditional WPT is overcome. For traditional WPT, to achieve the same effect of direct decomposition of convolution WPT, reconstruction operation must be done and the calculation will greatly increase. Based on the length invariance property of convolution WPT, a noise reduction algorithm is proposed, and signal processing example shows that its denoising performance is better than that of traditional WPT, and also much better than that of wavelet transform. 010 Elsevier Inc. All rights reserved. 1. Introduction As is well known, wavelet packet transform WPT) is a further decomposition for wavelet transform, and both the approximation and detail signals obtained by wavelet transform at each level will be further decomposed by WPT, so results with higher resolution in time and frequency domain can be got. According to the traditional wavelet packet theory, the WPT of signal xt) is defined as follows x n, j p = j/ xt)μ n j t ) p dt, 0 j S, 0 n S 1, 1) R where μ n t) is wavelet packet function, j is the number of decomposition level, or so-called scale parameter, p is the position parameter, n is the channel number, S is the maximum decomposition level. For signal xt), after it is decomposed by WPT, S sequences can be got in the Sth level. The corresponding fast decomposition algorithm for this kind of WPT is [1] x x n, j+1 k n+1, j+1 k = p Z = p Z hp k)x n, j p, gp k)x n, j p, ) * Corresponding author. Fax: address: mezhaoxz@scut.edu.cn X. Zhao) /$ see front matter 010 Elsevier Inc. All rights reserved. doi: /j.dsp
2 X. Zhao, B. Ye / Digital Signal Processing 0 010) where hi) and gi) are wavelet quadrature mirror filter QMF) coefficients. Eq. ) is the classical decomposition formula of WPT, and in the wide engineering applications of WPT, such as feature extraction for heart rate variability HRV) signal [] and electroencephalogram EEG) signals [3], the analysis for the impulsive energy of the vibration signal of water hydraulic motor [4], gearbox fault detection [5], online tracking of bearing wear [6], fault diagnosis of rotating machinery and monitoring of machining processes [7 9], texture classification [10] and so on, they are all based on this decomposition formula. The outstanding characteristic of this formula is the downsampling, which means that when computing the sequences in the j + 1)th level, for the data of sequences in the jth level, only those ones in the even points can be sampled to calculate the sequences in the j + 1)th level. So compared with the length of sequences in the jth level, the one in the j + 1)th level will decrease by half. For example, if the length of original signal is 104, then after decomposition of WPT, the length of the sequences got in the first level will decrease to 51, in the second level will decrease to 56, etc., like this way the length of sequences in the next level will always decrease by half, so for the sequences in the last level, their length will become very short. This length degression of WPT may be very useful in data compression domain [10,11], but it s very discommodious in fault diagnosis domain [4 9]. Because for getting the reliable diagnosis results, those sequences in the last level will always be further analyzed, but their short length will make against the further analysis. For example, in order to get the accurate fast Fourier transform FFT) result of a sequence with high frequency resolution, in general the length of this sequence is required to be more than 64 at least. Supposing the length of original signal is 104, and the maximum decomposition level is S = 5, then after decomposition of WPT, for those sequences in the fifth level, their length will all decrease to 3, and their lengths are so short that the FFT results with high frequency resolution can t be got. In addition, it s also very difficult to observe the waveform feature of these sequences for their too short length. In order to further analyze these sequences of the last level or observe their waveform feature, the only way is to use them to do reconstruction calculation. The reconstruction formula of WPT is x n, j p = [ n, j+1 n+1, j+1] hp k)x + gp k)x k k. 3) Corresponding to the downsampling in the decomposition formula, the characteristic of this reconstruction one is upsampling, i.e. before computing x n, j n, j+1 n+1, j+1 p, for sequences x and x, one zero will be inserted between every two adjacent k k data of these two sequences. By virtue of this reconstruction operation, the length of the sequences in the last level will recover to that of the original signal, then the further analysis for these sequences can go on. For example, in Refs. [4 9], to reveal the feature in the decomposition results of WPT, the reconstruction operation of WPT had to be made so that the decomposition results can recover to the same length of original signal and then the features can be clear shown. However, this reconstruction process is a troublesome matter, moreover its calculation will also greatly increase. Whether there is a WPT by which a signal is decomposed, the length of sequences, no matter which level these sequences are located in, will never decrease and can always keep the same as that of the original signal? To solve this problem, one kind of convolution WPT is put forward in this paper, and the fast decomposition and reconstruction algorithm for this WPT are given. The outstanding characteristic of this convolution WPT is that no matter how many levels a signal is decomposed, the sequences got in the every level can always keep the same length as that of the original signal, so the defect of traditional WPT is completely overcome and the further analysis for these sequences can conveniently go on without reconstruction operation. The signal processing example shows that the direct decomposition results of this convolution WPT are completely in line with the reconstruction ones of traditional WPT, while its calculation quantity is much less than that of traditional WPT. By means of the length invariance property of convolution WPT, a noise reduction algorithm is proposed, and the denoising example shows that its noise reduction performance is better than that of the traditional WPT, and also better than that of wavelet transform.. Definition of convolution WPT and its fast algorithm As is well known, for wavelet transform, besides the inner product definition, there is another definition, i.e. the convolution definition, which is proposed to detect the local singularity of signal by Mallat [1], but for WPT, there is only the inner product definition, as shown in Eq. 1). Whether the convolution definition is suitable for WPT? In this paper this problem is studied and it s proved that the convolution definition for WPT is also feasible. For this purpose, let s define the convolution WPT as follows: For signal xt) L R), supposing that function series { j/ μ n j t k) k Z} make up of the orthonormal bases of wavelet packet subspace U n, then the convolution WPT can be defined as follows j x n, j p = 1 j R ) p t xt) μ n j dt = 1 ) t xt) μ j n, j 0 j S, 0 n < S, 4) where j is the number of decomposition level, or so-called scale parameter, p is the position parameter, n is the channel number, S is the maximum decomposition level.
3 1354 X. Zhao, B. Ye / Digital Signal Processing 0 010) For inner product WPT, its fast decomposition formula is shown in Eq. ). Similarly, for the practicality of convolution WPT, its fast decomposition formula should also be found. The definition of wavelet packet is μ n t) = hk)μ n t k), μ n+1 t) = 5) gk)μ n t k), where hi) and gi) are the wavelet QMF coefficients. The function series {μ n t) n Z} shown in Eq. 5) are called the orthogonal wavelet packet. In Eq. 5), let t = j x, and do Fourier transform in both sides, then we obtain ˆμ n j ω ) = 1 hk)e i j 1 ωk ˆμ n j 1 ω ), ˆμ n+1 j ω ) = 1 gk)e i j 1 ωk ˆμ n j 1 ω ) 6). Define Hω) = Gω) = 1 hk)e iωk, 1 gk)e iωk. Then Eq. 6) can be written as { ˆμn j ω ) = H j 1 ω ) ˆμ n j 1 ω ), ˆμ n+1 j ω ) = G j 1 ω ) ˆμ n j 1 ω ). 7) 8) According to the convolution theorem, converting Eq. 4) into frequency domain, we can get ˆx n, j ω = ˆxω) ˆμ n j ω ). In Eq. 9), replace n by n and j by j + 1, then this equation can be written as n, j+1 ˆx ω = ˆxω) ˆμ n j+1 ω ). While according to Eqs. 8) and 9), the right part of Eq. 10) can be expressed n, j+1 ˆx ω = ˆxω)H j ω ) ˆμ n j ω ) = H j n, j ω )ˆx ω. Considering the definition of Hω), weobtain n, j+1 ˆx ω = 1 hk)e i j ωk ˆx n, ω j. 9) 10) 11) As is well known, if the Fourier transform of xt) is ˆxω), then the Fourier one of xt b) is e iωb ˆxω), and this is the translation property of Fourier transform. According to this property, converting Eq. 11) into time domain, then we obtain n, j+1 xp = 1 hk) x n, j. p j k 1) n+1, j+1 Correspondingly, the computation formula for xp can also be obtained by the similar deduction, and the only difference is that hk) is replaced by gk), so the fast decomposition formula for convolution WPT can be obtained as follows n, j+1 xp = 1 hk) x n, j, p j k n+1, j+1 xp = 1 gk) x n, j p j k. It can be seen that the concrete form of wavelet packet function μ n t) is not involved in this fast decomposition formula, and the decomposition of convolution WPT for any signal can be conveniently realized just by dint of wavelet QMF coefficients hk) and gk), and this is just like Eq. ). However, compared with Eq. ), the fast decomposition formula of 13)
4 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 1. Vibration acceleration signal of a ball bearing. Fig.. The sequences of 8 channels in the 3rd level got by the traditional WPT. traditional WPT, the obvious characteristic of Eq. 13) is that there is no downsampling, and to compute the sequences in the j + 1)th level, just a translation of j k is done for the sequences in the jth level, so the length of sequences in the j + 1)th level will not decrease and can always keep the same as that of the original signal. Although without the reconstruction operation, the direct decomposition results of convolution WPT can also keep the same length as that of the original signal, for the completeness of convolution WPT, its reconstruction algorithm is also given here. It can be known from the wavelet theory that for wavelet QMF hk) and gk), their relationship in the frequency domain is Hω) + Gω) = 1. 14) According to Eqs. 9) and 14), we have ˆx n, ω j = ˆxω) ˆμ n j ω ) = ˆxω) ˆμ n j ω )[ H j ω ) + G j ω ) ] = ˆxω) ˆμ n j ω ) H j ω ) H j ω ) + ˆxω) ˆμ n j ω ) G j ω ) G j ω ). Considering Eqs. 8) and 10), we obtain ˆx n, ω j = ˆxω) ˆμ n j+1 ω ) H j ω ) + ˆxω) ˆμ n+1 j+1 ω ) G j ω ) n, j+1 = ˆx ω H j ω ) n+1, j+1 + ˆx ω G j ω ). The definition of Hω) and Gω) is taken into consideration, then we can get ˆx n, ω j = 1 hk)e i j ωk n, j+1 ˆx ω + 1 gk)e i j ωk n+1, j+1 ˆx ω. 15) According to the translation property of Fourier transform, converting Eq. 15) into time domain, then we can obtain the reconstruction formula for convolution WPT x n, j p = 1 n, j+1 hk)x + 1 n+1, j+1 gk)x. 16) p+ j k p+ j k Next a signal processing example will be given to test the validity of this convolution WPT, in addition, the comparison with the traditional WPT will also be made. 3. Signal processing example and the comparison with the traditional WPT A vibration acceleration signal of a ball bearing is shown in Fig. 1, the length of this signal is 104 and the sample frequency for this signal is Hz. In this bearing some injuries exist in the ball track and the shocks will be caused when the balls pass these injuring points, as a result, some impulses will take place in the vibration acceleration signal. However, because the injuries are slight and also there is noise interference, these impulses are difficult to be identified and
5 1356 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 3. The comparison between the reconstruction results of traditional WPT and direct decomposition ones of convolution WPT. a) Reconstruction results of traditional WPT; b) decomposition results of convolution WPT. confirmed in the original signal. Here WPT method is used to reveal these impulses and locate their positions. The signal is firstly processed by traditional WPT, in which the wavelet QMF coefficients are selected as db3 Daubechies wavelet ones and the maximum decomposition level is set as 3, then 8 sequences can be got in the third level. However, for the downsampling, the lengths of these 8 sequences all decrease to 18. These 8 sequences are placed in the same rank and their total length is 104, as shown in Fig.. Because the length of each sequence is so short that no useful impulse feature can be identified, to say the least, even though the impulses can be revealed in these sequences, the accurate positions of impulses in original signal can t be located by them. Because the lengths of these sequences are much shorter than that of the original signal, it s impossible to find out that the impulses in these sequences correspond to which positions in the original signal. In order to display the impulses and locate their positions, the only way is to utilize these 8 sequences to do reconstruction operation of WPT, so that they can recover the same length of the original signal and then the impulses can be revealed. The reconstruction results of these 8 sequences are shown in Fig. 3a), here the impulses and their positions are clear revealed, and these impulses mean the shocks caused by the injuring points in the ball track. However, this feature extraction process is very troublesome: firstly the decomposition operation of WPT should be done, and then the reconstruction operation of WPT for each sequence in the third level should be done too.
6 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 4. Spectrums comparison. a) Spectrums of reconstruction results of traditional WPT; b) spectrums of decomposition results of convolution WPT. Now let s see the decomposition results of convolution WPT. The decomposition formula 13) is used to decompose the original signal into 3 levels, and 8 sequences got in the third level are illustrated in Fig. 3b). It can be seen that the important difference from the ones of traditional WPT in Fig. is that the lengths of these 8 sequences are all 104, i.e. the length of original signal. While compared Fig. 3b) with Fig. 3a), one can easily see that whether the impulses or their positions in the direct decomposition results of convolution WPT are all in agreement with the ones in the reconstruction results of traditional WPT. Further comparison is made in frequency domain, and the spectrums of all sequences in Fig. 3 are illustrated in Fig. 4. It can be seen that whether for the frequency range or for the amplitude, the spectrums of the direct decomposition results of convolution WPT are all in line with those of the reconstruction results of traditional WPT. These comparisons in time and frequency domain demonstrate the validity of convolution WPT, but its procedure is much simpler than that of the traditional WPT because reconstruction operation is completely avoided. The algorithm complexity of these two kinds of WPT can be analyzed here. Supposing that the length of original signal is N, the maximum decomposition level is S, and the length of wavelet QMF coefficients is L, then for traditional WPT, to make all the sequences in the last level recover their length to N, the total needed number of multiplication operation in the process of decomposition and reconstruction is SN[ S+1 + 1)L + 1], and the number of addition operation is SN[ S 4L + 1) + L]. While for convolution WPT, to obtain the same effect of traditional WPT, the reconstruction operation can be avoided, and in its decomposition process, the total needed number of multiplication operation is N S 1)L + 1),
7 1358 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 5. The comparison of reconstruction error. a) Boundary error of traditional WPT; b) boundary error of convolution WPT; c) left boundary error comparison; d) right boundary error comparison. and the number of addition operation is 4NL S 1). So compared with the convolution WPT, the additional number of multiplication operation needed in the traditional WPT is S+1[ S )L ] 1 N + [ S + 4)L + S + ] N. While the additional number of addition operation needed in the traditional WPT is S[ 4S 1)L + S ] N + S + )NL. According to these two formulas, if S = 1, for traditional WPT, the additional number of multiplication and addition operation is NL 1)and N6L + ) respectively. With the increasing of S, compared with the convolution WPT, the additional number of multiplication and addition operation in the traditional WPT will increase with exponential speed, and this increase is very considerable. In this example, S = 3, N = 104, L = 6, so compared with the convolution WPT, the additional number of multiplication and addition operation in the traditional WPT is and respectively. In a computer whose CPU frequency is 000 MHz, the calculation time of traditional WPT for this example is ms, while the one of convolution WPT is only ms. Besides the less calculation quantity, the advantage of avoiding reconstruction is also reflected in the less boundary error. Since data extension is necessary in the calculation process of both kinds of WPT, the boundary error will surely exist in their processing results. However, for traditional WPT, to recover the decomposition results to the same length of original signal, reconstruction operation must be made, so there are two kinds of errors, i.e. decomposition error and reconstruction one. Furthermore, since the decomposition results in which boundary error exist are used to do reconstruction computation, the error will be accumulated to make the boundary error of reconstruction results further increase, while the convolution WPT needs no reconstruction, so there is only one kinds of error, i.e. decomposition error. In this respect the direct decomposition results of convolution WPT are more reliable than the reconstruction ones of traditional WPT. However, it is very difficult for us to obtain the decomposition error, for that to compute the boundary error, two signals must be offered, one is the ideal signal, and the other is the real signal, while we never know what the ideal decomposition result is and can never get it, so here it is very difficult for us to compare the boundary error of the results shown in Fig. 3. Nevertheless, we can easily get the reconstruction error, because the ideal reconstruction signal is just the original signal, and the difference of real reconstruction result and original signal is the reconstruction error. For this example, the reconstruction errors of two kinds of WPT are illustrated in Fig. 5. To reveal the errors more clearly, the front 30 data of both errors are plotted in the same figure, as shown in Fig. 5c), and the last 30 data of both errors are also plotted in the same figure, as shown in Fig. 5d). The standard deviation of error and the average of absolute value of error are also calculated, as listed in Table 1. From these error curves and the data in Table 1 it can be easily seen that the reconstruction error of convolution WPT is also less than that of the traditional WPT. In fact this result can also demonstrate that the decomposition error of convolution WPT is less than that of the traditional WPT, because that the reconstruction signal is obtained from the decomposition results, and the decomposition results with less error will produce the reconstruction signal with less error. The less the decomposition error is, the less reconstruction error is. 4. Noise reduction algorithm based on the convolution WPT In the decomposition results of wavelet transform, maxima produced by white noise can t be transmitted along the scales, and they will gradually disappear in the biggish scale. This characteristic is the foundation of noise reduction algorithms based on wavelet transform. Many noise reduction algorithms based on wavelet transform have been developed
8 X. Zhao, B. Ye / Digital Signal Processing 0 010) Table 1 The statistical parameters of reconstruction error. Standard deviation of error Average of absolute value of error Convolution WPT Traditional WPT Fig. 6. The comparison between the decomposition structure of WPT and wavelet transform. [13 17], in which one kind of algorithm can be summarized as follows: supposing that decomposition level is 3, firstly the original signal is decomposed by wavelet transform and approximation signal V 3, detail signals W 3, W and W 1 can be got. Secondly, the maxima in W 3 being used as criterion, the maxima in W and W 1 are checked and those ones that can t be transmitted to W 3 are all set to zero, so new W and W 1 can be obtained. Thirdly V 3, W 3, and new W and W 1 are used to do reconstruction operation of wavelet transform, and the reconstruction result is just the denoised signal. Or maxima in W 3 are not used as criterion, while different threshold methods are used, and in all detail signals W 3, W and W 1, those wavelet transform coefficients who are less than the threshold will be all set to zero, so new W 3, W and W 1 can be obtained, then reconstruction operation is made by the V 3,newW 3, W and W 1, and the reconstruction result is the denoised signal. About detailed schemes of wavelet threshold, please see Refs. [14 17]. WPT is the further decomposition for the results of wavelet transform, and certainly it can be used to reduce noise. In wavelet transform, assuming that the width of frequency window of wavelet is ˆψ, then what detail signal W j j 1) reflects is the local information of original signal in a frequency window with center 3 j ˆψ and width H j = j+1 ˆψ, j+ ˆψ), with the decreasing of j, the frequency center of W j will move to high frequency direction and the width H j will become broad, and this means that frequency resolution of wavelet transform in high frequency area will become bad, in such a situation many high frequency noises can t be isolated, and this will influence the denoising effect. While after the further decomposition of WPT, and in the kth level, detail signal W j will be further resolved into k j subsequences, and frequency band H j will also be further divided into k j sub-bands, so frequency resolution will be greatly improved and those high frequency noises that can t be isolated by wavelet transform will be completely isolated. For example, if a signal is decomposed by wavelet transform into 3 levels, approximation signal V 3, detail signals W 3, W and W 1 can be got; while this signal is also decomposed by WPT into 3 levels, and in the third level 8 sequences U 0 3, U 1 3,...,U 7 3 can be got, in which U 0 3 is the approximation signal V 3, and U 1 3 is the detail signal W 3; while U 3 and U 3 3 are the further decomposition results of W ; U 4 3, U 5 3, U 6 3 and U 7 3 are the further decomposition results of W 1, and this relationship is shown in Fig. 6. After this further decomposition, some high frequency noises that can t be isolated in W 1 will be completely isolated into the sequences U 4 3, U 5 3, U 6 3 and U 7 3 ; some high frequency noises that can t be isolated in W will be completely isolated into the sequences U 3 and U 3 3, and what these high frequency noises exhibit in these sequences are quite a number of serried maxima. In such a situation if maxima in U 1 3,i.e.W 3 is used as criterion, check the maxima in U 3, U 3 3,...,U 6 3 and U 7 3, and eliminate those maxima that can t be transmitted to U 1 3, because high frequency noises are completely isolated into the back sequences especially U 3 3,...,U 6 3 and U 7 3 by WPT, surely much more noise maxima will be eliminated, then all sequences are used to do reconstruction operation of WPT, and it s sure that the better denoising effect than that of wavelet transform can be achieved. However, in the traditional WPT, the lengths of sequences will decrease by half in the next level as a consequence of downsampling, then for the sequences in the last level, their lengths, compared with that of the original signal, will become very short, and many maxima, no matter they are produced by normal signal or noise, will be lost in the process of downsampling, in this situation the foundation of maxima-based noise reduction method will not exist any more. While for convolution WPT, there is no downsampling, the lengths of sequences in every level will never decrease and they can always keep the same as that of the original signal, then in every sequence all its maxima can be reserved, so maxima-based noise reduction method can be realized. Based on above analysis, a simple maxima-based noise reduction algorithm using the convolution WPT is proposed as follows:
9 1360 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 7. The comparison of denoising effect among the different methods. a) Original signal; b) denoised result of convolution WPT; c) denoised one of wavelet transform; d) denoised one of traditional WPT. For interpretation of the references to color, the reader is referred to the web version of this article.) Step 1): Decompose the original noisy signal f t) by the convolution WPT, and supposing that the maximum decomposition level is S, theninthesth level S sequences can be got, i.e. U 0 S, U 1 S,...,U S 1 S, and they will keep the same length as that of the original signal. Step ): Extract the maxima in the sequence U 1 S, and record the position coordinates of these maxima as x 1, x,...,x M ), where M is the total number of maxima in U 1 S. Step 3): The position coordinates x 1, x,...,x M ) are used as criterion, for sequence U j S j S 1), searchforthe maxima in interval x i, x i+1 ), i = 1,,...,M 1, and set these maxima to zero; search for the maxima in interval 0, x 1 ) and interval x M, N 1), where N is the length of original signal, and set these maxima to zero, then let j = j + 1, repeat the operation of step 3) till j = S 1. Step 4): After the processing of step 3), noise maxima in sequences U j S j S 1) have already been eliminated, now all the sequences in the Sth level are used to make the reconstruction of convolution WPT, and the reconstruction result is just the denoised signal. In this algorithm, because the denoised result is obtained by the reconstruction operation of WPT, its phase will keep the same as that of the original signal, so this is a zero phase shift denoising algorithm. In general when decomposition level is S = 4, the good denoising effect can be achieved. Furthermore, in this noise reduction algorithm no special conditions are required for the noised signals because that signal types, signal-to-noise ratio SNR) and threshold are no involved in the steps of algorithm. 5. Noise reduction example For signal f t) = sint) + sin6t) + sin18t), 104 data are sampled in interval [0, π], white noise chosen from normal distribution N0, 1) is added to this signal and signal-to-noise ratio SNR) of the combined signal is The noise is so strong that the waveform of f t) can t be distinguished, as shown in Fig. 7a). Convolution WPT with the QMF coefficients h[] ={0.15, 0.375, 0.375, 0.15} and g[] ={.0,.0} is used to eliminate the noise in this signal, and the decomposition level is set as 4, then 16 sequences can be got in the fourth level. By the processing of above noise reduction algorithm for these 16 sequences, the denoised result can be got, which is illustrated in Fig. 7b) and the red dashed line is the ideal
10 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 8. The noise reduction error curves. a) The error curve of convolution WPT; b) the one of wavelet transform; c) the one of traditional WPT. Table The statistical parameters of three noise reduction errors. Standard deviation of error Average of absolute value of error Convolution WPT Wavelet transform Traditional WPT f t), now SNR is improved to It can be seen that the principal part of noise has been eliminated, the waveform of denoised result is very smooth, furthermore there is no phase deviation, and signal waveform is very close to the ideal one. As a comparison, the denoised result got by the corresponding wavelet transform is shown in Fig. 7c), in which the red dashed line is the ideal f t). It can be easily seen that this denoising effect is not so good as that of convolution WPT, and many noises especially some impulses still exist in this denoised result, which make the signal waveform look not very continuous, and SNR of this result is For traditional WPT, many maxima in the sequences of the last level are lost as a result of downsampling, so this WPT is not suitable to be used to realize the above maxima-based noise reduction algorithm. However, the soft threshold denoising method [16] is still suitable for this WPT. For a data x, supposing that t is the threshold, then the soft threshold adjustment regulation can be described as follows [16] { 0 x t, ˆx = 17) sgnx) x t) x > t. For the sequences in the last level got by the traditional WPT, except for the first sequence, every data in the other sequences is adjusted by this soft threshold regulation, then all these sequences are used to make WPT reconstruction, and the reconstruction result is just the denoised signal. For a sequence x i, i = 1,,...,n, in order to achieve the good denoising effect, the threshold can be decided by the following formula [16] t = logn) n x i / n). i=1 By dint of this processing, the denoised result of traditional WPT can be got, as shown in Fig. 7d), in which the red dashed line is the ideal f t), and SNR of this result is One can see that its denoising performance is better than that of wavelet transform, and much more noise is eliminated, but this denoising effect is not yet so good as that of the convolution WPT, because some waveforms of this denoised signal become very sharp, while the ones of convolution WPT are much more smooth and there is no this waveform distortion phenomenon. To further analyze the denoising performance of these three methods with more accuracy, their noise reduction errors are calculated, which are illustrated in Fig. 8, and the standard deviation of these errors, the average of absolute value of these errors are also calculated, as listed in Table. From these error curves and especially the data in Table, it can be 18)
11 136 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 9. The comparison between the original sequences of last 5 channels got by convolution WPT and the processed ones in which noise maxima are eliminated. a) Original sequences; b) sequences after noise maxima are eliminated. Fig. 10. The comparison between the original detail signals of 4 scales got by wavelet transform and the processed ones in which noise maxima are eliminated. a) Original detail signals; b) detail signals after noise maxima are eliminated. seen that whether judged by standard deviation or by the average, the denoising effect of convolution WPT is always the best, and the traditional WPT is the second best, while wavelet transform is always in the third class. In order to explain the differences of denoising effect, we might as well see what happened in the intermediate denoising process. The last 5 sequences in the fourth level got by convolution WPT are shown in Fig. 9a), one can see that the
12 X. Zhao, B. Ye / Digital Signal Processing 0 010) Fig. 11. The comparison between the original sequences of traditional WPT and the ones processed by soft threshold adjustment regulation. a) Original sequences; b) sequences after soft threshold adjustment. isolated maxima are very dense, which are produced by noise but can t be isolated by wavelet transform, while after further decomposition of WPT, they are completely isolated, especially isolated into these 5 back sequences, then by the processing of noise maxima elimination algorithm, large numbers of noise maxima are eliminated and this effect is clearly shown in Fig. 9b). As a comparison, the four detail signals got by wavelet transform are shown in Fig. 10a). It can be easily seen that the isolated maxima are much less than those of convolution WPT, and the elimination effect of noise maxima is also not so good as that of convolution WPT, as shown in Fig. 10b). This comparison confirms the preceding analysis about the denoising principle of convolution WPT and directly reveals the inherent reason why denoising performance of convolution WPT is better than that of wavelet transform. The intermediate process of traditional WPT can also be illustrated. The 16 sequences in the fourth level got by the traditional WPT are shown in Fig. 11a), as a result of downsampling, the length of every sequence has decreased to 64 and their total length is 104, while after the soft threshold adjustment, the new 16 sequences are illustrated in Fig. 11b). One can see that nearly all the data in the last 15 sequences are adjusted to new values by soft threshold adjustment regulation; however, this adjustment may be excessive, which leads to the waveform distortion of reconstruction result. 6. Conclusions In the traditional WPT, the length of sequences will decrease by half in the next level, which is inconvenient for further analysis of these sequences. To solve this problem, the concept of convolution WPT is put forward, and its fast decomposition and reconstruction algorithms are deduced. The signal processing examples testify the validity of this kind of WPT. Summarizing the total contents of this paper, we can draw the following conclusions: 1) For convolution WPT, no matter how many levels a signal is decomposed, the lengths of sequences in every level will never decrease and can always keep the same as that of the original signal, so the defect of traditional WPT is overcome, and this characteristic will also make convolution WPT have the advantage in fault diagnosis. ) Signal processing example shows that the direct decomposition results of convolution WPT are completely in line with the reconstruction ones of traditional WPT, while for traditional WPT, to achieve the same effect of feature extraction obtained by the direct decomposition results of convolution WPT, the reconstruction operation must be done, so signal processing procedure of convolution WPT is much simpler, and furthermore, convolution WPT needs less calculation and has less boundary error. 3) By virtue of the length invariance of sequences, a noise reduction algorithm based on convolution WPT is proposed. The denoising example shows that convolution WPT can achieve the excellent denoising effect, which is better than that of the traditional WPT, and also, much better than that of wavelet transform. Acknowledgments The support from National Natural Science Foundation of China NSFC, Grant Nos and ) for this research is gratefully acknowledged. The authors also thank the two anonymous reviewers for their valuable suggestions.
13 1364 X. Zhao, B. Ye / Digital Signal Processing 0 010) References [1] R.R. Coifman, M.V. Wickerhauser, Entropy-based algorithms for best basis selection, IEEE Trans. Inform. Theory 38 ) 199) [] S. Bilgin, O.H. Colak, E. Koklukaya, N. Ari, Efficient solution for frequency band decomposition problem using wavelet packet in HRV, Digital Signal Process. 18 6) 008) [3] B.H. Yang, G.Z. Yan, T. Wu, R.G. Yan, Subject-based feature extraction using fuzzy wavelet packet in brain computer interfaces, Signal Process. 87 7) 007) [4] H.X. Chen, P.S.K. Chua, G.H. Lim, Fault degradation assessment of water hydraulic motor by impulse vibration signal with wavelet packet analysis and Kolmogorov Smirnov test, Mech. Syst. Signal Process. 7) 008) [5] X.F. Fan, M.J. Zuo, Gearbox fault detection using Hilbert and wavelet packet transform, Mech. Syst. Signal Process. 0 4) 006) [6] H. Ocak, K.A. Loparo, F.M. Discenzo, Online tracking of bearing wear using wavelet packet decomposition and probabilistic modeling: A method for bearing prognostics, J. Sound Vibration ) 007) [7] B. Liu, Selection of wavelet packet basis for rotating machinery fault diagnosis, J. Sound Vibration ) 005) [8] Y. Wu, R. Du, Feature extraction and assessment using wavelet packets for monitoring of machining processes, Mech. Syst. Signal Process. 10 1) 1996) [9] X.Z. Zhao, T.J. Chen, B.Y. Ye, Application of wavelet packet analysis to bearing initial fault diagnosis, J. Vibr. Meas. Diagn. 3 4) 004) in Chinese). [10] R. Manthalkar, P.K. Biswas, B.N. Chatterji, Rotation and scale invariant texture features using discrete wavelet packet transform, Pattern Recogn. Lett. 4 14) 003) [11] H.M. Paiva, R.K.H. Galvao, Wavelet-packet identification of dynamic systems in frequency subbands, Signal Process. 86 8) 006) [1] S. Mallat, W.L. Hwang, Singularity detection and processing with wavelets, IEEE Trans. Inform. Theory 38 ) 199) [13] O. Farooq, S. Datta, Wavelet-based denoising for robust feature extraction for speech recognition, Electron. Lett. 39 1) 003) [14] T.D. Bui, G. Chen, Translation invariant denoising using multiwavelets, IEEE Trans. Signal Process. 46 1) 1998) [15] G.S. Shin, M.G. Kang, Wavelet-based denoising considering interscale and intrascale dependences, Opt. Engrg. 44 6) 005) 1 9. [16] D.L. Donoho, De-noising by soft-thresholding, IEEE Trans. Inform. Theory 41 3) 1995) [17] A.R.F. da Silva, Wavelet denoising with evolutionary algorithms, Digital Signal Process. 15 4) 005) Xuezhi Zhao received his MS and Ph.D. degrees from South China University of Technology, in 1998 and 001, respectively. Currently he is an Associate Professor at the School of Mechanical and Automotive Engineering in South China University of Technology. His research interests include information fusion, pattern recognition, signal processing and scientific computation. Bangyan Ye is a Professor at the School of Mechanical and Automotive Engineering in South China University of Technology; he is also the senior member of Chinese Mechanical Engineering Society. He obtained Ph.D. degree in 1989 from South China University of Technology. He has worked on variety of topics including signal processing, fault diagnosis, neural networks and artificial intelligence.
Intelligent Fault Classification of Rolling Bearing at Variable Speed Based on Reconstructed Phase Space
Journal of Robotics, Networking and Artificial Life, Vol., No. (June 24), 97-2 Intelligent Fault Classification of Rolling Bearing at Variable Speed Based on Reconstructed Phase Space Weigang Wen School
More informationBearing fault diagnosis based on TEO and SVM
Bearing fault diagnosis based on TEO and SVM Qingzhu Liu, Yujie Cheng 2 School of Reliability and Systems Engineering, Beihang University, Beijing 9, China Science and Technology on Reliability and Environmental
More informationCOMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS
COMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS MUSOKO VICTOR, PROCHÁZKA ALEŠ Institute of Chemical Technology, Department of Computing and Control Engineering Technická 905, 66 8 Prague 6, Cech
More informationInvariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features
Invariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features G. Y. Chen and B. Kégl Department of Computer Science and Operations Research, University of Montreal, CP 6128 succ.
More informationBearing fault diagnosis based on EMD-KPCA and ELM
Bearing fault diagnosis based on EMD-KPCA and ELM Zihan Chen, Hang Yuan 2 School of Reliability and Systems Engineering, Beihang University, Beijing 9, China Science and Technology on Reliability & Environmental
More informationMultiresolution image processing
Multiresolution image processing Laplacian pyramids Some applications of Laplacian pyramids Discrete Wavelet Transform (DWT) Wavelet theory Wavelet image compression Bernd Girod: EE368 Digital Image Processing
More informationEngine fault feature extraction based on order tracking and VMD in transient conditions
Engine fault feature extraction based on order tracking and VMD in transient conditions Gang Ren 1, Jide Jia 2, Jian Mei 3, Xiangyu Jia 4, Jiajia Han 5 1, 4, 5 Fifth Cadet Brigade, Army Transportation
More informationBearing fault diagnosis based on Shannon entropy and wavelet package decomposition
Bearing fault diagnosis based on Shannon entropy and wavelet package decomposition Hong Mei Liu 1, Chen Lu, Ji Chang Zhang 3 School of Reliability and Systems Engineering, Beihang University, Beijing 1191,
More informationDigital Image Processing Lectures 15 & 16
Lectures 15 & 16, Professor Department of Electrical and Computer Engineering Colorado State University CWT and Multi-Resolution Signal Analysis Wavelet transform offers multi-resolution by allowing for
More informationPower Supply Quality Analysis Using S-Transform and SVM Classifier
Journal of Power and Energy Engineering, 2014, 2, 438-447 Published Online April 2014 in SciRes. http://www.scirp.org/journal/jpee http://dx.doi.org/10.4236/jpee.2014.24059 Power Supply Quality Analysis
More informationThe Illustrated Wavelet Transform Handbook. Introductory Theory and Applications in Science, Engineering, Medicine and Finance.
The Illustrated Wavelet Transform Handbook Introductory Theory and Applications in Science, Engineering, Medicine and Finance Paul S Addison Napier University, Edinburgh, UK IoP Institute of Physics Publishing
More informationDETC EXPERIMENT OF OIL-FILM WHIRL IN ROTOR SYSTEM AND WAVELET FRACTAL ANALYSES
Proceedings of IDETC/CIE 2005 ASME 2005 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference September 24-28, 2005, Long Beach, California, USA DETC2005-85218
More informationMisalignment Fault Detection in Dual-rotor System Based on Time Frequency Techniques
Misalignment Fault Detection in Dual-rotor System Based on Time Frequency Techniques Nan-fei Wang, Dong-xiang Jiang *, Te Han State Key Laboratory of Control and Simulation of Power System and Generation
More informationDigital Image Processing
Digital Image Processing, 2nd ed. Digital Image Processing Chapter 7 Wavelets and Multiresolution Processing Dr. Kai Shuang Department of Electronic Engineering China University of Petroleum shuangkai@cup.edu.cn
More informationYARN TENSION PATTERN RETRIEVAL SYSTEM BASED ON GAUSSIAN MAXIMUM LIKELIHOOD. Received July 2010; revised December 2010
International Journal of Innovative Computing, Information and Control ICIC International c 2011 ISSN 1349-4198 Volume 7, Number 11, November 2011 pp. 6261 6272 YARN TENSION PATTERN RETRIEVAL SYSTEM BASED
More informationDigital Image Processing
Digital Image Processing Wavelets and Multiresolution Processing (Wavelet Transforms) Christophoros Nikou cnikou@cs.uoi.gr University of Ioannina - Department of Computer Science 2 Contents Image pyramids
More informationLecture Notes 5: Multiresolution Analysis
Optimization-based data analysis Fall 2017 Lecture Notes 5: Multiresolution Analysis 1 Frames A frame is a generalization of an orthonormal basis. The inner products between the vectors in a frame and
More informationNoise reduction of ship-radiated noise based on noise-assisted bivariate empirical mode decomposition
Indian Journal of Geo-Marine Sciences Vol. 45(4), April 26, pp. 469-476 Noise reduction of ship-radiated noise based on noise-assisted bivariate empirical mode decomposition Guohui Li,2,*, Yaan Li 2 &
More information1251. An approach for tool health assessment using the Mahalanobis-Taguchi system based on WPT-AR
25. An approach for tool health assessment using the Mahalanobis-Taguchi system based on WPT-AR Chen Lu, Yujie Cheng 2, Zhipeng Wang 3, Jikun Bei 4 School of Reliability and Systems Engineering, Beihang
More informationThe Fault extent recognition method of rolling bearing based on orthogonal matching pursuit and Lempel-Ziv complexity
The Fault extent recognition method of rolling bearing based on orthogonal matching pursuit and Lempel-Ziv complexity Pengfei Dang 1,2 *, Yufei Guo 2,3, Hongjun Ren 2,4 1 School of Mechanical Engineering,
More informationChaos suppression of uncertain gyros in a given finite time
Chin. Phys. B Vol. 1, No. 11 1 1155 Chaos suppression of uncertain gyros in a given finite time Mohammad Pourmahmood Aghababa a and Hasan Pourmahmood Aghababa bc a Electrical Engineering Department, Urmia
More informationOPTIMIZATION OF MORLET WAVELET FOR MECHANICAL FAULT DIAGNOSIS
Twelfth International Congress on Sound and Vibration OPTIMIZATION OF MORLET WAVELET FOR MECHANICAL FAULT DIAGNOSIS Jiří Vass* and Cristina Cristalli** * Dept. of Circuit Theory, Faculty of Electrical
More informationWHEELSET BEARING VIBRATION ANALYSIS BASED ON NONLINEAR DYNAMICAL METHOD
15 th November 212. Vol. 45 No.1 25-212 JATIT & LLS. All rights reserved. WHEELSET BEARING VIBRATION ANALYSIS BASED ON NONLINEAR DYNAMICAL METHOD 1,2 ZHAO ZHIHONG, 2 LIU YONGQIANG 1 School of Computing
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More informationInvariant Scattering Convolution Networks
Invariant Scattering Convolution Networks Joan Bruna and Stephane Mallat Submitted to PAMI, Feb. 2012 Presented by Bo Chen Other important related papers: [1] S. Mallat, A Theory for Multiresolution Signal
More informationAn Improved Spin Echo Train De-noising Algorithm in NMRL
J Inf Process Syst, Vol.14, No.4, pp.941~947, August 018 https://doi.org/10.3745/jips.04.0081 ISSN 1976-913X (Print) ISSN 09-805X (Electronic) An Improved Spin Echo Train De-noising Algorithm in NMRL Feng
More informationModule 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur
Module MULTI- RESOLUTION ANALYSIS Version ECE IIT, Kharagpur Lesson Multi-resolution Analysis: Theory of Subband Coding Version ECE IIT, Kharagpur Instructional Objectives At the end of this lesson, the
More informationMULTIRATE DIGITAL SIGNAL PROCESSING
MULTIRATE DIGITAL SIGNAL PROCESSING Signal processing can be enhanced by changing sampling rate: Up-sampling before D/A conversion in order to relax requirements of analog antialiasing filter. Cf. audio
More informationDenoising and Compression Using Wavelets
Denoising and Compression Using Wavelets December 15,2016 Juan Pablo Madrigal Cianci Trevor Giannini Agenda 1 Introduction Mathematical Theory Theory MATLAB s Basic Commands De-Noising: Signals De-Noising:
More informationIdentification and Classification of High Impedance Faults using Wavelet Multiresolution Analysis
92 NATIONAL POWER SYSTEMS CONFERENCE, NPSC 2002 Identification Classification of High Impedance Faults using Wavelet Multiresolution Analysis D. Cha N. K. Kishore A. K. Sinha Abstract: This paper presents
More informationMultiple Wavelet Coefficients Fusion in Deep Residual Networks for Fault Diagnosis
Multiple Wavelet Coefficients Fusion in Deep Residual Networks for Fault Diagnosis Minghang Zhao, Myeongsu Kang, Baoping Tang, Michael Pecht 1 Backgrounds Accurate fault diagnosis is important to ensure
More informationRESEARCH ON COMPLEX THREE ORDER CUMULANTS COUPLING FEATURES IN FAULT DIAGNOSIS
RESEARCH ON COMPLEX THREE ORDER CUMULANTS COUPLING FEATURES IN FAULT DIAGNOSIS WANG YUANZHI School of Computer and Information, Anqing Normal College, Anqing 2460, China ABSTRACT Compared with bispectrum,
More informationWhich wavelet bases are the best for image denoising?
Which wavelet bases are the best for image denoising? Florian Luisier a, Thierry Blu a, Brigitte Forster b and Michael Unser a a Biomedical Imaging Group (BIG), Ecole Polytechnique Fédérale de Lausanne
More informationDominant Feature Vectors Based Audio Similarity Measure
Dominant Feature Vectors Based Audio Similarity Measure Jing Gu 1, Lie Lu 2, Rui Cai 3, Hong-Jiang Zhang 2, and Jian Yang 1 1 Dept. of Electronic Engineering, Tsinghua Univ., Beijing, 100084, China 2 Microsoft
More informationA New Two-dimensional Empirical Mode Decomposition Based on Classical Empirical Mode Decomposition and Radon Transform
A New Two-dimensional Empirical Mode Decomposition Based on Classical Empirical Mode Decomposition and Radon Transform Zhihua Yang and Lihua Yang Abstract This paper presents a new twodimensional Empirical
More informationMyoelectrical signal classification based on S transform and two-directional 2DPCA
Myoelectrical signal classification based on S transform and two-directional 2DPCA Hong-Bo Xie1 * and Hui Liu2 1 ARC Centre of Excellence for Mathematical and Statistical Frontiers Queensland University
More informationWavelet based feature extraction for classification of Power Quality Disturbances
European Association for the Development of Renewable Energies, Environment and Power Quality (EA4EPQ) International Conference on Renewable Energies and Power Quality (ICREPQ 11) Las Palmas de Gran Canaria
More informationIMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES
IMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES Bere M. Gur Prof. Christopher Niezreci Prof. Peter Avitabile Structural Dynamics and Acoustic Systems
More informationMultirate signal processing
Multirate signal processing Discrete-time systems with different sampling rates at various parts of the system are called multirate systems. The need for such systems arises in many applications, including
More informationFrequency-Domain Design and Implementation of Overcomplete Rational-Dilation Wavelet Transforms
Frequency-Domain Design and Implementation of Overcomplete Rational-Dilation Wavelet Transforms Ivan Selesnick and Ilker Bayram Polytechnic Institute of New York University Brooklyn, New York 1 Rational-Dilation
More informationIntroduction to Biomedical Engineering
Introduction to Biomedical Engineering Biosignal processing Kung-Bin Sung 6/11/2007 1 Outline Chapter 10: Biosignal processing Characteristics of biosignals Frequency domain representation and analysis
More informationECE472/572 - Lecture 13. Roadmap. Questions. Wavelets and Multiresolution Processing 11/15/11
ECE472/572 - Lecture 13 Wavelets and Multiresolution Processing 11/15/11 Reference: Wavelet Tutorial http://users.rowan.edu/~polikar/wavelets/wtpart1.html Roadmap Preprocessing low level Enhancement Restoration
More informationDesign of Image Adaptive Wavelets for Denoising Applications
Design of Image Adaptive Wavelets for Denoising Applications Sanjeev Pragada and Jayanthi Sivaswamy Center for Visual Information Technology International Institute of Information Technology - Hyderabad,
More informationLecture 10, Multirate Signal Processing Transforms as Filter Banks. Equivalent Analysis Filters of a DFT
Lecture 10, Multirate Signal Processing Transforms as Filter Banks Equivalent Analysis Filters of a DFT From the definitions in lecture 2 we know that a DFT of a block of signal x is defined as X (k)=
More informationof Orthogonal Matching Pursuit
A Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit Qun Mo arxiv:50.0708v [cs.it] 8 Jan 205 Abstract We shall show that if the restricted isometry constant (RIC) δ s+ (A) of the measurement
More informationA Machine Intelligence Approach for Classification of Power Quality Disturbances
A Machine Intelligence Approach for Classification of Power Quality Disturbances B K Panigrahi 1, V. Ravi Kumar Pandi 1, Aith Abraham and Swagatam Das 1 Department of Electrical Engineering, IIT, Delhi,
More informationMultiple damage detection in beams in noisy conditions using complex-wavelet modal curvature by laser measurement
Multiple damage detection in beams in noisy conditions using complex-wavelet modal curvature by laser measurement W. Xu 1, M. S. Cao 2, M. Radzieński 3, W. Ostachowicz 4 1, 2 Department of Engineering
More informationSpike sorting based on PCA and improved fuzzy c-means
3rd International Conference on Mechatronics, Robotics and Automation (ICMRA 2015) Spike sorting based on PCA and improved fuzzy c-means Yuyi 1, a, Zhaoyun 2,b, Liuhan 3,c,Dong Bingchao 4,d, Li Zhenxin
More informationACM 126a Solutions for Homework Set 4
ACM 26a Solutions for Homewor Set 4 Laurent Demanet March 2, 25 Problem. Problem 7.7 page 36 We need to recall a few standard facts about Fourier series. Convolution: Subsampling (see p. 26): Zero insertion
More informationDetermining the Optimal Decision Delay Parameter for a Linear Equalizer
International Journal of Automation and Computing 1 (2005) 20-24 Determining the Optimal Decision Delay Parameter for a Linear Equalizer Eng Siong Chng School of Computer Engineering, Nanyang Technological
More informationA Hybrid Time-delay Prediction Method for Networked Control System
International Journal of Automation and Computing 11(1), February 2014, 19-24 DOI: 10.1007/s11633-014-0761-1 A Hybrid Time-delay Prediction Method for Networked Control System Zhong-Da Tian Xian-Wen Gao
More informationEfficient Algorithms for Pulse Parameter Estimation, Pulse Peak Localization And Pileup Reduction in Gamma Ray Spectroscopy M.W.Raad 1, L.
Efficient Algorithms for Pulse Parameter Estimation, Pulse Peak Localization And Pileup Reduction in Gamma Ray Spectroscopy M.W.Raad 1, L. Cheded 2 1 Computer Engineering Department, 2 Systems Engineering
More informationFAULT IDENTIFICATION AND LOCALIZATION FOR MOVING WHEELS BASED ON DE-DOPPLERIZATION BEAMFORMING KURTOSIS METHOD
BeBeC-218-D18 FAULT IDENTIFICATION AND LOCALIZATION FOR MOVING WHEELS BASED ON DE-DOPPLERIZATION BEAMFORMING KURTOSIS METHOD CHEN Long 1 and CHOY Yat Sze 1 1 Department of Mechanical Engineering, The Hong
More informationA methodology for fault detection in rolling element bearings using singular spectrum analysis
A methodology for fault detection in rolling element bearings using singular spectrum analysis Hussein Al Bugharbee,1, and Irina Trendafilova 2 1 Department of Mechanical engineering, the University of
More informationWavelet de-noising for blind source separation in noisy mixtures.
Wavelet for blind source separation in noisy mixtures. Bertrand Rivet 1, Vincent Vigneron 1, Anisoara Paraschiv-Ionescu 2 and Christian Jutten 1 1 Institut National Polytechnique de Grenoble. Laboratoire
More informationUltrasonic Thickness Inspection of Oil Pipeline Based on Marginal Spectrum. of Hilbert-Huang Transform
17th World Conference on Nondestructive Testing, 25-28 Oct 2008, Shanghai, China Ultrasonic Thickness Inspection of Oil Pipeline Based on Marginal Spectrum of Hilbert-Huang Transform Yimei MAO, Peiwen
More informationBLIND DECONVOLUTION ALGORITHMS FOR MIMO-FIR SYSTEMS DRIVEN BY FOURTH-ORDER COLORED SIGNALS
BLIND DECONVOLUTION ALGORITHMS FOR MIMO-FIR SYSTEMS DRIVEN BY FOURTH-ORDER COLORED SIGNALS M. Kawamoto 1,2, Y. Inouye 1, A. Mansour 2, and R.-W. Liu 3 1. Department of Electronic and Control Systems Engineering,
More informationRobust Sound Event Detection in Continuous Audio Environments
Robust Sound Event Detection in Continuous Audio Environments Haomin Zhang 1, Ian McLoughlin 2,1, Yan Song 1 1 National Engineering Laboratory of Speech and Language Information Processing The University
More informationBLIND SOURCE SEPARATION TECHNIQUES ANOTHER WAY OF DOING OPERATIONAL MODAL ANALYSIS
BLIND SOURCE SEPARATION TECHNIQUES ANOTHER WAY OF DOING OPERATIONAL MODAL ANALYSIS F. Poncelet, Aerospace and Mech. Eng. Dept., University of Liege, Belgium G. Kerschen, Aerospace and Mech. Eng. Dept.,
More informationEquivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation
IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 19, NO. 12, DECEMBER 2008 2009 Equivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation Yuanqing Li, Member, IEEE, Andrzej Cichocki,
More informationWavelet Based Image Restoration Using Cross-Band Operators
1 Wavelet Based Image Restoration Using Cross-Band Operators Erez Cohen Electrical Engineering Department Technion - Israel Institute of Technology Supervised by Prof. Israel Cohen 2 Layout Introduction
More informationMaterials Science Forum Online: ISSN: , Vols , pp doi: /
Materials Science Forum Online: 2004-12-15 ISSN: 1662-9752, Vols. 471-472, pp 687-691 doi:10.4028/www.scientific.net/msf.471-472.687 Materials Science Forum Vols. *** (2004) pp.687-691 2004 Trans Tech
More informationPreliminary Detection of Bearing Faults using Shannon Entropy of Wavelet Coefficients
(ICETMEE- 13th-14th March 14) RESEARCH ARTICLE OPEN ACCESS Preliminary Detection of Bearing Faults using Shannon Entropy of Wavelet Coefficients Suhani Jain Electrical Engineering Deptt. MITS Gwalior,India
More informationTHE WAVELET IMAGE DENOISING FAST ALGORITHM STUDY BASED ON DSP
THE WAVELET IMAGE DEOISIG FAST ALGORITHM STUDY BASED O DSP Zhicheng Hao Jiyin Zhao Xiaoling Wang Yu Liu College of Communication Engineering, Jilin University, Changchun, P. R. China Abstract: The speed
More informationA New High-Resolution and Stable MV-SVD Algorithm for Coherent Signals Detection
Progress In Electromagnetics Research M, Vol. 35, 163 171, 2014 A New High-Resolution and Stable MV-SVD Algorithm for Coherent Signals Detection Basma Eldosouky, Amr H. Hussein *, and Salah Khamis Abstract
More informationNOISE ROBUST RELATIVE TRANSFER FUNCTION ESTIMATION. M. Schwab, P. Noll, and T. Sikora. Technical University Berlin, Germany Communication System Group
NOISE ROBUST RELATIVE TRANSFER FUNCTION ESTIMATION M. Schwab, P. Noll, and T. Sikora Technical University Berlin, Germany Communication System Group Einsteinufer 17, 1557 Berlin (Germany) {schwab noll
More informationSubband Coding and Wavelets. National Chiao Tung University Chun-Jen Tsai 12/04/2014
Subband Coding and Wavelets National Chiao Tung Universit Chun-Jen Tsai /4/4 Concept of Subband Coding In transform coding, we use N (or N N) samples as the data transform unit Transform coefficients are
More informationc 2010 Melody I. Bonham
c 2010 Melody I. Bonham A NEAR-OPTIMAL WAVELET-BASED ESTIMATION TECHNIQUE FOR VIDEO SEQUENCES BY MELODY I. BONHAM THESIS Submitted in partial fulfillment of the requirements for the degree of Master of
More informationMultiresolution schemes
Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Multi-dimensional signal processing Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione
More informationFrom Fourier to Wavelets in 60 Slides
From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier
More information2256. Application of empirical mode decomposition and Euclidean distance technique for feature selection and fault diagnosis of planetary gearbox
56. Application of empirical mode decomposition and Euclidean distance technique for feature selection and fault diagnosis of planetary gearbox Haiping Li, Jianmin Zhao, Jian Liu 3, Xianglong Ni 4,, 4
More informationMedical Image Processing
Medical Image Processing Federica Caselli Department of Civil Engineering University of Rome Tor Vergata Medical Imaging X-Ray CT Ultrasound MRI PET/SPECT Digital Imaging! Medical Image Processing What
More informationSignal Period Analysis Based on Hilbert-Huang Transform and Its Application to Texture Analysis
Signal Period Analysis Based on Hilbert-Huang Transform and Its Application to Texture Analysis Zhihua Yang 1, Dongxu Qi and Lihua Yang 3 1 School of Information Science and Technology Sun Yat-sen University,
More informationMultilevel Analysis of Continuous AE from Helicopter Gearbox
Multilevel Analysis of Continuous AE from Helicopter Gearbox Milan CHLADA*, Zdenek PREVOROVSKY, Jan HERMANEK, Josef KROFTA Impact and Waves in Solids, Institute of Thermomechanics AS CR, v. v. i.; Prague,
More informationRecent developments on sparse representation
Recent developments on sparse representation Zeng Tieyong Department of Mathematics, Hong Kong Baptist University Email: zeng@hkbu.edu.hk Hong Kong Baptist University Dec. 8, 2008 First Previous Next Last
More informationVIBRATION TRANSFER PATH ANALYSIS BASED ON PSEUDO FORCE
VIBRATION TRANSFER PATH ANALYSIS BASED ON PSEUDO FORCE Yan Weiguang, Wuhan University of Technology, School of Mechanical and Electrical Engineering, Wuhan, China Pan Yunping Wuhan University of Technology,
More informationAnalytic discrete cosine harmonic wavelet transform(adchwt) and its application to signal/image denoising
Analytic discrete cosine harmonic wavelet transform(adchwt) and its application to signal/image denoising M. Shivamurti and S. V. Narasimhan Digital signal processing and Systems Group Aerospace Electronic
More informationWavelets and multiresolution representations. Time meets frequency
Wavelets and multiresolution representations Time meets frequency Time-Frequency resolution Depends on the time-frequency spread of the wavelet atoms Assuming that ψ is centred in t=0 Signal domain + t
More informationLogarithmic quantisation of wavelet coefficients for improved texture classification performance
Logarithmic quantisation of wavelet coefficients for improved texture classification performance Author Busch, Andrew, W. Boles, Wageeh, Sridharan, Sridha Published 2004 Conference Title 2004 IEEE International
More informationJournal of Engineering Science and Technology Review 6 (2) (2013) Research Article. Received 25 June 2012; Accepted 15 January 2013
Jestr Journal of Engineering Science and Technology Review 6 () (3) 5-54 Research Article JOURNAL OF Engineering Science and Technology Review www.jestr.org Fault Diagnosis and Classification in Urban
More informationDigital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design
Digital Speech Processing Lecture Short-Time Fourier Analysis Methods - Filter Bank Design Review of STFT j j ˆ m ˆ. X e x[ mw ] [ nˆ m] e nˆ function of nˆ looks like a time sequence function of ˆ looks
More informationIntroduction to Mathematical Programming
Introduction to Mathematical Programming Ming Zhong Lecture 25 November 5, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 19 Table of Contents 1 Ming Zhong (JHU) AMS Fall 2018 2 / 19 Some Preliminaries: Fourier
More informationElec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis
Elec461 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis Dr. D. S. Taubman May 3, 011 In this last chapter of your notes, we are interested in the problem of nding the instantaneous
More informationDeep Learning: Approximation of Functions by Composition
Deep Learning: Approximation of Functions by Composition Zuowei Shen Department of Mathematics National University of Singapore Outline 1 A brief introduction of approximation theory 2 Deep learning: approximation
More informationA NEW BASIS SELECTION PARADIGM FOR WAVELET PACKET IMAGE CODING
A NEW BASIS SELECTION PARADIGM FOR WAVELET PACKET IMAGE CODING Nasir M. Rajpoot, Roland G. Wilson, François G. Meyer, Ronald R. Coifman Corresponding Author: nasir@dcs.warwick.ac.uk ABSTRACT In this paper,
More informationDenoising via Recursive Wavelet Thresholding. Alyson Kerry Fletcher. A thesis submitted in partial satisfaction of the requirements for the degree of
Denoising via Recursive Wavelet Thresholding by Alyson Kerry Fletcher A thesis submitted in partial satisfaction of the requirements for the degree of Master of Science in Electrical Engineering in the
More informationWavelets and Signal Processing
Wavelets and Signal Processing John E. Gilbert Mathematics in Science Lecture April 30, 2002. Publicity Mathematics In Science* A LECTURE SERIES FOR UNDERGRADUATES Wavelets Professor John Gilbert Mathematics
More informationSatellite image deconvolution using complex wavelet packets
Satellite image deconvolution using complex wavelet packets André Jalobeanu, Laure Blanc-Féraud, Josiane Zerubia ARIANA research group INRIA Sophia Antipolis, France CNRS / INRIA / UNSA www.inria.fr/ariana
More informationCorrelation Coefficient of Simplified Neutrosophic Sets for Bearing Fault Diagnosis
Correlation Coefficient of Simplified Neutrosophic Sets for Bearing Fault Diagnosis Lilian Shi Department of Electrical and Information Engineering, Shaoxing University, 508 Huancheng West Road, Shaoxing,
More informationModule 4. Multi-Resolution Analysis. Version 2 ECE IIT, Kharagpur
Module 4 Multi-Resolution Analysis Lesson Multi-resolution Analysis: Discrete avelet Transforms Instructional Objectives At the end of this lesson, the students should be able to:. Define Discrete avelet
More informationWavelets in Pattern Recognition
Wavelets in Pattern Recognition Lecture Notes in Pattern Recognition by W.Dzwinel Uncertainty principle 1 Uncertainty principle Tiling 2 Windowed FT vs. WT Idea of mother wavelet 3 Scale and resolution
More informationMultiresolution analysis
Multiresolution analysis Analisi multirisoluzione G. Menegaz gloria.menegaz@univr.it The Fourier kingdom CTFT Continuous time signals + jωt F( ω) = f( t) e dt + f() t = F( ω) e jωt dt The amplitude F(ω),
More information1983. Gearbox fault diagnosis based on local mean decomposition, permutation entropy and extreme learning machine
1983. Gearbox fault diagnosis based on local mean decomposition, permutation entropy and extreme learning machine Yu Wei 1, Minqiang Xu 2, Yongbo Li 3, Wenhu Huang 4 Department of Astronautical Science
More informationCompressed Sensing and Neural Networks
and Jan Vybíral (Charles University & Czech Technical University Prague, Czech Republic) NOMAD Summer Berlin, September 25-29, 2017 1 / 31 Outline Lasso & Introduction Notation Training the network Applications
More informationSPEECH ANALYSIS AND SYNTHESIS
16 Chapter 2 SPEECH ANALYSIS AND SYNTHESIS 2.1 INTRODUCTION: Speech signal analysis is used to characterize the spectral information of an input speech signal. Speech signal analysis [52-53] techniques
More informationDESIGN AND PERFORMANCE OF THE CONVERGING-DIVERGING VORTEX FLOWMETER
Metrol. Meas. Syst., Vol. XVIII (011), No. 1, pp. 19-136 METROLOGY AND MEASUREMENT SYSTEMS Index 330930, ISSN 0860-89 www.metrology.pg.gda.pl DESIGN AND PERFORMANCE OF THE CONVERGING-DIVERGING VORTEX FLOWMETER
More informationWEAK SIGNAL DETECTION BASED ON TWO DIMENSIONAL STOCHASTIC RESONANCE. Leonardo Barbini, Matthew O. T. Cole, Andrew J. Hillis, Jonathan L.
WEAK SIGNAL DETECTION BASED ON TWO DIMENSIONAL STOCHASTIC RESONANCE Leonardo Barbini, Matthew O. T. Cole, Andrew J. Hillis, Jonathan L. du Bois University of Bath Department of Mechanical Engineering Claverton
More informationMultiresolution schemes
Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione dei Segnali Multi-dimensionali e
More informationSome Interesting Problems in Pattern Recognition and Image Processing
Some Interesting Problems in Pattern Recognition and Image Processing JEN-MEI CHANG Department of Mathematics and Statistics California State University, Long Beach jchang9@csulb.edu University of Southern
More informationWavelet Footprints: Theory, Algorithms, and Applications
1306 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 51, NO. 5, MAY 2003 Wavelet Footprints: Theory, Algorithms, and Applications Pier Luigi Dragotti, Member, IEEE, and Martin Vetterli, Fellow, IEEE Abstract
More information