WaveDWT

class WaveDWT : public Wavelet

    public:

         virtual void ~WaveDWT()
       static TClass* Class()
         virtual void decompose(int, int)
         virtual void Denoise(wavereal)
                  int DumpWTAsBitmap(const char*, unsigned int = 0)
                 void getFreqLayer(WaveData&, int)
                  int getIdA(int, int)
                  int getIdF(int, int)
                  int getIdL(int, int)
                 void getLayer(WaveData&, int)
          virtual int getMaxLevel()
      virtual TClass* IsA() const
                 void putFreqLayer(WaveData&, int)
                 void putLayer(WaveData&, int)
         virtual void reconstruct(int, int)
                 void Rotate(int, int, wavereal)
         virtual void ShowMembers(TMemberInspector& insp, char* parent)
         virtual void Streamer(TBuffer& b)
         virtual void t2w(const WaveData&, int = -1)
         virtual void t2w(int = 1)
         virtual void t2w(const TSeries&, int = -1)
         virtual void w2t(int = 1)
         virtual void w2t(TSeries&, int = -1)
         virtual void w2t(WaveData&, int = -1)

  Data Members

    public:

      WSeries* pWDC      pointer to WSeries class containing data
           int nh        number of filter coefficients
           int MaxLevel  maximal level of decomposition
           int Level     current level of decomposition 
           int IsTree    0-diadic, 1-binary tree
           int border    see constants definitions above

See also

WaveletD, WaveletI, WaveletL, WaveletM

Class Description

 WaveDWT is the abstract base class for discrete wavelet
 transform  methods. It includes methods, like getLayer,
 putLayer, t2w, w2t, etc.

 Destructor.

 Virtual procedure for forward wavelet transform that
 take initial data from WaveData "td" and places result
 in WSeries class.
 Only ldeep steps of decomposition will be done.
 By default ldeep=-1, which means do maximum number of allowed steps.

 Virtual procedure for forward wavelet transform.
 Real code will appear in
 derivative classes since it depends of the type of wavelet.
 Only ldeep steps of decomposition will be done.
 By default ldeep=1, which means do one step.

 Virtual procedure for inverse wavelet transform that
 take initial data from current WSeries class without places
 result into object of  WaveData class.
 Only ldeep steps of backward composition will be done.
 By default ldeep=1, which means do one step.

 Virtual procedure for inverse wavelet transform that
 take initial data from current WSeries class and places
 result to object td of  WaveData class.
 Only ldeep steps of backward composition will be done.
 By default ldeep=-1, which means do maximum allowed steps.

 Simple denoising procedure. Sets to zero all elements of
 wavelet spectrum which absolute value less then "cut".

 Get layer with given number k and put it into td array.

 Replace content of the layer number k with data from array td.

 The same as getLayer, but select layers in frequency order.

 The same as putLayer, but put layers in frequency order.

 Calculate maximal level of wavelet decomposition.
 It depends on filter length.

 Gets wavelet layer number for given level and layer.

 Get frequency ID number for given level and layer.

 Get the layer number in binary tree for given level and frequency ID number.

Inline Functions

               void decompose(int, int)
               void reconstruct(int, int)
               void Rotate(int, int, wavereal)
            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)