A new fast lower-tree wavelet image encoder

Author

Oliver, J. ; Malumbres, M.P.

Author_Institution

Dept. of Comput. Eng. (DISCA), Univ. Politecnica de Valencia, Spain

Volume

3

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

780

Abstract

During the last decade, a lot of research and development efforts have been made to design competitive still image coders for several kinds of applications. We present a new wavelet still-image coder, called LTW (lower-tree wavelet), based on the construction and codification of coefficient trees, as other proposals are. This algorithm is fast and symmetric (except at extremely low bit rates), which makes it adequate for real-time interactive multimedia applications. We have compared our algorithm with several well-known coders in terms of rate-distortion performance using the standard Lena image. Results show that LTW, with lower temporal complexity, achieves better results than EZW (0.8 dB PSNR) and stack-run (0.13 dB) coders. Also, we have tested the temporal complexity of the LTW algorithm, resulting in it being 3.5 times faster than an optimized EZW (embedded zero-tree wavelet) encoder

Keywords

computational complexity; data compression; image coding; rate distortion theory; transform coding; tree codes; trees (mathematics); coefficient trees; image compression; lower-tree wavelet coder; rate-distortion performance; real-time interactive multimedia applications; still image encoder; temporal complexity; Arithmetic; Bit rate; Design engineering; Electronic mail; Encoding; Entropy; Image coding; Proposals; Quantization; Wavelet coefficients;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 2001. Proceedings. 2001 International Conference on

Conference_Location

Thessaloniki

Print_ISBN

0-7803-6725-1

Type

conf

DOI

10.1109/ICIP.2001.958236

Filename

958236