An Improved SPIHT Algorithm Based on Binary Tree

Matlab code for TSPIHT

Matlab for the paper "HUANG Ke-kun. Improved SPIHT Algorithm Based on Binary Tree[J], Computer Engineering, 2012, 38(15):218-221." In order to raise the performance of SPIHT and maintain the encoding speed, the SPIHT algorithm is improved by binary tree. A new binary tree coding algorithm is proposed to code the 4 coefficients splited by D-type sets. Through coding the significance of L-type sets first, the algorithm can determine the significance of the root of the binary tree in advance with high probability, so as to further improve the coding efficiency. Experimental results show that the speed of the proposed method is as fast as SPIHT and it can significantly improve PSNR.