Code transformation of DF-expression between bintree and quadtree

In this paper, algorithms for transforming code between bintree and quadtree are proposed. The quadtree and bintree are two commonly used representations for image manipulations. However, there exists no algorithm for transforming code between bintree and quadtree. When one receives a DF-expression of a bintree or quadtree code and does not have the corresponding decoding program, she/he, with our new code transformation algorithms at hand, can transform the received code into a quadtree or bintree code that she/he can handle. After code transformation, the receiver can see whether the output code is smaller than the input code. From it, she/he can further decide which code is more economic in its memory space needed; therefore, she/he can store the code with smaller size for saving more memory space.