Low-memory packetized SPIHT image compression

Author

Wheeler, Frederick W. ; Pearlman, William A.

Author_Institution

Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA

Volume

2

fYear

1999

fDate

24-27 Oct. 1999

Firstpage

1193

Abstract

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.

Keywords

data compression; decoding; packet switching; trees (mathematics); video coding; JPEG 2000 standardization committee; JPEG 2000 verification module test software; SPIHT decoding; SPIHT encoding; SPIHT image compression algorithm; bitstreams; large images; low-memory packetized image compression; real-time video compression; subband decomposition coefficients; tree-based codec; tree-preserving spatial blocks; Assembly; Codecs; Decoding; Image coding; Partitioning algorithms; Random access memory; Read-write memory; Resilience; Systems engineering and theory; Transform coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-7803-5700-0

Type

conf

DOI

10.1109/ACSSC.1999.831896

Filename

831896