小波与傅里叶分析基础第14讲.pptVIP

14 Key words and expressions classification moments vanishing moments singularity detection 6.1 Daubechiess Construction n=2N-1 For every N, there will be 2N nonzero, real scaling coefficients p0,…,p2N-1, resulting in a scaling function and wavelet that are supported on the interval . where the degree of is N-1 and 6.2 Classification, Moments, and Smoothness Let m(N) be the mth moments of a function f: where N is a positive integer. Proposition 6.1 For the Daubechies wavelet, we have has N vanishing moments. The more vanishing moments that f has, the smoother is the transition from one approximation space to the next. Moreover, vanishing moments has relation to the rate of attenuation. Properties of vanishing moments The following five statements are equivalent: has N vanishing moments has m eigenvalue. is k degree polynomial. Daubechies condition Suppose the function satisfies Then Classification Daubechies wavelets are classified according to the number of vanishing moments they have. The smoothness of the scaling function and wavelet increase with the number of vanishing moments. The application of vanishing moments We can use moments to approximate the wavelet coefficients. Singularity Detection 6.3 Computational Issues We want to use Db2 wavelets to decompose a signal that we have n samples for , This is the overspill problem. To solve the overspill problem, we need to extend the signal in some fashion beyond our initial set of samples. Here are a few of the standard choices. Zero padding Extend the signal by adding zeros at the two ends. Periodic extension Reuse the sampled data by making the signal periodic, so that sk+n =sk. Smooth padding Extend the signal by linearly extrapolating the data near the two ends Symmetric extensions The signal is evenly extended at the endpoints by reflection. 6.4 The S