Discrete Wavelet Transforms Of Haar's Wavelet - IJSTR

1y ago
13 Views
2 Downloads
609.56 KB
5 Pages
Last View : 19d ago
Last Download : 3m ago
Upload by : Oscar Steel
Transcription

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 3, ISSUE 9, SEPTEMBER 2014ISSN 2277-8616Discrete Wavelet Transforms Of Haar’s WaveletBahram Dastourian, Elias Dastourian, Shahram Dastourian, Omid MahnaieAbstract: Wavelet play an important role not only in the theoretic but also in many kinds of applications, and have been widely applied in signalprocessing, sampling, coding and communications, filter bank theory, system modeling, and so on. This paper focus on the Haar’s wavelet. We discusson some command of Haar’s wavelet with its signal by MATLAB programming. The base of this study followed from multiresolution analysis.Keyword: approximation; detail; filter; Haar’s wavelet; MATLAB programming, multiresolution analysis.—————————— ——————————1 INTRODUCTIONWavelets are a relatively recent development in appliedmathematics. Their name itself was coined approximately adecade ago (Morlet, Arens, Fourgeau, and Giard [11], Morlet[10], Grossmann, Morlet [3] and Mallat[9]); in recently yearsinterest in them has grown at an explosive rate. There areseveral reasons for their present success. On the one hand,the concept of wavelets can be viewed as a synthesis of ideaswhich originated during the last twenty or thirty years inengineering (subband coding), physics (coherent states,renormalization group), and pure mathematics (study ofCalderon-Zygmund operators). As a consequence of theseinterdisciplinary origins, wavelets appeal to scientists andengineers of many different backgrounds. On the other hand,wavelets are a fairly simple mathematical tool with a greatvariety of possible applications. Already they have led toexciting applications in signal analysis (sound, images) (someearly references are Kronland-Martinet, Morlet andGrossmann [4], Mallat [6], [8]; more recent references aregiven later) and numerical analysis (fast algorithms for integraltransforms in Beylkin, Coifman, and Rokhlin [1]); many otherapplications are being studied. This wide applicability alsocontributes to the interest they generate. P.J. Wood in [15]developed the wavelet in the Hilbert C*-module case. Also J.A.Packer and M.A. Rieffel [12] and Z. Liu, X. Mu and G. Wu [5]studies this concept in L2 (Rd ).Definition 4. Let 𝐻 be a Hilbert spacei) A family 𝒙𝒋 𝑯 is an orthonormal system if𝒋 𝑱 𝑖, 𝑗 𝐽 ii) A family 𝒙𝒋𝒋 𝑱1 𝑖 𝑗,0 𝑖 𝑗.𝑥𝑖 , 𝑥𝑗 𝑯 is total if for all 𝒙 𝑯 the followingimplication holds 𝑗 𝐽 𝑥, 𝑥𝑗 0 𝑥 0.iii) A total orthonormal system is called orthonormal basis.Definition 5. Let 𝐻 and 𝐻0 be Hilbert spaces and 𝑇: 𝐻 𝐻0be a bounded linear operator. Then 𝑇 is an (orthogonal)projection if 𝑇 𝑇 𝑇 2 .Definition 6. Let (𝑋, 𝛽, 𝜇) be a measure space.i) 𝑓: 𝑋 𝑅𝑛 is called measurable if 𝑓 1 𝐵 𝛽 for all Borelsets 𝐵. The space of measurable functions 𝑋 𝐶 is denotedby 𝑀(𝑋).ii) For 1 𝑝 , the space 𝐿𝑝 𝑋, 𝜇 𝐿𝑝 (𝑋) is defined by𝑝𝐿𝑝 𝑋 {𝑓 𝑀 𝑋 𝑑𝜇 𝑥 𝑓 𝑥𝑋𝑝endowed with the 𝐿 -norm2 PRELIMINARIESDetailed In this section we give some Definition and Theoremthat we need for the results. For more details about followingconcepts and proof of Theorems one can see [2, 7, 14]. In thesequel, we denoted the integer, real and complex numbers by𝑍, 𝑅 and 𝐶, respectively.1𝑝𝑝𝑓𝑝 𝑓 𝑥𝑑𝜇 𝑥𝑋For 𝒑 we let𝐿 𝑋 {𝑓 𝑀 𝑋 𝑓 }Where𝑓 inf 𝛼 𝑓 𝑥 𝛼 𝑎. 𝑒. .𝐿𝑝 𝑋 is complete with respect to the metric 𝑑(𝑓, 𝑔) 𝑓 𝑔 𝑝 ; this makes 𝐿𝑝 𝑋 a Banach space. 𝐿2 𝑋 is a Hilbertspace, with scalar product 𝑓, 𝑔 Bahram Dastourian, Department of Mathematics,Dehdasht Branch, Islamic Azad University, Dehdasht,Iran. E-mail: bdastorian@gmail.comShahram Dastourian, Elias Dastourian, OmidMahnaie, Department of Mathematics, DehdashtBranch, Islamic Azad University, Dehdasht, Iran𝑓 𝑥 𝑔 𝑥 𝑑𝜇 𝑥 .𝑋For more details one can saw [13].Definition 7. The Fourier transform of a function 𝑓 𝐿1 (𝑅) is𝑓 𝜔 𝑓 𝑥 𝑒 2𝜋𝑖𝑤𝑥 𝑑𝜇(𝑥), for 𝜔 𝑅. If 𝑓 𝐿1 (𝑅) then 𝑓 is247IJSTR 2014www.ijstr.org

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 3, ISSUE 9, SEPTEMBER 2014continuous with 𝑓 𝑥 𝑓 𝑤 𝑒 2𝜋𝑖𝑤𝑥 𝑑𝜇(𝑤). The Fouriertransform is the linear operator 𝐹: 𝑓 𝑓 .Definition 8. Let 𝜔, 𝑥, 𝑎 𝑅, with 𝑎 0. We define𝑇𝑥 𝑓 𝑦 𝑓 𝑦 𝑥 ,𝑇𝑟𝑎𝑛𝑠𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑝𝑒𝑟𝑎𝑡𝑜𝑟𝐷𝑎 𝑓 𝑦 𝑎 1/2 𝑓 𝑎 1 𝑦 ,𝐷𝑖𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑝𝑒𝑟𝑎𝑡𝑜𝑟𝑀𝜔 𝑓 𝑦 𝑒 2𝜋𝑖𝜔𝑦 𝑓 𝑦 , 𝑀𝑜𝑑𝑢𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑝𝑒𝑟𝑎𝑡𝑜𝑟All these operators are easily checked to be unitary on 𝐿2 (𝑅).Dilation and translation have a simple geometrical meaning. 𝑇𝑥amounts to shifting a graph of a function by 𝑥, whereas 𝐷𝑎 is adilation of the graph by a along the 𝑥-axis, with a dilationby 𝑎 1/2 along the 𝑦-axis: If 𝑠𝑢𝑝𝑝𝑓 [0, 1], then𝑠𝑢𝑝𝑝(𝐷𝑎 𝑓) [0, 𝑎]and𝑠𝑢𝑝𝑝(𝑇𝑥 𝑓) [𝑥, 𝑥 1],where𝑠𝑢𝑝𝑝 𝑔 {𝑥 𝑔 𝑥 0}.Definition 9. If 𝑓, 𝑔 are complex-valued functions defined on𝑅, their convolution 𝑓 𝑔 is the function (𝑓 𝑔) 𝑥 𝑓 𝑥 𝑦 𝑔 𝑦 𝑑𝜇(𝑦), provided that the integral exists.Definition ?. Let 𝑚: 𝑅 𝐶 be a bounded measurablefunction. Then the associated multiplication operator𝑆𝑚 : 𝐿2 𝑅 𝐿2 (𝑅), 𝑆𝑚 (𝑓)(𝑥) 𝑚(𝑥)𝑓(𝑥) is a bounded linearoperator. An operator 𝑄: 𝐿2 𝑅 𝐿2 (𝑅) is called (linear) filter ifthere exists 𝑚 𝐿 (𝑅) such thatFor all 𝑓 𝐿2 (𝑅), 𝑄𝑓̂(inverse) scale or (with some freedom) frequency parameter.Thus the inclusion property ―1‖ has a quite naturalinterpretation: Increasing resolution amounts to addinginformation. If we denote by 𝑃𝑗 the projection onto 𝑉𝑗 , weobtain the characterizations"2" 𝑓 𝐿2 𝑅 : 𝑓 𝑃𝑗 𝑓 0, 𝑎𝑠 𝑗 "3" 𝑓 𝐿2 𝑅 : 𝑃𝑗 𝑓 0 , 𝑎𝑠 𝑗 𝑃𝑗 𝑓 can be interpreted as an approximation to 𝑓 with resolution2𝑗 . Thus ―2‖ implies that this approximation converges to 𝑓, asresolution increases.Definition 3. Let 𝑉𝑗3 MAIN RESULTSAs Throughout this section we fix a multiresolution analysis𝑉𝑗with scaling function 𝜑, wavelet 𝜓 and scaling𝑗 𝑍coefficients 𝑎𝑘 𝑘 𝑍 . Given 𝑓 𝑉0 , we can expand it withrespect to two different orthonormal basis:𝑓 𝑘 𝑍𝑗 𝑍properties: 𝐣 𝐙 𝐕𝐣 𝐕𝐣 𝟏 ,𝟐𝐣 𝐙 𝐕𝐣 𝐋 (𝐑),𝐣 𝐙 𝐕𝐣 {𝟎}, 𝐣 𝐉, 𝐟 𝐋𝟐 𝐑 𝐟 𝐕𝐣 𝐃𝟐𝐣 𝐟 𝐕𝟎 ,𝐟 𝐕𝟎 𝐦 𝐙 𝐓𝐦 𝐟 𝐕𝟎 ,There exists 𝛗 𝐕𝟎 such that (𝐓𝐦 𝛗)𝐦 𝐙 is anorthonormal basis of 𝐕𝟎 .𝑗 𝑍denote an MRA. A space 𝑉𝑗 is called𝑐0,𝑘 𝑇𝑘 𝜑 𝑘 𝑍𝑑 1,𝑘 𝐷2 𝑇𝑘 𝜓 𝑘 𝑍𝑐 1,𝑘 𝐷2 𝑇𝑘 𝜑Here we use the notations𝜔 𝑓 𝜔 𝑚 𝜔 .In ―6‖ 𝜑 is called scaling function of 𝑉𝑗𝑗 𝑍approximation space of scale 𝑗. Denote by 𝑊𝑗 the orthogonalcomplement of 𝑉𝑗 in 𝑉𝑗 1 , so that we have the orthogonaldecomposition 𝑊𝑗 𝑉𝑗 𝑉𝑗 1 . 𝑊𝑗 is called the detail space ofscale 𝑗.Definition 1. A multiresolution analysis (MRA) is a sequenceof closed subspaces 𝑉𝑗of 𝐿2 (𝑅) with the following list of1.2.3.4.5.6.ISSN 2277-8616. The properties ―1‖-𝑐𝑗 ,𝑘 𝑓, 𝐷2 𝑗 𝑇𝑘 𝜑 𝑛 ��� ,𝑘 𝑓, 𝐷2 𝑗 𝑇𝑘 𝜓 ,"𝑑𝑒𝑡𝑎𝑖𝑙 𝑐𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡"In the following we will use 𝑑 𝑗 𝑑 𝑗 ,𝑘and 𝑐 𝑗 𝑐 𝑗 ,𝑘.𝑘 𝑍𝑘 𝑍At the heart of the fast wavelet transform are explicit formulaefor the correspondence𝑐 0 (𝑐1 , 𝑑1 )For this purpose we require one more piece of notation.Definition 10. The up- and downsampling operators 2 and 2are given by―6‖ are somewhat redundant. They are just listed for a betterunderstanding of the construction. The following discussionwill successively strip down ―1‖-―6‖ to the essential.Remarks 2. (a) Properties ―4‖ and ―6‖ imply that the scalingfunction 𝜑 uniquely determines the multiresolution analysis:We have𝑉0 𝑠𝑝𝑎𝑛(𝑇𝑘 𝜑 𝑘 𝑍) 2𝑓 𝑛 𝑓 2𝑛 , 2𝑓 𝑛 0𝑓 𝑘"𝑑𝑜𝑤𝑛"𝑛 𝑜𝑑𝑑,𝑛 2𝑘."𝑢𝑝"We have ( 2) ( 2), as well as 2 𝑜 2 𝐼, where 𝐼 isthe identity operator. In particular, 2 is an isometry. Theorem11. The bijection 𝑐 0 (𝑐1 , 𝑑1 ) is given byby ―6‖ (which incidentally takes care of ―5‖) and𝐴𝑛𝑎𝑙𝑦𝑠𝑖𝑠:𝑐 𝑗 1 2 𝑐 𝑗 ℓ , 𝑑 𝑗 1 2 𝑐 𝑗 𝑆𝑦𝑛𝑡 𝑒𝑠𝑖𝑠:𝑐 𝑗 2𝑐 𝑗 1 2𝑑 𝑗 1 ℓ And𝑉𝑗 𝐷2 𝑗 𝑉0is prescribed by ―4‖. What is missing are criteria for ―1‖-―3‖ and―6‖. However, note that in the following the focus of attentionshifts from the spaces 𝑉𝑗 to the scaling function 𝜑.Here the filters , ℓ are given by 𝑘 1ℓ 𝑘 𝑎 𝑘 / 2.1 𝑘𝑎1 𝑘 / 2 and(b) The parameter 𝑗 can be interpreted as resolution or248IJSTR 2014www.ijstr.org

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 3, ISSUE 9, SEPTEMBER 2014 Remark 12. The ―Cascade Algorithm‖: Iteration of the analysisstep yields 𝑐 𝑗 , 𝑑 𝑗 for 𝑗 1.ISSN 2277-8616Lo D is the decomposition low-pass filter.Hi D is the decomposition high-pass filter.Lo D and Hi D must be the same length.Starting from a signal s, two sets of coefficients are computed:approximation coefficients CA1, and detail coefficients CD1.These vectors are obtained by convolving s with the low-passfilter Lo D for approximation and with the high-pass filter Hi Dfor detail, followed by dyadic decimation. More precisely, thefirst step isWhereas the synthesis step is given byThe decomposition step corresponds to the orthogonaldecompositionsFor example we give the Haar wavelet as follow.Note that in MATLAB we have,Example. The Haar wavelet is the following simple stepfunction:10 x 1/2,𝜓 𝑥 χ[0,1/2[ χ[1/2,1[ 11/2 x 10o. w.Define𝑉0 {𝑓 𝐿2 𝑅 𝑛 𝑍 𝑓𝑛,𝑛 1Thus the closed subspace 𝑉𝑗𝑗 𝑍𝑛,𝑛 1We can compute the high pass and low pass filters , ℓ asfollows:ℓ 1/ 2 1/ 2 ,𝑖𝑠 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡}If we set 𝜑 𝜒[0,1[ , it is not hard to see that 𝑇𝑘 𝜑 𝑘 𝑍 is anorthonarmal basis of 𝑉0 . 𝜑 induces an MRA. Note that in thiscase𝑉𝑗 {𝑓 𝐿2 𝑅 𝑛 𝑍 𝑓ℓ 𝐿𝑖 𝐷, 𝐻𝑖 𝐷. [ 1/ 2 1/ 2] .The programming in the MATLAB is as follows:𝑖𝑠 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡}is indeed a multiresolutionanalysis, so called Haar multiresolution analysis. The Haarwavelet and it’s Fourier is as follows:With the following figure.Original signal600500400300Fig 1: The Haar wavelet and its Fourier transform (only theabsolute value)2000100200300400500600Approx. coef. for haarA. DWTdwt command performs a single-level one-dimensionalwavelet decomposition with respect to either a particularwavelet ('wname') or particular wavelet decomposition filters(Lo D and Hi D) that you specify. [cA,cD] dwt(X,'wname')computes the approximation coefficients vector cA and detailcoefficients vector cD, obtained by a wavelet decomposition ofthe vector X. The string 'wname' contains the wavelet name.[cA,cD] dwt(X,Lo D,Hi D)computesthewaveletdecomposition as above, given these filters as 1000Detail coef. for haar600-200200400600B. IDWTThe idwt command performs a single-level one-dimensionalwavelet reconstruction with respect to either a particular249IJSTR 2014www.ijstr.org

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 3, ISSUE 9, SEPTEMBER 2014ISSN 2277-8616wavelet ('wname') or particular wavelet reconstruction filters(Lo R and Hi R) that you specify. X idwt(cA,cD,'wname')returns the single-level reconstructed approximationcoefficients vector X based on approximation and detailcoefficients vectors cA and cD, and using the wavelet 'wname'.X idwt(cA,cD,Lo R,Hi R) reconstructs as above using filtersthat you specify. Lo R is the reconstruction low-pass filter. Hi R is the reconstruction high-pass filter.Lo R and Hi R must be the same length. idwt is the inversefunction of dwt in the sense that the abstract statementidwt(dwt(X,'wname'),'wname') would give back X. Starting fromthe approximation and detail coefficients at level j, cAj and cDj,the inverse discrete wavelet transform reconstructs cAj 1,inverting the decomposition step by inserting zeros andconvolving the results with the reconstruction filters.C. WAVDECwavedec performs a multilevel one-dimensional waveletanalysis using either a specific wavelet ('wname') or a specificwavelet decomposition filters (Lo D and Hi D). [C,L] wavedec(X,N,'wname') returns the wavelet decomposition ofthe signal X at level N, using 'wname'. N must be a strictlypositive integer. The output decomposition structure containsthe wavelet decomposition vector C and the bookkeepingvector L. The structure is organized as in this level-3decomposition example.Note that in MATLAB we have,ℓ 𝐿𝑜 𝑅, 𝐻𝑖 𝑅.We can compute the high and low pass filters , ℓ as follows:ℓ 1/ 2 1/ 2 , [ 1/ 2 1/ 2]The programming in the MATLAB is as follows:[C,L] wavedec(X,N,Lo D,Hi D) returns the decompositionstructure as above, given the low- and high-passdecomposition filters you specify.With the following figure.D. DETCOEFdetcoef is a one-dimensional wavelet analysis function. D detcoef(C,L,N) extracts the detail coefficients at level N fromthe wavelet decomposition structure [C,L]. Level N must be aninteger such that 1 N NMAX where NMAX length(L)-2. D detcoef(C,L) extracts the detail coefficients at last levelNMAX.E. ction.appcoef computes the approximation coefficients of aone-dimensional signal. A appcoef(C,L,'wname',N)computes the approximation coefficients at level N using thewavelet decomposition structure [C,L]. 'wname' is a string250IJSTR 2014www.ijstr.org

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 3, ISSUE 9, SEPTEMBER 2014containing the wavelet name. Level N must be an integer suchthat 0 N length(L)-2. Instead of giving the wavelet name,you can give the filters. For A appcoef(C,L,Lo R,Hi R) or A appcoef(C,L,Lo R,Hi R,N), Lo R is the reconstruction lowpass filter and Hi R is the reconstruction high-pass filter. Thefollowing programming is in level-3.ISSN 2277-8616[6]S. Mallat, ―A theory for multiresolution signaldecomposition: the wavelet representation,‖ IEEE Trans.PAMI, vol. 11, pp. 674-693, 1989.[7]S. Mallat, ―A Wavelet Tour of Signal Processing.‖ 2nd ed.Academic Press, 1999.[8]S. Mallat, ―Multifrequency channel decompositions ofimages and wavelet models,‖ IEEE Trans. Acoust . SignalSpeech Process., vol. 37, pp. 2091-2110, 1989.[9]S. Mallat, ―Multiresolution approximation and wavelets,‖Trans. Amer. Math. Soc., vol. 315, pp. 69-88, 1989.[10] J. Morlet, ―Sampling theory and wave propagation,‖ inNATO ASI Series, Vol. 1, Issues in Acoustic signal/Imageprocessing and recognition, C. H. Chen, ed., SpringerVerlag, Berlin, pp. 233-261, 1983.[11] J. Morlet, G. Arens, I . Fourgeau, and D. Giard, ―Wavepropagation and sampling theory,‖ Geophysics, vol. 47,pp. 203-236, 1982.[12] J.A. Packer and M.A. Rieffel, ―Projective multi-resolutionanalyses for L2 (Rd ),‖ J. Fourier Anal. Appl. 10, 439–464,2004.Also we have the following figure for this.[13] W. Rudin, ―Real and Complex Analysis,‖ Mcgraw-Hill,New York, 1987.[14] P.Wojtaszczyk, ‖A Mathematical Introduction toWavelets,‖ London Mathematical Society Student Texts37. Cambridge University Press, 1997.[15] P.J. Wood, ―Wavelets and C*-algebras,‖ PhD thesis,Flinders University of South Australia, 2003.REFERENCES[1]G. Beylkin, R. Coifman and V. Rokhlin, ―Fast wavelettmnsforms and numerical algorithms,‖ Comm. Pure Appl.Math. , vol. 44, pp. 141-183, 1991.[2]I. Daubechies, ―Ten Lectures on Wavelets.‖ CBMS-NFSregional series in applied mathematics. SIAM, 1992.[3]A. Grossmann and J. Morlet, ―Decomposition of Hardyjunctions into square integrable wavelets of constantshape,‖ SIAM J. Math. Anal., vol. 15, pp. 723-736, 1984.[4]R. Kronland-Martinet , J. Morlet, and A. Grossmann,―Analysis of sound patterns through wavelet tronsforms,‖Internat. J. Pattern Recognition and Artificial Intelligence,vol. 1, pp. 273-301, 1987.[5]Z. Liu, X. Mu and G. Wu, ―MRA Pparseval framemultiwavelets in L2 (Rd ),‖ Bulletin of the IranianMathematical Society Vol. 38, No. 4, pp 1021-1045, 2012.251IJSTR 2014www.ijstr.org

computes the approximation coefficients vector cA and detail coefficients vector cD, obtained by a wavelet decomposition of the vector X. The string 'wname' contains the wavelet name. [cA,cD] dwt(X,Lo_D,Hi_D) computes the wavelet decomposition as above, given these filters as input: Lo_D is the decomposition low-pass filter.

Related Documents:

aspects of wavelet analysis, for example, wavelet decomposition, discrete and continuous wavelet transforms, denoising, and compression, for a given signal. A case study exam-ines some interesting properties developed by performing wavelet analysis in greater de-tail. We present a demonstration of the application of wavelets and wavelet transforms

wavelet transform combines both low pass and high pass fil-tering in spectral decomposition of signals. 1.2 Wavelet Packet and Wavelet Packet Tree Ideas of wavelet packet is the same as wavelet, the only differ-ence is that wavelet packet offers a more complex and flexible analysis because in wavelet packet analysis the details as well

Wavelet analysis can be performed in several ways, a continuous wavelet transform, a dis-cretized continuous wavelet transform and a true discrete wavelet transform. The application of wavelet analysis becomes more widely spread as the analysis technique becomes more generally known.

The wavelet analysis procedure is to adopt a wavelet prototype function, called an analyzing wavelet or mother wavelet. Temporal analysis is performed with a contracted, high-frequency version of the prototype wavelet, while frequency analysis is performed with a dilated, low-frequency version of the same wavelet.

Workshop 118 on Wavelet Application in Transportation Engineering, Sunday, January 09, 2005 Fengxiang Qiao, Ph.D. Texas Southern University S A1 D 1 A2 D2 A3 D3 Introduction to Wavelet A Tutorial. TABLE OF CONTENT Overview Historical Development Time vs Frequency Domain Analysis Fourier Analysis Fourier vs Wavelet Transforms Wavelet Analysis .

3. Wavelet analysis This section describes the method of wavelet analy-sis, includes a discussion of different wavelet func-tions, and gives details for the analysis of the wavelet power spectrum. Results in this section are adapted to discrete notation from the continuous formulas given in Daubechies (1990). Practical details in applying

FT Fourier Transform DFT Discrete Fourier Transform FFT Fast Fourier Transform WT Wavelet Transform . CDDWT Complex Double Density Wavelet Transform PCWT Projection based Complex Wavelet Transform viii. . Appendix B 150 Appendix C 152 References 153 xiii.

A separate practical record for Botany and Zoology is to be maintained. Use only pencils for drawing and writing the notes in the interleaves of the record. Below the diagram, they should write the caption for the diagram in bold letters. While labeling different parts of the diagram, draw horizontal indicator lines with the help of a scale. SAFETY IN THE LABORATORY: The following precaution .