Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0167-8191(02)00108-4 | Parallel Computing |
Keywords | Field | DocType |
video compression,direct parallelisation,compression algorithm,video coding,known algorithm,zerotree,mimd architecture,competitive approach,parallel architecture,image compression,hierarchical trees algorithm,wavelets,mimd,next step,altered algorithm,wavelet transform | Set partitioning in hierarchical trees,Computer science,Parallel computing,Theoretical computer science,Discrete wavelet transform,Data compression,Stationary wavelet transform,Wavelet packet decomposition,Image compression,Wavelet transform,Wavelet | Journal |
Volume | Issue | ISSN |
28 | 7-8 | Parallel Computing |
Citations | PageRank | References |
6 | 0.55 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rade Kutil | 1 | 61 | 8.80 |