packtree_int.h

小波包分解去噪c++源程序

#ifndef _PACKTREE_INT_H_
#define _PACKTREE_INT_H_


#include "packtree_base_int.h"
#include "packdata_list.h"
#include "packcontainer.h"
#include "liftbase.h"


/** \file

  The documentation in this file is formatted for doxygen
  (see www.doxygen.org).

<h4>
   Copyright and Use
</h4>

<p>
   You may use this source code without limitation and without
   fee as long as you include:
</p>
<blockquote>
     This software was written and is copyrighted by Ian Kaplan, Bear
     Products International, www.bearcave.com, 2002.
</blockquote>
<p>
   This software is provided "as is", without any warranty or
   claim as to its usefulness.  Anyone who uses this source code
   uses it at their own risk.  Nor is any support provided by
   Ian Kaplan and Bear Products International.
<p>
   Please send any bug fixes or suggested source changes to:
<pre>
     [e-mail]
</pre>

  @author Ian Kaplan

 */

/**

  The packtree_int object constructs a wavelet packet tree

  The constructor is passed a vector of integers, the length of the
  vector (which must be a power of two) and a pointer to a wavelet
  lifting scheme class that will be used in calculating the wavelet
  transform step.  If the vector passed to the constructor contains N
  <i>int</i> vaues, the result of the constructor will be a wavelet packet
  tree with log<sub>2</sub>(N) levels.

 */

class packtree_int : public packtree_base_int {
private:

  /** Found original data marked as part of the best basis.
      This means that the best basis function failed (or
      that the original data is the most compact representation
      relative to the cost function used).  */
  bool foundOriginalData;
  /** found a best basis value in the wavelet packet tree */
  bool foundBestBasisVal; 
  
private:
  /** disallow the copy constructor */
  packtree_int( const packtree_int &rhs ) {};
  /** disallow the default constructor */
  packtree_int() {};

  int bestBasisWalk( packnode<int> *root );

  void buildBestBasisList( packnode<int> *root, 
			   packdata_list<int> &list );

  void checkBestBasis( packnode<int> *root );

  void cleanTree(packnode<int> *root, bool removeMark );

public:

  packtree_int( const int *vec, 
		const size_t n, 
		liftbase<packcontainer_int, int> *w );

  /** destructor does nothing */
  ~packtree_int() {}

  void prCost();
  void prBestBasis();

  void bestBasis();

  bool bestBasisOK();

  packdata_list<int> getBestBasisList();

}; // packtree_int

#endif