Stack X-tree image coding

This paper proposes a new image coding scheme, called the stack X-tree coding. It replaces the zero run in the stack-run coding by the X-tree. An X-tree is defined as a spatial hierarchical tree without significant descendants. By taking advantage of the inter-band dependencies, the X-tree can express more efficiently insignificant coefficients in a wavelet image than the zero run. Experimental results have shown that the performance of the proposed algorithm is better than that of the stack-run, and is highly competitive with that of SPIHT.