SPIHT image compression without lists

Authors:
F. W. Wheeler;W. A. Pearlman
Affiliations:
Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA;-
Venue:
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04
Year:
2000

Citing 0
Cited 12

Approaches to zerotree image and video coding on MIMD architectures

Parallel Computing - Parallel computing in image and video processing
The adaptive modulated wavelet transform image representation

Pattern Recognition Letters
Memory-efficient spatial prediction image compression scheme

Image and Vision Computing
Efficient FPGA implementation of DWT and modified SPIHT for lossless image compression

Journal of Systems Architecture: the EUROMICRO Journal
A fast and low memory image coding algorithm based on lifting wavelet transform and modified SPIHT

Image Communication
Linked significant tree wavelet-based image compression

Signal Processing
Image Wavelet Coding Systems: Part II of Set Partition Coding and Image Wavelet Coding Systems

Foundations and Trends in Signal Processing
Multimode embedded compression codec engine for power-aware video coding system

IEEE Transactions on Circuits and Systems for Video Technology
Very low-memory wavelet compression architecture using strip-based processing for implementation in wireless sensor networks

EURASIP Journal on Embedded Systems - Special issue on design and architectures for signal and image processing
An embedded wavelet image coder with parallel encoding and sequential decoding of bit-planes

Real-Time Imaging
Low-memory video compression architecture using strip-based processing for implementation in wireless multimedia sensor networks

International Journal of Sensor Networks
VLSI architecture of arithmetic coder used in SPIHT

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A variant of the SPIHT image compression algorithm called no list SPIHT (NLS) is presented. NLS operates without linked lists and is suitable for a fast, simple hardware implementation. NLS has a fixed predetermined memory requirement about 50% larger than that needed for the image alone. Instead of lists, a state table with four bits per coefficient keeps track of the set partitions and what information has been encoded. NLS sparsely marks selected descendant nodes of insignificant trees in the state table in such a way that large groups of predictably insignificant pixels are easily identified and skipped during coding passes. The image data is stored in a one dimensional recursive zig-zag array for computational efficiency and algorithmic simplicity. The performance of the algorithm on standard test images is nearly the same as SPIHT.