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

被引:0
作者
Oliver, J [1 ]
Malumbres, MP [1 ]
机构
[1] Univ Politecn Valencia, Dept Comp Sci DISCA, Valencia 46071, Spain
来源
PATTERN RECOGNITION AND IMAGE ANALYSIS, PT 1, PROCEEDINGS | 2005年 / 3522卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A new image coder is described in this paper. Since it is based on the Discrete Wavelet Transform (DWT), it yields good Rate/Distortion (RID) 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 JPEG20OO/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).
引用
收藏
页码:435 / 442
页数:8
相关论文
共 7 条
[1]  
ADAM M, 2002, 2415 ISO 1SC 29WG 1N
[2]  
CHRYSAFIS C, 2000, IEEE T IMAGE PRO MAR
[3]  
ISO/IEC, 2000, 154441 ISOIEC
[4]  
MALLAT S, 1989, IEEE T PATTERN A JUL
[5]  
OLIVER J, 2004, 24 PICT COD S DEC
[6]   A new, fast, and efficient image codec based on set partitioning in hierarchical trees [J].
Said, A ;
Pearlman, WA .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 1996, 6 (03) :243-250
[7]  
VISHWANATH M, 1994, IEEE T SIGNAL PR MAR