Coifman-Wickerhauser Best-Basis Algorithm
[btree,vtree] = BestBasis(stree,D)
stat-tree (output by CalcStatTree)
maximum depth of tree-search
basis-tree 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 stattree of entropy values is created, BestBasis selects the best basis using the pruning algorithm described in Wickerhauser's book.
Wickerhauser, M.V. Adapted Wavelet Analysis