Low-memory packetized SPIHT image compression
F.W. Wheeler, William A. Pearlman · 2003
The SPIHT image compression algorithm is modified for application to large images with limited processor memory. The subband decomposition coefficients are partitioned into small tree-preserving spatial blocks which are each independently coded using the SPIHT algorithm. The bitstreams for each spatial block are assembled into a single final bitstream through one of two packetization schemes. The final bitstream can be embedded in fidelity with a small expense in rate, SPIHT encoding and decoding of the spatial blocks can be done in parallel for real-time video compression.