Coifman-Wickerhauser Best-2d-Basis Algorithm
[btree,vtree] = Best2dBasis(sqtree,D)
stat-quadtree (output by Calc2dStatTree)
maximum depth of tree-search
basis-quadtree of best basis
value of components of best basis, vtree(1) holds value of best basis
The best-basis algorithm is used to pick out the ``best'' basis from all the possible bases in the packet table. Here ``best'' means minimizing an additive measure of information, called entropy by Coifman and Wickerhauser.
Once the stat-quadtree of entropy values is created, Best2dBasis selects the best basis using the pruning algorithm described in Wickerhauser's book.
Yale University has filed a patent application for this algorithm. Commercial Development based on this algorithm should be cleared by Yale University. Contact them for licensing information.
Wickerhauser, M.V. _Adapted_Wavelet_Analysis_. AK Peters (1994).