Generalizing SPIHT: a family of efficient image compression algorithms

Authors:
R. R. Shively;E. Ammicht;P. D. Davis
Affiliations:
Lucent Technol. Bell Labs., Whippany, NJ, USA;-;-
Venue:
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04
Year:
2000

Citing 0
Cited 2

A fast and low memory image coding algorithm based on lifting wavelet transform and modified SPIHT

Image Communication
Image Wavelet Coding Systems: Part II of Set Partition Coding and Image Wavelet Coding Systems

Foundations and Trends in Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a family of list-free tree-set scanning (LIFTS) algorithms, related to Shapiro's (1993) embedded zero-tree wavelet (EZW) coding and to Said and Pearlman's (see IEEE Trans. on Circuits and Systems for Video Technology, vol.6, no.3, p.243-9, 1996) set partitioning in hierarchical trees (SPIHT) algorithm. The principal advantage of the LIFTS algorithms is that they are parallelizable and require greatly reduced computational complexity and memory overhead, while nearly achieving the efficiency of SPIHT. The algorithms may be tailored to special requirements, such as transmission of a fully embedded bit-stream with sub-image refinement.