Share Email Print
cover

Proceedings Paper

Setting priorities: a new SPIHT-compatible algorithm for image compression
Author(s): Diego Dugatkin; Michelle Effros
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We introduce a new algorithm for progressive or multiresolution image compression. The algorithm improves on the Set Partitioning in Hierarchical Trees (SPIHT) algorithm by replacing the SPIHT encoder. The new encoder optimizes the multiresolution code performance relative to a user- defined probability distribution over the code's rates or resolutions. The new algorithm's decoder is identical to the SPIHT decoder. The resulting code achieves the optimal expected performance across resolutions subject to the constraints imposed by the use of the SPIHT decoder and the distribution over resolutions set by the user. The encoder optimization yields performance improvements at the rates or resolutions of greatest importance at the expense of performance degradation at low priority rates or resolutions. The algorithm is fully compatible at the decoder with the original SPIHT algorithm. In particular, the decoder requires no knowledge of the priority function employed at the encoder. Experimental results on an image containing both text and photographic material yield up to 0.86 dB performance improvement over SPIHT at the resolution of highest priority.

Paper Details

Date Published: 4 December 2000
PDF: 7 pages
Proc. SPIE 4119, Wavelet Applications in Signal and Image Processing VIII, (4 December 2000); doi: 10.1117/12.408670
Show Author Affiliations
Diego Dugatkin, California Institute of Technology (United States)
Michelle Effros, California Institute of Technology (United States)


Published in SPIE Proceedings Vol. 4119:
Wavelet Applications in Signal and Image Processing VIII
Akram Aldroubi; Andrew F. Laine; Michael A. Unser, Editor(s)

© SPIE. Terms of Use
Back to Top