A List of Pixel State Based SPIHT Image Coding Algorithm
Yan Xiao-ping · 2006
In this paper,a new SPIHT(set partitioning in hierarchical trees) image compression coding algorithm based on the list of pixel states(LPS-SPIHT) is presented,which has five characters as follows: Firstly,a kind of extended spatial orientation tree is defined,which makes every point include four adjacent pixels of 2×2,and the essential signs of EZW(embedded zerotree wavelet) is applied to the extended spatial orientation tree;Secondly,the three lists of SPIHT(LIS、LIP、LSP) are substituted by a low-cost list of pixel states,saving the memory of program.Thirdly,the coding process is once accomplished by means of scanning the list of pixel states,making the sorting pass and refinement pass combine to one;Fourthly,using of one tree exponent gets rid of repeading computation and then results in,the speed up of the significance judgement of trees;Lastly,some predictable bits are omitted from the encoder output by rearranging the coding procedure,to reduce the redundancy of the coding and improve the compression efficiency.Practical experiments show that comparing with SPIHT algorithm which is among the best of existing coding methods,this algorithm not only has better performance,but also is easy to implement,especially,it provides a feasible referencing model for hardware design.