Optimal representations in multitree dictionaries with application to compression

We generalize our results of [Y. Huang et al, 2005 and 2003] and propose a new framework of multitree dictionaries which include many previously proposed dictionaries as well as many new, very large, tree-structured dictionaries. We present an efficient, globally optimal algorithm to find the best tree in such a dictionary. We describe a novel block image coder based on our framework, which is an improvement over our image coder presented in Y. Huang et al, (2005).