Improved SPIHT Algorithm Based on Binary Tree
Huang Ke-kun · Jisuanji gongcheng · 2012
In order to raise the performance of Set Partitioning in Hierarchical Trees(SPIHT) algorithm and maintain the encoding speed,an improved SPIHT algorithm based on binary tree is proposed.Four coefficients splited by D-type sets are coded by binary tree.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 algorithm is as fast as SPIHT algorithm,and it can improve Peak Signal to Noise Ratio(PSNR).