Abstract
The wavelet transform is more and more widely used in image and video compression. As today the parallelisation of the wavelet transform is sufficiently investigated this work deals with the compression algorithm (SPIHT) itself as a next step. A derived algorithm with a simpler and spacially oriented coefficient scan order is presented, which is more suitable for parallelisation.
The author wants to thank the EPCC (Edinburgh Parallel Computing Centre) and the TR ACS programme (Training and Research on Advanced Computing Systems) for providing equipment, infrastructure and support for parallel computing (especially on Cray T3E). The author was also supported by the Austrian Science Fund FWF, project no. P13903.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
ISO/IEC JPEG committee. JPEG 2000 image coding system, March 2000. Final Committee Draft.
C. D. Creusere. Image coding using parallel implementations of the embedded zerotree wavelet algorithm. In B. Vasudev, S. Frans, and S. Panchanathan, editors, Digital Video Compression: Algorithms and Technologies 1996, volume 2668 of SPIE Proceedings, pages 82–92, 1996.
B. J. Kim and W. A. Pearlman. An embedded wavelet video coder using three-dimensional set partitioning in hierarchical trees (SPIHT). In Proceedings Data Compression Conference (DCC’97), pages 251–259. IEEE Computer Society Press, March 1997.
R. Kutil. Zerotree based video coding on mimd architectures. In S. Panchanathan, V. Bove, and S. I. Sudharsanan, editors, Media Processors 2001, volume 4313 of SPIE Proceedings, pages 61–68, January 2001.
R. Kutil and A. Uhl. Hardware and software aspects for 3-D wavelet decomposition on shared memory MIMD computers. In P. Zinterhof, M. Vajtersic, and A. Uhl, editors, Parallel Computation. Proceedings of ACPC’99, volume 1557 of Lecture Notes on Computer Science, pages 347–356. Springer-Verlag, 1999.
A. Said and W. A. Pearlman. A new, fast, and efficient image codec based on set partitioning in hierarchical trees. IEEE Transactions on Circuits and Systems for Video Technology, 6(3):243–249, 1996.
F. W. Wheeler and W. A. Pearlman. Low-memory packetized SPIHT image compression. In Proceedings of the Asilomar Conference on Signals, Systems, and Computers, October 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutil, R. (2001). Parallelisable Zero-Tree Image Coding with Significance Maps. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_96
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive