Generalizing SPHIT: A Family of Efficient Image Compression Algorithms

This paper describes a family of List-Free Tree-Set Scanning (LIFTS) algorithms, related to Shapiro's Embedded Zero-Tree Wavelet (EZW) coding and to Said and Pearlman's Set Partitioning in Hierarchical Trees (SPIHT) algorithm. The principal advantage of the LIFTS algorithms is that they require greatly reduced computational complexity and memory overhead, while nearly achieving the efficiency of SPIHT. Algorithms may be tailored to special requirements, such as transmission of a fully embedded bit-stream with sub-image refinement.