A new parallel realization method of SPIHT for video compression

Set partitioning in hierarchical trees (SPIHT) is an efficient method for image or video compression. However, it requires a large amount of memory space to store intermediate result about significance of pixels and sets with three lists. In this paper, we present a new SPIHT algorithm in which we can process the trees of SPIHT in parallel and individually. We also introduce a new way to truncate bit stream of trees. The simulation result shows the new method can keep the efficiency of SPIHTcompression while save a lot of memory space and time in implement.