PEZW-ID: An algorithm for distributed parallel embedded zerotree wavelet encoder

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The image compression algorithm based on EZW can get any compression ratio as specified, which is widely used in the field of image processing. However, with massive computation during wavelet transformation and multiple scans of the transformed wavelet coefficient matrix during encoding processing, much time is consumed. Therefore, both the parallelism of wavelet transformation and zerotree encoding for EZW are necessary, and then we present PEZW-ID: an algorithm for distributed parallel embedded zerotree wavelet encoder. This paper describes the flow of the algorithm, proves the validity, and shows the performance analysis. Finally, with the experimental results under MPP, the parallelism and scalability of the algorithm have been verified. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Chang, Z. M., Jiang, Y. H., Yang, X. J., & Qu, X. L. (2004). PEZW-ID: An algorithm for distributed parallel embedded zerotree wavelet encoder. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3358, 1024–1029. https://doi.org/10.1007/978-3-540-30566-8_116

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free