Skip to main content

Discrete Wavelet Transforms

  • Chapter
  • First Online:
Digital Signal Processing
  • 5650 Accesses

Abstract

Fourier transform has been extensively used in signal processing to analyze stationary signals. A serious drawback of the Fourier transform is that it cannot reflect the time evolution of the frequency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. A. Grossman, J. Morlet, Decompositions of hardy functions into square integrable wavelets of constant shape. SIAM J Math Anal 15(4), 75–79 (1984)

    Article  MathSciNet  Google Scholar 

  2. Y. Meyer, Ondelettes et fonctions splines Seminaire EDP (Ecole Polytechnique, Paris, 1986)

    Google Scholar 

  3. I. Daubechies, Orthonormal bases of compactly supported wavelets. Commun. Pure Appl. Math. 41(7), 909–996 (1988)

    Article  MathSciNet  Google Scholar 

  4. S. Mallat, A Wavelet Tour of Signal Processing, 2nd edn. (Academic Press, 1999)

    Chapter  Google Scholar 

  5. G.S. Strang, T.Q. Nguyen, Wavelets and Filter Banks (Wellesley Cambridge Press, MA, 1996)

    MATH  Google Scholar 

  6. I. Daubechies, Ten Lectures on Wavelets (SIAM, CBMS Series, April 1992)

    Google Scholar 

  7. R. Coifman, Y. Meyer, S. Quaker, V. Wickerhauser, Signal Processing and Compression with Wavelet Packets (Numerical Algorithms Research Group, New Haven, CT: Yale University, 1990)

    Google Scholar 

  8. C.K. Chui, An introduction to wavelets, Academic Press,1992

    Google Scholar 

  9. M. Vetterli, J. Kovacevic, Wavelets and Subband Coding (Prentice-Hall, 1995)

    Google Scholar 

  10. P. Steffen et al., Theory of regular M-band wavelet bases. IEEE Trans. Signal Process. 41, 3487–3511 (1993)

    Article  Google Scholar 

  11. Peter N. Heller, Rank-m wavelet matrices with n vanishing moments. SIAM J. Matrix Anal. 16, 502–518 (1995)

    Article  MathSciNet  Google Scholar 

  12. Gilbert Strang, Wavelets and dilation equations. SIAM Rev. 31, 614–627 (1989)

    Article  MathSciNet  Google Scholar 

  13. A. Cohen, I. Daubechies, J.C. Feauveau, Biorthogonal bases of compactly supported wavelets. Commun. Pure Appl. Math. XLV, 485–560 (1992)

    Article  MathSciNet  Google Scholar 

  14. S.K. Mitra, Digital Signal Processing—A Computer Based Approach (McGraw-Hill Inc, NY, 2006)

    Google Scholar 

  15. M.V. Wickerhauser, Acoustic Signal Compression with Wavelet Packets, in Wavelets: A Tutorial in Theory and Applications, ed. by C.K. Chui (New York Academic, 1992), pp. 679–700

    Chapter  Google Scholar 

  16. M. Misiti, Y. Misiti, G. Oppenheim, J-M. poggi, Wavelets and Their Applications (ISTEUSA, 2007)

    Google Scholar 

  17. M.Rao Raghuveer, Ajit S. Bopardikar, Wavelet Transforms: Introduction to Theory and Applications (Pearson Education, Asia, 2000)

    MATH  Google Scholar 

  18. Y. Zhao, M.N.S. Swamy, Technique for designing biorthogonal wavelet filters with an application to image compression. Electron. Lett. 35 (18) (September 1999)

    Article  Google Scholar 

  19. K.D. Rao, E.I. Plotkin, M.N.S. Swamy, An Hybrid Filter for Restoration of Color Images in the Mixed Noise Environment, in Proceedings of ICASSP, vol. 4 (2002), pp. 3680–3683

    Google Scholar 

  20. N. Gupta, E.I. Plotkin, M.N.S. Swamy, Wavelet domain-based video noise reduction using temporal dct and hierarchically-adapted thresholding. IEE Proceedings of—Vision, Image and Signal Processing 1(1), 2–12 (2007)

    Google Scholar 

  21. M.I.H. Bhuiyan, M.O. Ahmad, M.N.S. Swamy, Wavelet-based image denoisingwith the normal inverse gaussian prior and linear minimum mean squared error estimator. IET Image Proc. 2(4), 203–217 (2008)

    Article  Google Scholar 

  22. M.I.H. Bhuiyan, M.O. Ahmad, M.N.S. Swamy, Spatially-adaptive thresholding in wavelet domain for despeckling of ultrasound images. IET Image Proc. 3, 147–162 (2009)

    Article  Google Scholar 

  23. S.M.M. Rahman, M.O. Ahmad, M.N.S. Swamy, Video denoising based on inter-frame statistical modeling of wavelet coefficients. IEEE Trans. Circuits Syst. Video Technol. 17, 187–198 (2007)

    Article  Google Scholar 

  24. S.M.M. Rahman, M.O. Ahmad, M.N.S. Swamy, Bayesian wavelet-based imagedenoising using the gauss-hermite expansion. IEEE Trans. Image Process. 17, 1755–1771 (2008)

    Article  MathSciNet  Google Scholar 

  25. S.M.M. Rahman, M.O. Ahmad, M.N.S. Swamy, A new statistical detector for dwt-based additive image watermarking using the gauss-hermite expansion. IEEE Trans. Image Process. 18, 1782–1796 (2009)

    Article  MathSciNet  Google Scholar 

  26. S.M.M. Rahman, M.O. Ahmad, M.N.S. Swamy, Contrast-based fusion of noisy images using discrete wavelet transform. IET Image Proc. 4, 374–384 (2010)

    Article  MathSciNet  Google Scholar 

  27. D.L. Donoho, L.M. Johnstone, Adapting to unknown smoothness via wavelet shrinkage. J Am. Stat. Soc. 90, 1200–1224 (1995)

    Article  MathSciNet  Google Scholar 

  28. D.L. Donoho, L.M. Johnstone, Ideal spatial adaptation via wavelet shrinkage. Biometrika 81, 425–455 (1994)

    Article  MathSciNet  Google Scholar 

  29. L.M. Johnstone, B.W. Silverman, Wavelet threshold estimators for data with correlated noise. J Roy. Stat. Soc. B 59, 319–351 (1997)

    Article  MathSciNet  Google Scholar 

  30. K.D. Rao, New Approach for Digital Image Watermarking and transmission over Bursty WirelessChannels, in Proceedings of IEEE International Conference on Signal Processing (Beijing, 2010)

    Google Scholar 

  31. G.K. Wallace, The JPEG still picture compression standard. IEEE Trans. Consumer Electron. 38, xviii–xxxiv (1992)

    Article  Google Scholar 

  32. W.B. Pennebaker, J.L. Mitcell, JPEG: Still Image Data Compression Standard (Van Nostrand Reinhold, New York, 1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Deergha Rao .

Appendix

Appendix

  • blocksize.m

  • _______________________________________________________________

  • %Here watermark image is referred with 8x8 block size

  • function [rw1 cw1 rc cc]=blocksize(wg,H2)

  • w1=mod(size(wg,1),8);

  • w2=mod(size(wg,2),8);

  • if(w1==0)

  •     w1=w1+8;

  • end;

  • if(w2==0)

  •     w2=w2+8;

  • end;

  • rw=(size(wg,1)-w1)/8;

  • rw1=rw;

  • cw=(size(wg,2)-w2)/8;

  • cw1=cw;

  • c1=mod(size(H2,1),rw);

  • c2=mod(size(H2,2),cw);

  • if(c1==0)

  •     c1=mod(size(H2,1),rw+1);

  •     rw1=rw+1;

  • end;

  • if(c2==0)

  •     c2=mod(size(H2,2),cw+1);

  •     cw1=cw+1;

  • end;

  • rc=(size(H2,1)-c1)/rw1;

  • cc=(size(H2,2)-c2)/cw1;

  • embed.m

  • -----------------------------------------------------------------------------------------------

  • function H2=embed(key,wg,H2,rw1,cw1,rc,cc)

  • g=2;

  • rand(′state′,key);

  • cr1=1;

  • wr1=1;

  • wmd1=[];

  • for i=1:rw1

  •     wmd2=[];

  •     cr2=i*rc;

  •     wr2=i*8;

  •     if(i==rw1)

  •         cr2=size(H2,1);

  •         wr2=size(wg,1);

  •     end;

  •     cc3=1;

  •     wc3=1;

  •     for j=1:cw1

  •         cc4=j*cc;

  •         wc4=j*8;

  •         if(j==cw1)

  •             cc4=size(H2,2);

  •             wc4=size(wg,2);

  •         end;

  •         h=H2(cr1:cr2,cc3:cc4);

  •         msg=wg(wr1:wr2,wc3:wc4);

  •         msg=reshape(msg,size(msg,1)*size(msg,2),1);

  •      for k=1:length(msg)

  •             pn=3*round(2*(rand(size(h,1),size(h,2))-0.5)); % generation of PN sequence

  •             if msg(k)==0

  •                 h=h+g*pn;

  •             end;

  •         end;

  •         wmd2=[wmd2 h];

  •         cc3=cc4+1;

  •         wc3=wc4+1;

  •     end;    

  •     wmd1=[wmd1;wmd2];

  •     cr1=cr2+1;

  •     wr1=wr2+1;

  • end;

  • H2=wmd1;

  • extract.m

  • -----------------------------------------------------------------------------------------------

  • function extract=extract(key,wg,H3,rw1,cw1,rc,cc)

  • g=2;rand(′state′,key);cr1=1;wr1=1;p=1;correlation=ones(size(wg,1)*size(wg,2),1);

  • for i=1:rw1

  •     cr2=i*rc;  wr2=i*8;

  •     if(i==rw1)

  •         cr2=size(H3,1); wr2=size(wg,1);

  •     end;

  •     cc3=1; wc3=1;

  •     for j=1:cw1

  •         cc4=j*cc;wc4=j*8;

  •         if(j==cw1)

  •             cc4=size(H3,2);wc4=size(wg,2);

  •         end;

  •      h=H3(cr1:cr2,cc3:cc4);msg=wg(wr1:wr2,wc3:wc4);msg=reshape(msg,size(msg,1)*size(msg,2),1);

  •         for k=1:length(msg)

  •             pn=3*round(2*(rand(size(h,1),size(h,2))-0.5)); % generation of PN sequence

  •             correlation(p)=corr2(h,g*pn);p=p+1;

  •         end;

  •         cc3=cc4+1;wc3=wc4+1;

  •     end;    

  •     cr1=cr2+1;wr1=wr2+1;

  • end;

  • threshold=mean(abs(correlation));

  • p=1;wr1=1;

  • wmd1=[];

  • for i=1:rw1

  •     wmd2=[];wr2=i*8;

  •     if(i==rw1)

  •         wr2=size(wg,1);

  •     end;

  •     wc3=1;

  •     for j=1:cw1

  •         wc4=j*8;

  •         if(j==cw1)

  •             wc4=size(wg,2);

  •         end;

  •         msg=wg(wr1:wr2,wc3:wc4);

  •         we=ones(size(msg,1),size(msg,2));msg=reshape(msg,size(msg,1)*size(msg,2),1);

  •         for k=1:length(msg)

  •             if(correlation(p)>threshold)

  •                we(k)=0;

  •             end;

  •             p=p+1;

  •         end;

  •         wmd2=[wmd2 we];wc3=wc4+1;

  •     end;    

  •     wmd1=[wmd1;wmd2]; wr1=wr2+1;end;extract=wmd1;

  • extracthost.m

  • -----------------------------------------------------------------------------------------------

  • function H2=extracthost(key,wg,H2,rw1,cw1,rc,cc)

  • g=1;

  • rand(′state′,key);

  • cr1=1;

  • wr1=1;

  • wmd1=[];

  • for i=1:rw1

  •     wmd2=[];

  •     cr2=i*rc;

  •     wr2=i*8;

  •     if(i==rw1)

  •         cr2=size(H2,1);

  •         wr2=size(wg,1);

  •     end;

  •     cc3=1;

  •     wc3=1;

  •     for j=1:cw1

  •         cc4=j*cc;

  •         wc4=j*8;

  •         if(j==cw1)

  •             cc4=size(H2,2);

  •             wc4=size(wg,2);

  •         end;

  •         h=H2(cr1:cr2,cc3:cc4);

  •         msg=wg(wr1:wr2,wc3:wc4);

  •         msg=reshape(msg,size(msg,1)*size(msg,2),1);

  •         for k=1:length(msg)

  •             pn=3*round(2*(rand(size(h,1),size(h,2))-0.5)); % generation of PN sequence

  •             if msg(k)==0

  •                 h=h-g*pn;

  •             end;

  •         end;

  •         wmd2=[wmd2 h];

  •         cc3=cc4+1;

  •         wc3=wc4+1;

  •     end;    

  •     wmd1=[wmd1;wmd2];

  •     cr1=cr2+1;

  •     wr1=wr2+1;

  • end;

  • H 2=wmd1;

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Rao, K., Swamy, M. (2018). Discrete Wavelet Transforms. In: Digital Signal Processing. Springer, Singapore. https://doi.org/10.1007/978-981-10-8081-4_10

Download citation

Publish with us

Policies and ethics