Abstract
In this paper, we describe and analyze algorithms for advanced image coding on distributed-memory MIMD architectures. In particular, we consider a wavelet packet-based image codec using the concept of zerotree encoding. The main contribution of this work is the design of a parallel image coder composed of a wavelet packet decomposition in conjunction with the best basis algorithm followed by zerotree coding. Whereas two sensible parallelization techniques can be employed for the wavelet packet decomposition (subband-based partitioning and stripe partitioning), the zerotree coding step only allows one reasonable parallelization method (stripe partitioning). We investigate the advantages and drawbacks of all combinations and show experimental results obtained on a Siemens hpcLine cluster and a Cray T3E.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
