Memory constrained wavelet based image coding

被引：16

作者：

Cosman, P ^{[1
]}

Zeger, K ^{[1
]}

机构：

[1] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA

来源：

IEEE SIGNAL PROCESSING LETTERS | 1998年 / 5卷 / 09期

基金：

美国国家科学基金会;

关键词：

color image coding; data compression; source coding; wavelet transforms; zerotrees;

D O I：

10.1109/97.712104

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We present a method for ordering the wavelet coefficient information in a compressed bitstream that allows an image to be sequentially decoded, with lower memory requirements than conventional wavelet decompression schemes. We also introduce a hybrid filtering scheme that uses different horizontal and vertical filters, each with different depths of wavelet decomposition. This reduces decoder memory requirements by reducing the instantaneous number of wavelet coefficients needed fbr inverse filtering.

引用

页码：221 / 223

页数：3

共 7 条

[1]

CHRYSAFIS C, 1998, P DATA COMPRESSION C

[2]

COSMAN P, 1998, P 1998 INT C IM PROC

[3]

COSMAN PC, 1998, C REC 1 ANN UCSD C W, P54

[4]

PETTERSSON M, 1997, S581 LINK U DEPT EL

[5] 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

[6] EMBEDDED IMAGE-CODING USING ZEROTREES OF WAVELET COEFFICIENTS [J].

SHAPIRO, JM .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1993, 41 (12) :3445-3462

[7]

TENG CY, 1996, P DAT COMPR C 96, P406

← 1 →