Wavelet Toolbox
  Go to function:
    Search    Help Desk 
wpdencmp    Examples   See Also

De-noising or compression using wavelet packet.

Syntax

Description

wpdencmp is a one- or two-dimensional de-noising and compression oriented function.

wpdencmp performs a de-noising or compression process of a signal or an image, using wavelet packet. The ideas and the procedures for de-noising and compression using wavelet packet are the same as those used in the wavelets framework (see wden and wdencmp).

[XD,TREED,DATAD,PERF0,PERFL2] =
wpdencmp(X,SORH,N,
'wname',CRIT,PAR,KEEPAPP) returns a de-noised or compressed version XD of input signal X (one- or two-dimensional) obtained by wavelet packet coefficients thresholding.

Additional output arguments [TREED,DATAD] are the wavelet packet best decomposition structure (see besttree) of XD. PERFL2 and PERF0 are L2 recovery and compression scores in percentages.

PERFL2 = 100 * (vector-norm of WP-cfs of XD / vector-norm of WP-cfs of X)2.

If X is a one-dimensional signal and 'wname' an orthogonal wavelet, PERFL2 is

reduced to


.

SORH ('s' or 'h') is for soft or hard thresholding (see wthresh for more details).

Wavelet packet decomposition is performed at level N and 'wname' is a string containing wavelet name. Best decomposition is performed using entropy criterion defined by string CRIT and parameter PAR (see wentropy for details). Threshold parameter is also PAR. If KEEPAPP = 1, approximation coefficients cannot be thresholded, otherwise it is possible.

[XD,TREED,DATAD,PERF0,PERFL2] =
wpdencmp(TREE,DATA,SORH,CRIT,PAR,KEEPAPP)
has the same output arguments, using the same options as above, but obtained directly from the input wavelet packet decomposition structure [TREE,DATA] (see maketree and wpdec) of the signal to be de-noised or compressed.

In addition if CRIT = 'nobest' no optimization is done and the current decomposition is thresholded.

Examples

See Also

ddencmp, wdencmp, wentropy, wpdec, wpdec2

References

A. Antoniadis, G. Oppenheim, Eds. (1995), "Wavelets and statistics," Lecture Notes in Statistics, 103, Springer Verlag.

R.R. Coifman, M.V. Wickerhauser, (1992), "Entropy-based algorithms for best basis selection," IEEE Trans. on Inf. Theory, vol. 38, 2, pp. 713-718.

R.A. DeVore, B. Jawerth, B.J. Lucier (1992), "Image compression through wavelet transform coding," IEEE Trans. on Inf. Theory, vol. 38, No 2, pp. 719-746.

D.L. Donoho (1993), "Progress in wavelet analysis and WVD: a ten minute tour," in Progress in wavelet analysis and applications, Y. Meyer, S. Roques, pp. 109-128. Frontières Ed.

D.L. Donoho, I.M. Johnstone(1994), "Ideal spatial adaptation by wavelet shrinkage," Biometrika, vol 81, pp. 425-455.

D.L. Donoho, I.M. Johnstone, G. Kerkyacharian, D. Picard (1995), "Wavelet shrinkage: asymptopia," Jour. Roy. Stat. Soc., series B, vol. 57 no. 2, pp. 301-369.



[ Previous | Help Desk | Next ]