View Printable Version

Zhi-Yong Chen and Mahmoud R. El-Sakka, "Optimizing the Tree Structure in the Lossless Binary Tree Predictive Coding", International Computer Engineering Conference, ICENCO'2004, pp. 536 - 541, December 2004, Cairo, Egypt.


Data structures are a very important factor in most image compression algorithms. In this paper, we analyzed the binary tree data structure of the Binary Tree Predictive Coding (BTPC) scheme, and provided two modifications to further improve the performance of the algorithm: (1) adjusting the level of the binary tree, (2) adjusting the threshold which is used to separate tree and data portions in the encoding. The proposed scheme has been tested on different image classes. The results show that the two suggested modifications reduce the decoding time complexity of the BTPC scheme by 3.73~14.88% on average. At the same time, the compression performance is slightly improved by 0.25~0.95% on average in natural scene and medical images.