Paper Info
Title
Parallelisable Zero-Tree Image Coding with Significance Maps
Abstract
The wavelet transform is more and more widely used in image and video compression. As today the parallelisation of the wavelet transformis 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.
Year
DOI
Venue
2001
10.1007/3-540-44681-8_96
Euro-Par
Keywords
Field
DocType
wavelet transformis,video compression,compression algorithm,work deal,significance maps,next step,parallelisable zero-tree image,wavelet transform
Tree (graph theory),Computer science,Image processing,Artificial intelligence,Wavelet,Wavelet transform,Computer vision,Set partitioning in hierarchical trees,Parallel computing,Algorithm,Image coding,Data compression,Image compression
Conference
ISBN
Citations 
PageRank 
3-540-42495-4
3
0.42
References 
Authors
4
1
Name
Order
Citations
PageRank
Rade Kutil1618.80