z-logo
open-access-imgOpen Access
'Analytic' wavelet thresholding
Author(s) -
Sofia C. Olhede
Publication year - 2004
Publication title -
biometrika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.307
H-Index - 122
eISSN - 1464-3510
pISSN - 0006-3444
DOI - 10.1093/biomet/91.4.955
Subject(s) - mathematics , discrete wavelet transform , stationary wavelet transform , thresholding , wavelet transform , wavelet , harmonic wavelet transform , second generation wavelet transform , wavelet packet decomposition , pattern recognition (psychology) , hilbert transform , lifting scheme , artificial intelligence , mathematical analysis , statistics , computer science , spectral density , image (mathematics)
We introduce so-called analytic stationary wavelet transform thresholding where, using the discrete Hilbert transform, we create a complex-valued 'analytic' vector from which an amplitude vector is defined. Thresholding of a real-valued wavelet coefficient at some transform level is carried out according to the corresponding value in this amplitude vector; relevant statistical results follow from properties of the discrete Hilbert transform. Analytic stationary wavelet transform thresholding is found to produce consistently a reduced mean squared error compared to using standard stationary wavelet transform, or 'cycle spinning', thresholding. For signals with extensive oscillations at some transform levels, this improvement is very marked. Furthermore we show that our thresholding test is invariant to phase shifts in the data, whereas, if complex wavelet filters are being used, the filters must be analytic or anti-analytic at each level of the wavelet transform. Copyright 2004, Oxford University Press.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom