Approaches to zerotree image and video coding on MIMD architectures

Authors:
Rade Kutil
Affiliations:
Department of Scientific Computing, University of Salzburg, Jakob Haringer Strasse 2, 5020, Salzburg, Austria
Venue:
Parallel Computing - Parallel computing in image and video processing
Year:
2002

Citing 4
Cited 3

On the Scalability of 2-D Discrete Wavelet Transform Algorithms

Multidimensional Systems and Signal Processing
An Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT)

DCC '97 Proceedings of the Conference on Data Compression
SPIHT image compression without lists

ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology

High performance JPEG 2000 and MPEG-4 VTC on SMPs using OpenMP

Parallel Computing - OpenMp
Scalable load-balance measurement for SPMD codes

Proceedings of the 2008 ACM/IEEE conference on Supercomputing
An embedded wavelet image coder with parallel encoding and sequential decoding of bit-planes

Real-Time Imaging

Quantified Score

Hi-index	0.00

Visualization

Abstract

The wavelet transform is more and more widely used in image and video compression. One of the best known algorithms in image compression is the set partitioning in hierarchical trees algorithm which involves the wavelet transform. As today the parallelisation of the wavelet transform is sufficiently investigated, this work deals with the parallelisation of the compression algorithm itself as a next step. Two competitive approaches are presented: one is a direct parallelisation and the other uses an altered algorithm which suits better to the parallel architecture.