<< Chapter < Page Chapter >> Page >
E μ | | μ ^ ( X ) - μ | | 2 = s + E μ | | g ( X ) | | 2 + 2 g ( X )

with,

g i = 1 s g i x i

If an operator SURE is defined as (Equation ):

S U R E ( λ ; X ) = s - 2 · # { i : | X i | λ } + [ min ( | X i | , λ ) ] 2

where the operator # { A } returns the cardinality of the set A, it is found that SURE is an unbiased estimate of the l 2 - risk, i.e,

E μ | | μ ^ ( X ) - μ | | 2 = S U R E ( λ ; X )

Now, the threshold λ is found by minimizing SURE over the set X of give data. Extending this principle to the entire set of resolution levels, an expression for λ j s is found (Equation ):

λ j s = arg min 0 λ λ U S U R E ( λ ; d ^ j k σ ^ ) , j = j 0 , ... , J - 1 ; k = 0 , ... , 2 j - 1

where λ U is the universal threshold, and σ ^ is the estimator of the noise level (Equation ).

Classical methods: block thresholding

Thresholding approaches resorting to term-by-term modification on the wavelets coefficients attempt to balance variance and bias contribution to the mean squared error in the estimation of the underlying signal g . However, it has been proven that such balance is not optimal. Term-by-term thresholding end sup removing to many terms leadingto estimation prone to bias and with a slower convergance rate due to the number of operations involved.

A useful resource to improve the quality of the aforementioned balanced is by using information of the set of data associated to a particular wavelet coefficient. In order to do so, a block strategy for thresholded is proposed.The main idea consists in isolating a block of wavelet coefficients and based upon the information collected about the entire set make a decision about decreasing or even entirely discard the group. This procedure will allow fastermanipulation of the information and accelerated convergence rates.

Overlapping block thresholding estimator

cai2001 considered an overlapping block thresholding estimator by modifying the nonoverlapping block thresholding estimator citep( ). The effect is that the treatment of empirical wavelet coefficients in the middle of each block depends on the data in the whole block. At each resolution level, this method packswavelet coefficients d ^ j k into nonoverlapping blocks ( j b ) of length L 0 . Following this, the blocks are extended in each direction an amount L 1 = max ( 1 ; [ L 0 2 ] ) , generating overlapping blocks ( j B ) of augmented length L = L 0 + 2 L 1 .

If S ( j B ) 2 is the L 2 - energy of the empirical signal in the augmented block j B , the wavelet coefficients in the blocks j b will be estimated simultaneously using the expression in Equation

d ˘ j k ( j b ) = max 0 , S ( j B ) 2 - λ L σ ^ 2 S ( j B ) 2 d ^ j k

Once the estimated wavelet coefficients d ˘ j k ( j b ) have been calculated, an estimation of the underlying signal g can be obtained through using the new wavelet coefficients and the unmodified scaling coefficients c ^ j 0 k in the IDWT. The results from this method ( NeigBlock ) presented in this document used a value of L 0 = [ l o g ( n 2 ) ] and a value of λ = 4 . 50524 as suggested by cai2001.

Bayesian approach to wavelet shrinkage and thresholding

From Equations and it can be established that the empirical scaling and wavelet coefficients, conditional on their respective underlying coefficients, are independently distributed, i.e:

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Elec 301 projects fall 2008. OpenStax CNX. Jan 22, 2009 Download for free at http://cnx.org/content/col10633/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Elec 301 projects fall 2008' conversation and receive update notifications?

Ask