A fast technique for identifying zerotrees in the EZW algorithm

Authors:
J. M. Shapiro
Affiliations:
Aware Inc., Bedford, MA, USA
Venue:
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03
Year:
1996

Citing 0
Cited 9

A Scalable Architecture for MPEG-4 Wavelet Quantization

Journal of VLSI Signal Processing Systems - Special issue on implementation of MPEG-4 multimedia codecs
Non-Memory-Based and Real-Time Zerotree Building for Wavelet Zerotree Coding Systems

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Non-RAM-based architectural designs of wavelet-based digital systems based on novel nonlinear I/O data space transformations

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
SPRINT: a tool to generate concurrent transaction-level models from sequential code

EURASIP Journal on Applied Signal Processing
A fast and low memory image coding algorithm based on lifting wavelet transform and modified SPIHT

Image Communication
M-LTW: A fast and efficient intra video codec

Image Communication
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
E-LTW: an enhanced LTW encoder with sign coding and precise rate control

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
On the use of genetic algorithms to improve wavelet sign coding performance

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The embedded zerotree wavelet (EZW) algorithm has become a popular benchmark for image compression algorithms. The current paper presents a fast technique for identifying zerotrees for all dominant passes in the encoder prior to encoding. The key is initializing a data structure called a zerotree map with the largest power of two smaller than a given coefficient, and then completing the zerotree map by bitwise-ORing the values of potential parents with those of their children. This simple operation can be performed in parallel with the wavelet transform operation and thus is efficient for both hardware and software implementations.