A fast run-length algorithm for wavelet image coding with reduced memory usage

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

Abstract

A new image coder is described in this paper. Since it is based on the Discrete Wavelet Transform (DWT), it yields good Rate/Distortion (R/D) performance. However, our proposal focuses on overcoming the two main problems of wavelet-based image coders: they are typically implemented by memory-intensive and time-consuming algorithms. In order to avoid these common drawbacks, we ought to tackle these problems in the main stages of this type of coder, i.e., both the wavelet computation and the entropy coding of the coefficients. The proposed algorithms are described in such a manner that they can be implemented in any programming language straightforwardly. The numerical results show that while the R/D performance achieved by our proposal is similar to the state-of-the-art coders, such as SPIHT and JPEG2000/Jasper, the amount of memory required in our algorithm is reduced drastically (in the order of 25 to 35 times less memory), and its execution time is lower (three times lower than SPIHT, and more than ten times lower than JPEG 2000/Jasper). © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Oliver, J., & Malumbres, M. P. (2005). A fast run-length algorithm for wavelet image coding with reduced memory usage. In Lecture Notes in Computer Science (Vol. 3522, pp. 435–442). Springer Verlag. https://doi.org/10.1007/11492429_53

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